TSTP Solution File: GEO274+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO274+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 05:31:55 EST 2010
% Result : Theorem 2.12s
% Output : Solution 2.12s
% 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/SystemOnTPTP23006/GEO274+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23006/GEO274+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23006/GEO274+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 23139
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.01 CPU 0.02 WC
% # Preprocessing time : 0.073 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,((ron(vd1089,vd1092)&ron(vd1080,vd1092))&rline(vd1092)),file('/tmp/SRASS.s.p', 'and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))')).
% fof(3, 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(8, axiom,rpoint(vd1089),file('/tmp/SRASS.s.p', 'pred(226, 0)')).
% fof(9, axiom,?[X38]:(vd1080=X38&rpoint(X38)),file('/tmp/SRASS.s.p', 'qe(s1(plural(224)))')).
% fof(28, axiom,vf(vd1089,vd1080)=vf(vd1085,vd1080),file('/tmp/SRASS.s.p', 'holds(226, 1090, 1)')).
% fof(30, axiom,~(vd1085=vd1080),file('/tmp/SRASS.s.p', 'holds(conjunct1(225), 1087, 0)')).
% fof(42, axiom,![X253]:![X254]:((?[X255]:(X254=X255&rpoint(X255))&?[X256]:(X253=X256&rpoint(X256)))=>vf(X253,X254)=vf(X254,X253)),file('/tmp/SRASS.s.p', 'qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))')).
% fof(67, axiom,rpoint(vd1086),file('/tmp/SRASS.s.p', 'pred(225, 1)')).
% fof(77, axiom,vd1085=vd1086,file('/tmp/SRASS.s.p', 'pred(225, 4)')).
% fof(81, axiom,![X506]:![X507]:((?[X508]:(X507=X508&rpoint(X508))&?[X509]:(X506=X509&rpoint(X509)))=>(vf(X506,X507)=v0<=>X506=X507)),file('/tmp/SRASS.s.p', 'qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))')).
% fof(117, conjecture,![X733]:(((ron(vd1089,X733)&ron(vd1080,X733))&rline(X733))=>X733=vd1092),file('/tmp/SRASS.s.p', 'qu(theu(the(227), 1), imp(the(227)))')).
% fof(118, negated_conjecture,~(![X733]:(((ron(vd1089,X733)&ron(vd1080,X733))&rline(X733))=>X733=vd1092)),inference(assume_negation,[status(cth)],[117])).
% cnf(150,plain,(rline(vd1092)),inference(split_conjunct,[status(thm)],[1])).
% cnf(151,plain,(ron(vd1080,vd1092)),inference(split_conjunct,[status(thm)],[1])).
% cnf(152,plain,(ron(vd1089,vd1092)),inference(split_conjunct,[status(thm)],[1])).
% fof(161, 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)],[3])).
% fof(162, 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)],[161])).
% fof(163, 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)],[162])).
% cnf(164,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)],[163])).
% cnf(195,plain,(rpoint(vd1089)),inference(split_conjunct,[status(thm)],[8])).
% fof(196, plain,?[X39]:(vd1080=X39&rpoint(X39)),inference(variable_rename,[status(thm)],[9])).
% fof(197, plain,(vd1080=esk6_0&rpoint(esk6_0)),inference(skolemize,[status(esa)],[196])).
% cnf(198,plain,(rpoint(esk6_0)),inference(split_conjunct,[status(thm)],[197])).
% cnf(199,plain,(vd1080=esk6_0),inference(split_conjunct,[status(thm)],[197])).
% cnf(304,plain,(vf(vd1089,vd1080)=vf(vd1085,vd1080)),inference(split_conjunct,[status(thm)],[28])).
% cnf(306,plain,(vd1085!=vd1080),inference(split_conjunct,[status(thm)],[30])).
% fof(372, plain,![X253]:![X254]:((![X255]:(~(X254=X255)|~(rpoint(X255)))|![X256]:(~(X253=X256)|~(rpoint(X256))))|vf(X253,X254)=vf(X254,X253)),inference(fof_nnf,[status(thm)],[42])).
% fof(373, plain,![X257]:![X258]:((![X259]:(~(X258=X259)|~(rpoint(X259)))|![X260]:(~(X257=X260)|~(rpoint(X260))))|vf(X257,X258)=vf(X258,X257)),inference(variable_rename,[status(thm)],[372])).
% fof(374, plain,![X257]:![X258]:![X259]:![X260]:(((~(X257=X260)|~(rpoint(X260)))|(~(X258=X259)|~(rpoint(X259))))|vf(X257,X258)=vf(X258,X257)),inference(shift_quantors,[status(thm)],[373])).
% cnf(375,plain,(vf(X1,X2)=vf(X2,X1)|~rpoint(X3)|X2!=X3|~rpoint(X4)|X1!=X4),inference(split_conjunct,[status(thm)],[374])).
% cnf(509,plain,(rpoint(vd1086)),inference(split_conjunct,[status(thm)],[67])).
% cnf(566,plain,(vd1085=vd1086),inference(split_conjunct,[status(thm)],[77])).
% fof(577, plain,![X506]:![X507]:((![X508]:(~(X507=X508)|~(rpoint(X508)))|![X509]:(~(X506=X509)|~(rpoint(X509))))|((~(vf(X506,X507)=v0)|X506=X507)&(~(X506=X507)|vf(X506,X507)=v0))),inference(fof_nnf,[status(thm)],[81])).
% fof(578, plain,![X510]:![X511]:((![X512]:(~(X511=X512)|~(rpoint(X512)))|![X513]:(~(X510=X513)|~(rpoint(X513))))|((~(vf(X510,X511)=v0)|X510=X511)&(~(X510=X511)|vf(X510,X511)=v0))),inference(variable_rename,[status(thm)],[577])).
% fof(579, plain,![X510]:![X511]:![X512]:![X513]:(((~(X510=X513)|~(rpoint(X513)))|(~(X511=X512)|~(rpoint(X512))))|((~(vf(X510,X511)=v0)|X510=X511)&(~(X510=X511)|vf(X510,X511)=v0))),inference(shift_quantors,[status(thm)],[578])).
% fof(580, plain,![X510]:![X511]:![X512]:![X513]:(((~(vf(X510,X511)=v0)|X510=X511)|((~(X510=X513)|~(rpoint(X513)))|(~(X511=X512)|~(rpoint(X512)))))&((~(X510=X511)|vf(X510,X511)=v0)|((~(X510=X513)|~(rpoint(X513)))|(~(X511=X512)|~(rpoint(X512)))))),inference(distribute,[status(thm)],[579])).
% cnf(581,plain,(vf(X4,X2)=v0|~rpoint(X1)|X2!=X1|~rpoint(X3)|X4!=X3|X4!=X2),inference(split_conjunct,[status(thm)],[580])).
% cnf(582,plain,(X4=X2|~rpoint(X1)|X2!=X1|~rpoint(X3)|X4!=X3|vf(X4,X2)!=v0),inference(split_conjunct,[status(thm)],[580])).
% fof(781, negated_conjecture,?[X733]:(((ron(vd1089,X733)&ron(vd1080,X733))&rline(X733))&~(X733=vd1092)),inference(fof_nnf,[status(thm)],[118])).
% fof(782, negated_conjecture,?[X734]:(((ron(vd1089,X734)&ron(vd1080,X734))&rline(X734))&~(X734=vd1092)),inference(variable_rename,[status(thm)],[781])).
% fof(783, negated_conjecture,(((ron(vd1089,esk51_0)&ron(vd1080,esk51_0))&rline(esk51_0))&~(esk51_0=vd1092)),inference(skolemize,[status(esa)],[782])).
% cnf(784,negated_conjecture,(esk51_0!=vd1092),inference(split_conjunct,[status(thm)],[783])).
% cnf(785,negated_conjecture,(rline(esk51_0)),inference(split_conjunct,[status(thm)],[783])).
% cnf(786,negated_conjecture,(ron(vd1080,esk51_0)),inference(split_conjunct,[status(thm)],[783])).
% cnf(787,negated_conjecture,(ron(vd1089,esk51_0)),inference(split_conjunct,[status(thm)],[783])).
% cnf(788,plain,(rpoint(vd1085)),inference(rw,[status(thm)],[509,566,theory(equality)])).
% cnf(789,plain,(rpoint(vd1080)),inference(rw,[status(thm)],[198,199,theory(equality)])).
% cnf(808,plain,(vf(X1,X2)=v0|X2!=X1|X3!=X2|~rpoint(X1)|~rpoint(X3)),inference(er,[status(thm)],[581,theory(equality)])).
% cnf(809,plain,(vf(X1,X1)=v0|X2!=X1|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[808,theory(equality)])).
% cnf(810,plain,(vf(X1,X1)=v0|~rpoint(X1)),inference(er,[status(thm)],[809,theory(equality)])).
% cnf(822,plain,(X1=X2|vf(X2,X1)!=v0|X3!=X1|~rpoint(X2)|~rpoint(X3)),inference(er,[status(thm)],[582,theory(equality)])).
% cnf(823,plain,(X1=X2|vf(X2,X1)!=v0|~rpoint(X2)|~rpoint(X1)),inference(er,[status(thm)],[822,theory(equality)])).
% cnf(830,plain,(vf(X1,X2)=vf(X2,X1)|X1!=X3|~rpoint(X3)|~rpoint(X2)),inference(er,[status(thm)],[375,theory(equality)])).
% cnf(831,plain,(vf(X1,X2)=vf(X2,X1)|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[830,theory(equality)])).
% cnf(1070,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)],[164,theory(equality)])).
% cnf(1071,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)],[1070,theory(equality)])).
% cnf(1072,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)],[1071,theory(equality)])).
% cnf(1073,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)],[1072,theory(equality)])).
% cnf(1895,plain,(vd1080=vd1085|vf(vd1089,vd1080)!=v0|~rpoint(vd1085)|~rpoint(vd1080)),inference(spm,[status(thm)],[823,304,theory(equality)])).
% cnf(1897,plain,(vd1080=vd1085|vf(vd1089,vd1080)!=v0|$false|~rpoint(vd1080)),inference(rw,[status(thm)],[1895,788,theory(equality)])).
% cnf(1898,plain,(vd1080=vd1085|vf(vd1089,vd1080)!=v0|$false|$false),inference(rw,[status(thm)],[1897,789,theory(equality)])).
% cnf(1899,plain,(vd1080=vd1085|vf(vd1089,vd1080)!=v0),inference(cn,[status(thm)],[1898,theory(equality)])).
% cnf(1900,plain,(vf(vd1089,vd1080)!=v0),inference(sr,[status(thm)],[1899,306,theory(equality)])).
% cnf(1935,plain,(vf(vd1080,vd1089)!=v0|~rpoint(vd1080)|~rpoint(vd1089)),inference(spm,[status(thm)],[1900,831,theory(equality)])).
% cnf(1953,plain,(vf(vd1080,vd1089)!=v0|$false|~rpoint(vd1089)),inference(rw,[status(thm)],[1935,789,theory(equality)])).
% cnf(1954,plain,(vf(vd1080,vd1089)!=v0|$false|$false),inference(rw,[status(thm)],[1953,195,theory(equality)])).
% cnf(1955,plain,(vf(vd1080,vd1089)!=v0),inference(cn,[status(thm)],[1954,theory(equality)])).
% cnf(3332,negated_conjecture,(X1=vd1080|X2=esk51_0|~rpoint(X1)|~rpoint(vd1080)|~rline(X2)|~rline(esk51_0)|~ron(vd1080,X2)|~ron(X1,esk51_0)|~ron(X1,X2)),inference(spm,[status(thm)],[1073,786,theory(equality)])).
% cnf(3375,negated_conjecture,(X1=vd1080|X2=esk51_0|~rpoint(X1)|$false|~rline(X2)|~rline(esk51_0)|~ron(vd1080,X2)|~ron(X1,esk51_0)|~ron(X1,X2)),inference(rw,[status(thm)],[3332,789,theory(equality)])).
% cnf(3376,negated_conjecture,(X1=vd1080|X2=esk51_0|~rpoint(X1)|$false|~rline(X2)|$false|~ron(vd1080,X2)|~ron(X1,esk51_0)|~ron(X1,X2)),inference(rw,[status(thm)],[3375,785,theory(equality)])).
% cnf(3377,negated_conjecture,(X1=vd1080|X2=esk51_0|~rpoint(X1)|~rline(X2)|~ron(vd1080,X2)|~ron(X1,esk51_0)|~ron(X1,X2)),inference(cn,[status(thm)],[3376,theory(equality)])).
% cnf(5145,negated_conjecture,(vd1092=esk51_0|X1=vd1080|~rpoint(X1)|~rline(vd1092)|~ron(X1,esk51_0)|~ron(X1,vd1092)),inference(spm,[status(thm)],[3377,151,theory(equality)])).
% cnf(5152,negated_conjecture,(vd1092=esk51_0|X1=vd1080|~rpoint(X1)|$false|~ron(X1,esk51_0)|~ron(X1,vd1092)),inference(rw,[status(thm)],[5145,150,theory(equality)])).
% cnf(5153,negated_conjecture,(vd1092=esk51_0|X1=vd1080|~rpoint(X1)|~ron(X1,esk51_0)|~ron(X1,vd1092)),inference(cn,[status(thm)],[5152,theory(equality)])).
% cnf(5154,negated_conjecture,(X1=vd1080|~rpoint(X1)|~ron(X1,esk51_0)|~ron(X1,vd1092)),inference(sr,[status(thm)],[5153,784,theory(equality)])).
% cnf(5175,negated_conjecture,(vd1089=vd1080|~rpoint(vd1089)|~ron(vd1089,vd1092)),inference(spm,[status(thm)],[5154,787,theory(equality)])).
% cnf(5206,negated_conjecture,(vd1089=vd1080|$false|~ron(vd1089,vd1092)),inference(rw,[status(thm)],[5175,195,theory(equality)])).
% cnf(5207,negated_conjecture,(vd1089=vd1080|$false|$false),inference(rw,[status(thm)],[5206,152,theory(equality)])).
% cnf(5208,negated_conjecture,(vd1089=vd1080),inference(cn,[status(thm)],[5207,theory(equality)])).
% cnf(5498,plain,(vf(vd1080,vd1080)!=v0),inference(rw,[status(thm)],[1955,5208,theory(equality)])).
% cnf(5510,plain,(~rpoint(vd1080)),inference(spm,[status(thm)],[5498,810,theory(equality)])).
% cnf(5515,plain,($false),inference(rw,[status(thm)],[5510,789,theory(equality)])).
% cnf(5516,plain,($false),inference(cn,[status(thm)],[5515,theory(equality)])).
% cnf(5517,plain,($false),5516,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 835
% # ...of these trivial : 6
% # ...subsumed : 101
% # ...remaining for further processing: 728
% # Other redundant clauses eliminated : 1094
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 26
% # Backward-rewritten : 202
% # Generated clauses : 1759
% # ...of the previous two non-trivial : 1822
% # Contextual simplify-reflections : 26
% # Paramodulations : 1502
% # Factorizations : 2
% # Equation resolutions : 1114
% # Current number of processed clauses: 265
% # Positive orientable unit clauses: 39
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 218
% # Current number of unprocessed clauses: 502
% # ...number of literals in the above : 3209
% # Clause-clause subsumption calls (NU) : 4407
% # Rec. Clause-clause subsumption calls : 1612
% # Unit Clause-clause subsumption calls : 248
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 414
% # Indexed BW rewrite successes : 22
% # Backwards rewriting index: 198 leaves, 1.90+/-1.703 terms/leaf
% # Paramod-from index: 76 leaves, 1.38+/-0.827 terms/leaf
% # Paramod-into index: 136 leaves, 1.62+/-1.255 terms/leaf
% # -------------------------------------------------
% # User time : 0.266 s
% # System time : 0.015 s
% # Total time : 0.281 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.53 CPU 0.59 WC
% FINAL PrfWatch: 0.53 CPU 0.59 WC
% SZS output end Solution for /tmp/SystemOnTPTP23006/GEO274+1.tptp
%
%------------------------------------------------------------------------------