TSTP Solution File: GEO344+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO344+1 : TPTP v5.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 05:38:27 EST 2010
% Result : Theorem 1.98s
% Output : Solution 1.98s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP18050/GEO344+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18050/GEO344+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18050/GEO344+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 18146
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.083 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,((ron(vd1409,vd1419)&ron(vd1401,vd1419))&rline(vd1419)),file('/tmp/SRASS.s.p', 'and(pred(s2(plural(the(409))), 0), and(pred(s1(plural(the(409))), 0), pred(the(409), 0)))')).
% fof(2, axiom,~(vd1409=vd1401),file('/tmp/SRASS.s.p', 'holds(conjunct2(conjunct2(conjunct2(406))), 1413, 0)')).
% fof(4, axiom,![X6]:![X7]:![X8]:![X9]:(((((((((ron(X7,X9)&ron(X7,X8))&ron(X6,X9))&ron(X6,X8))&?[X10]:(X9=X10&rline(X10)))&?[X11]:(X8=X11&rline(X11)))&~(X6=X7))&?[X12]:(X7=X12&rpoint(X12)))&?[X13]:(X6=X13&rpoint(X13)))=>X8=X9),file('/tmp/SRASS.s.p', 'qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))')).
% fof(9, axiom,rpoint(vd1409),file('/tmp/SRASS.s.p', 'pred(406, 0)')).
% fof(62, axiom,(((((((((vd1406=vd1407&ron(vd1400,vd1406))&ron(vd1399,vd1406))&rline(vd1407))&~(vd1400=vd1401))&~(vd1399=vd1401))&~(vd1399=vd1400))&?[X377]:(vd1401=X377&rpoint(X377)))&?[X378]:(vd1400=X378&rpoint(X378)))&?[X379]:(vd1399=X379&rpoint(X379))),file('/tmp/SRASS.s.p', 'and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))')).
% fof(128, conjecture,![X192]:(((ron(vd1409,X192)&ron(vd1401,X192))&rline(X192))=>X192=vd1419),file('/tmp/SRASS.s.p', 'qu(theu(the(409), 1), imp(the(409)))')).
% fof(129, negated_conjecture,~(![X192]:(((ron(vd1409,X192)&ron(vd1401,X192))&rline(X192))=>X192=vd1419)),inference(assume_negation,[status(cth)],[128])).
% cnf(161,plain,(rline(vd1419)),inference(split_conjunct,[status(thm)],[1])).
% cnf(162,plain,(ron(vd1401,vd1419)),inference(split_conjunct,[status(thm)],[1])).
% cnf(163,plain,(ron(vd1409,vd1419)),inference(split_conjunct,[status(thm)],[1])).
% cnf(164,plain,(vd1409!=vd1401),inference(split_conjunct,[status(thm)],[2])).
% fof(173, plain,![X6]:![X7]:![X8]:![X9]:(((((((((~(ron(X7,X9))|~(ron(X7,X8)))|~(ron(X6,X9)))|~(ron(X6,X8)))|![X10]:(~(X9=X10)|~(rline(X10))))|![X11]:(~(X8=X11)|~(rline(X11))))|X6=X7)|![X12]:(~(X7=X12)|~(rpoint(X12))))|![X13]:(~(X6=X13)|~(rpoint(X13))))|X8=X9),inference(fof_nnf,[status(thm)],[4])).
% fof(174, plain,![X14]:![X15]:![X16]:![X17]:(((((((((~(ron(X15,X17))|~(ron(X15,X16)))|~(ron(X14,X17)))|~(ron(X14,X16)))|![X18]:(~(X17=X18)|~(rline(X18))))|![X19]:(~(X16=X19)|~(rline(X19))))|X14=X15)|![X20]:(~(X15=X20)|~(rpoint(X20))))|![X21]:(~(X14=X21)|~(rpoint(X21))))|X16=X17),inference(variable_rename,[status(thm)],[173])).
% fof(175, plain,![X14]:![X15]:![X16]:![X17]:![X18]:![X19]:![X20]:![X21]:(((~(X14=X21)|~(rpoint(X21)))|((~(X15=X20)|~(rpoint(X20)))|(((~(X16=X19)|~(rline(X19)))|((~(X17=X18)|~(rline(X18)))|(((~(ron(X15,X17))|~(ron(X15,X16)))|~(ron(X14,X17)))|~(ron(X14,X16)))))|X14=X15)))|X16=X17),inference(shift_quantors,[status(thm)],[174])).
% cnf(176,plain,(X1=X2|X3=X4|~ron(X3,X1)|~ron(X3,X2)|~ron(X4,X1)|~ron(X4,X2)|~rline(X5)|X2!=X5|~rline(X6)|X1!=X6|~rpoint(X7)|X4!=X7|~rpoint(X8)|X3!=X8),inference(split_conjunct,[status(thm)],[175])).
% cnf(207,plain,(rpoint(vd1409)),inference(split_conjunct,[status(thm)],[9])).
% fof(494, plain,(((((((((vd1406=vd1407&ron(vd1400,vd1406))&ron(vd1399,vd1406))&rline(vd1407))&~(vd1400=vd1401))&~(vd1399=vd1401))&~(vd1399=vd1400))&?[X380]:(vd1401=X380&rpoint(X380)))&?[X381]:(vd1400=X381&rpoint(X381)))&?[X382]:(vd1399=X382&rpoint(X382))),inference(variable_rename,[status(thm)],[62])).
% fof(495, plain,(((((((((vd1406=vd1407&ron(vd1400,vd1406))&ron(vd1399,vd1406))&rline(vd1407))&~(vd1400=vd1401))&~(vd1399=vd1401))&~(vd1399=vd1400))&(vd1401=esk29_0&rpoint(esk29_0)))&(vd1400=esk30_0&rpoint(esk30_0)))&(vd1399=esk31_0&rpoint(esk31_0))),inference(skolemize,[status(esa)],[494])).
% cnf(500,plain,(rpoint(esk29_0)),inference(split_conjunct,[status(thm)],[495])).
% cnf(501,plain,(vd1401=esk29_0),inference(split_conjunct,[status(thm)],[495])).
% fof(860, negated_conjecture,?[X192]:(((ron(vd1409,X192)&ron(vd1401,X192))&rline(X192))&~(X192=vd1419)),inference(fof_nnf,[status(thm)],[129])).
% fof(861, negated_conjecture,?[X193]:(((ron(vd1409,X193)&ron(vd1401,X193))&rline(X193))&~(X193=vd1419)),inference(variable_rename,[status(thm)],[860])).
% fof(862, negated_conjecture,(((ron(vd1409,esk55_0)&ron(vd1401,esk55_0))&rline(esk55_0))&~(esk55_0=vd1419)),inference(skolemize,[status(esa)],[861])).
% cnf(863,negated_conjecture,(esk55_0!=vd1419),inference(split_conjunct,[status(thm)],[862])).
% cnf(864,negated_conjecture,(rline(esk55_0)),inference(split_conjunct,[status(thm)],[862])).
% cnf(865,negated_conjecture,(ron(vd1401,esk55_0)),inference(split_conjunct,[status(thm)],[862])).
% cnf(866,negated_conjecture,(ron(vd1409,esk55_0)),inference(split_conjunct,[status(thm)],[862])).
% cnf(868,plain,(rpoint(vd1401)),inference(rw,[status(thm)],[500,501,theory(equality)])).
% cnf(1153,plain,(X1=X2|X3=X4|X3!=X5|X2!=X6|X1!=X7|~rpoint(X5)|~rpoint(X4)|~rline(X7)|~rline(X6)|~ron(X4,X2)|~ron(X4,X1)|~ron(X3,X2)|~ron(X3,X1)),inference(er,[status(thm)],[176,theory(equality)])).
% cnf(1154,plain,(X1=X2|X3=X4|X2!=X5|X1!=X6|~rpoint(X3)|~rpoint(X4)|~rline(X6)|~rline(X5)|~ron(X4,X2)|~ron(X4,X1)|~ron(X3,X2)|~ron(X3,X1)),inference(er,[status(thm)],[1153,theory(equality)])).
% cnf(1155,plain,(X1=X2|X3=X4|X1!=X5|~rpoint(X3)|~rpoint(X4)|~rline(X5)|~rline(X2)|~ron(X4,X2)|~ron(X4,X1)|~ron(X3,X2)|~ron(X3,X1)),inference(er,[status(thm)],[1154,theory(equality)])).
% cnf(1156,plain,(X1=X2|X3=X4|~rpoint(X3)|~rpoint(X4)|~rline(X1)|~rline(X2)|~ron(X4,X2)|~ron(X4,X1)|~ron(X3,X2)|~ron(X3,X1)),inference(er,[status(thm)],[1155,theory(equality)])).
% cnf(3732,negated_conjecture,(X1=vd1401|X2=esk55_0|~rpoint(X1)|~rpoint(vd1401)|~rline(X2)|~rline(esk55_0)|~ron(vd1401,X2)|~ron(X1,esk55_0)|~ron(X1,X2)),inference(spm,[status(thm)],[1156,865,theory(equality)])).
% cnf(3805,negated_conjecture,(X1=vd1401|X2=esk55_0|~rpoint(X1)|$false|~rline(X2)|~rline(esk55_0)|~ron(vd1401,X2)|~ron(X1,esk55_0)|~ron(X1,X2)),inference(rw,[status(thm)],[3732,868,theory(equality)])).
% cnf(3806,negated_conjecture,(X1=vd1401|X2=esk55_0|~rpoint(X1)|$false|~rline(X2)|$false|~ron(vd1401,X2)|~ron(X1,esk55_0)|~ron(X1,X2)),inference(rw,[status(thm)],[3805,864,theory(equality)])).
% cnf(3807,negated_conjecture,(X1=vd1401|X2=esk55_0|~rpoint(X1)|~rline(X2)|~ron(vd1401,X2)|~ron(X1,esk55_0)|~ron(X1,X2)),inference(cn,[status(thm)],[3806,theory(equality)])).
% cnf(3834,negated_conjecture,(vd1419=esk55_0|X1=vd1401|~rpoint(X1)|~rline(vd1419)|~ron(X1,esk55_0)|~ron(X1,vd1419)),inference(spm,[status(thm)],[3807,162,theory(equality)])).
% cnf(3843,negated_conjecture,(vd1419=esk55_0|X1=vd1401|~rpoint(X1)|$false|~ron(X1,esk55_0)|~ron(X1,vd1419)),inference(rw,[status(thm)],[3834,161,theory(equality)])).
% cnf(3844,negated_conjecture,(vd1419=esk55_0|X1=vd1401|~rpoint(X1)|~ron(X1,esk55_0)|~ron(X1,vd1419)),inference(cn,[status(thm)],[3843,theory(equality)])).
% cnf(3845,negated_conjecture,(X1=vd1401|~rpoint(X1)|~ron(X1,esk55_0)|~ron(X1,vd1419)),inference(sr,[status(thm)],[3844,863,theory(equality)])).
% cnf(3852,negated_conjecture,(vd1409=vd1401|~rpoint(vd1409)|~ron(vd1409,vd1419)),inference(spm,[status(thm)],[3845,866,theory(equality)])).
% cnf(3863,negated_conjecture,(vd1409=vd1401|$false|~ron(vd1409,vd1419)),inference(rw,[status(thm)],[3852,207,theory(equality)])).
% cnf(3864,negated_conjecture,(vd1409=vd1401|$false|$false),inference(rw,[status(thm)],[3863,163,theory(equality)])).
% cnf(3865,negated_conjecture,(vd1409=vd1401),inference(cn,[status(thm)],[3864,theory(equality)])).
% cnf(3866,negated_conjecture,($false),inference(sr,[status(thm)],[3865,164,theory(equality)])).
% cnf(3867,negated_conjecture,($false),3866,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 783
% # ...of these trivial : 6
% # ...subsumed : 120
% # ...remaining for further processing: 657
% # Other redundant clauses eliminated : 1197
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 11
% # Generated clauses : 961
% # ...of the previous two non-trivial : 920
% # Contextual simplify-reflections : 19
% # Paramodulations : 684
% # Factorizations : 2
% # Equation resolutions : 1217
% # Current number of processed clauses: 382
% # Positive orientable unit clauses: 81
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 21
% # Non-unit-clauses : 280
% # Current number of unprocessed clauses: 370
% # ...number of literals in the above : 2986
% # Clause-clause subsumption calls (NU) : 3272
% # Rec. Clause-clause subsumption calls : 1252
% # Unit Clause-clause subsumption calls : 93
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 58
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 286 leaves, 1.78+/-1.535 terms/leaf
% # Paramod-from index: 102 leaves, 1.37+/-0.989 terms/leaf
% # Paramod-into index: 198 leaves, 1.49+/-1.122 terms/leaf
% # -------------------------------------------------
% # User time : 0.246 s
% # System time : 0.014 s
% # Total time : 0.260 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.48 CPU 0.56 WC
% FINAL PrfWatch: 0.48 CPU 0.56 WC
% SZS output end Solution for /tmp/SystemOnTPTP18050/GEO344+1.tptp
%
%------------------------------------------------------------------------------