TSTP Solution File: GEO331+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO331+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 : art04.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:36:17 EST 2010
% Result : Theorem 2.06s
% Output : Solution 2.06s
% 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/SystemOnTPTP20900/GEO331+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20900/GEO331+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20900/GEO331+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 20996
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.084 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,~(vd1353=vd1354),file('/tmp/SRASS.s.p', 'pred(383, 9)')).
% fof(2, axiom,~(vd1352=vd1354),file('/tmp/SRASS.s.p', 'pred(383, 8)')).
% fof(3, axiom,~(vd1352=vd1353),file('/tmp/SRASS.s.p', 'pred(383, 7)')).
% fof(4, axiom,?[X1]:(vd1354=X1&rpoint(X1)),file('/tmp/SRASS.s.p', 'qe(s3(plural(383)))')).
% fof(5, axiom,?[X2]:(vd1353=X2&rpoint(X2)),file('/tmp/SRASS.s.p', 'qe(s2(plural(383)))')).
% fof(6, axiom,?[X3]:(vd1352=X3&rpoint(X3)),file('/tmp/SRASS.s.p', 'qe(s1(plural(383)))')).
% fof(8, axiom,vangle(vd1352,vd1353,vd1354)=vangle(vd1352,vd1354,vd1353),file('/tmp/SRASS.s.p', 'holds(383, 1356, 0)')).
% fof(20, axiom,![X76]:![X77]:((?[X78]:(X77=X78&rpoint(X78))&?[X79]:(X76=X79&rpoint(X79)))=>?[X80]:(vf(X76,X77)=X80&rreal(X80))),file('/tmp/SRASS.s.p', 'qu(cond(axiom(160), 0), imp(cond(axiom(160), 0)))')).
% fof(34, axiom,![X125]:![X126]:![X127]:(((((((vangle(X125,X126,X127)=vangle(X125,X127,X126)&~(X126=X127))&~(X125=X127))&~(X125=X126))&?[X128]:(X127=X128&rpoint(X128)))&?[X129]:(X126=X129&rpoint(X129)))&?[X130]:(X125=X130&rpoint(X130)))=>(~(vf(X125,X126)=vf(X125,X127))=>~(rless(vf(X125,X127),vf(X125,X126))))),file('/tmp/SRASS.s.p', 'ass(cond(proof(385), 0), 2)')).
% fof(61, axiom,![X280]:![X281]:![X282]:![X283]:((((X282=X283&rreal(X283))&X280=X281)&rreal(X281))=>((rless(X280,X282)|X280=X282)|rless(X282,X280))),file('/tmp/SRASS.s.p', 'qu(cond(axiom(145), 0), imp(cond(axiom(145), 0)))')).
% fof(126, conjecture,vf(vd1352,vd1353)=vf(vd1352,vd1354),file('/tmp/SRASS.s.p', 'holds(384, 1360, 0)')).
% fof(127, negated_conjecture,~(vf(vd1352,vd1353)=vf(vd1352,vd1354)),inference(assume_negation,[status(cth)],[126])).
% fof(131, plain,![X125]:![X126]:![X127]:(((((((vangle(X125,X126,X127)=vangle(X125,X127,X126)&~(X126=X127))&~(X125=X127))&~(X125=X126))&?[X128]:(X127=X128&rpoint(X128)))&?[X129]:(X126=X129&rpoint(X129)))&?[X130]:(X125=X130&rpoint(X130)))=>(~(vf(X125,X126)=vf(X125,X127))=>~(rless(vf(X125,X127),vf(X125,X126))))),inference(fof_simplification,[status(thm)],[34,theory(equality)])).
% fof(161, negated_conjecture,~(vf(vd1352,vd1353)=vf(vd1352,vd1354)),inference(fof_simplification,[status(thm)],[127,theory(equality)])).
% cnf(162,plain,(vd1353!=vd1354),inference(split_conjunct,[status(thm)],[1])).
% cnf(163,plain,(vd1352!=vd1354),inference(split_conjunct,[status(thm)],[2])).
% cnf(164,plain,(vd1352!=vd1353),inference(split_conjunct,[status(thm)],[3])).
% fof(165, plain,?[X2]:(vd1354=X2&rpoint(X2)),inference(variable_rename,[status(thm)],[4])).
% fof(166, plain,(vd1354=esk1_0&rpoint(esk1_0)),inference(skolemize,[status(esa)],[165])).
% cnf(167,plain,(rpoint(esk1_0)),inference(split_conjunct,[status(thm)],[166])).
% cnf(168,plain,(vd1354=esk1_0),inference(split_conjunct,[status(thm)],[166])).
% fof(169, plain,?[X3]:(vd1353=X3&rpoint(X3)),inference(variable_rename,[status(thm)],[5])).
% fof(170, plain,(vd1353=esk2_0&rpoint(esk2_0)),inference(skolemize,[status(esa)],[169])).
% cnf(171,plain,(rpoint(esk2_0)),inference(split_conjunct,[status(thm)],[170])).
% cnf(172,plain,(vd1353=esk2_0),inference(split_conjunct,[status(thm)],[170])).
% fof(173, plain,?[X4]:(vd1352=X4&rpoint(X4)),inference(variable_rename,[status(thm)],[6])).
% fof(174, plain,(vd1352=esk3_0&rpoint(esk3_0)),inference(skolemize,[status(esa)],[173])).
% cnf(175,plain,(rpoint(esk3_0)),inference(split_conjunct,[status(thm)],[174])).
% cnf(176,plain,(vd1352=esk3_0),inference(split_conjunct,[status(thm)],[174])).
% cnf(181,plain,(vangle(vd1352,vd1353,vd1354)=vangle(vd1352,vd1354,vd1353)),inference(split_conjunct,[status(thm)],[8])).
% fof(248, plain,![X76]:![X77]:((![X78]:(~(X77=X78)|~(rpoint(X78)))|![X79]:(~(X76=X79)|~(rpoint(X79))))|?[X80]:(vf(X76,X77)=X80&rreal(X80))),inference(fof_nnf,[status(thm)],[20])).
% fof(249, plain,![X81]:![X82]:((![X83]:(~(X82=X83)|~(rpoint(X83)))|![X84]:(~(X81=X84)|~(rpoint(X84))))|?[X85]:(vf(X81,X82)=X85&rreal(X85))),inference(variable_rename,[status(thm)],[248])).
% fof(250, plain,![X81]:![X82]:((![X83]:(~(X82=X83)|~(rpoint(X83)))|![X84]:(~(X81=X84)|~(rpoint(X84))))|(vf(X81,X82)=esk8_2(X81,X82)&rreal(esk8_2(X81,X82)))),inference(skolemize,[status(esa)],[249])).
% fof(251, plain,![X81]:![X82]:![X83]:![X84]:(((~(X81=X84)|~(rpoint(X84)))|(~(X82=X83)|~(rpoint(X83))))|(vf(X81,X82)=esk8_2(X81,X82)&rreal(esk8_2(X81,X82)))),inference(shift_quantors,[status(thm)],[250])).
% fof(252, plain,![X81]:![X82]:![X83]:![X84]:((vf(X81,X82)=esk8_2(X81,X82)|((~(X81=X84)|~(rpoint(X84)))|(~(X82=X83)|~(rpoint(X83)))))&(rreal(esk8_2(X81,X82))|((~(X81=X84)|~(rpoint(X84)))|(~(X82=X83)|~(rpoint(X83)))))),inference(distribute,[status(thm)],[251])).
% cnf(253,plain,(rreal(esk8_2(X4,X2))|~rpoint(X1)|X2!=X1|~rpoint(X3)|X4!=X3),inference(split_conjunct,[status(thm)],[252])).
% cnf(254,plain,(vf(X4,X2)=esk8_2(X4,X2)|~rpoint(X1)|X2!=X1|~rpoint(X3)|X4!=X3),inference(split_conjunct,[status(thm)],[252])).
% fof(312, plain,![X125]:![X126]:![X127]:(((((((~(vangle(X125,X126,X127)=vangle(X125,X127,X126))|X126=X127)|X125=X127)|X125=X126)|![X128]:(~(X127=X128)|~(rpoint(X128))))|![X129]:(~(X126=X129)|~(rpoint(X129))))|![X130]:(~(X125=X130)|~(rpoint(X130))))|(vf(X125,X126)=vf(X125,X127)|~(rless(vf(X125,X127),vf(X125,X126))))),inference(fof_nnf,[status(thm)],[131])).
% fof(313, plain,![X131]:![X132]:![X133]:(((((((~(vangle(X131,X132,X133)=vangle(X131,X133,X132))|X132=X133)|X131=X133)|X131=X132)|![X134]:(~(X133=X134)|~(rpoint(X134))))|![X135]:(~(X132=X135)|~(rpoint(X135))))|![X136]:(~(X131=X136)|~(rpoint(X136))))|(vf(X131,X132)=vf(X131,X133)|~(rless(vf(X131,X133),vf(X131,X132))))),inference(variable_rename,[status(thm)],[312])).
% fof(314, plain,![X131]:![X132]:![X133]:![X134]:![X135]:![X136]:(((~(X131=X136)|~(rpoint(X136)))|((~(X132=X135)|~(rpoint(X135)))|((~(X133=X134)|~(rpoint(X134)))|(((~(vangle(X131,X132,X133)=vangle(X131,X133,X132))|X132=X133)|X131=X133)|X131=X132))))|(vf(X131,X132)=vf(X131,X133)|~(rless(vf(X131,X133),vf(X131,X132))))),inference(shift_quantors,[status(thm)],[313])).
% cnf(315,plain,(vf(X1,X3)=vf(X1,X2)|X1=X3|X1=X2|X3=X2|~rless(vf(X1,X2),vf(X1,X3))|vangle(X1,X3,X2)!=vangle(X1,X2,X3)|~rpoint(X4)|X2!=X4|~rpoint(X5)|X3!=X5|~rpoint(X6)|X1!=X6),inference(split_conjunct,[status(thm)],[314])).
% fof(454, plain,![X280]:![X281]:![X282]:![X283]:((((~(X282=X283)|~(rreal(X283)))|~(X280=X281))|~(rreal(X281)))|((rless(X280,X282)|X280=X282)|rless(X282,X280))),inference(fof_nnf,[status(thm)],[61])).
% fof(455, plain,![X284]:![X285]:![X286]:![X287]:((((~(X286=X287)|~(rreal(X287)))|~(X284=X285))|~(rreal(X285)))|((rless(X284,X286)|X284=X286)|rless(X286,X284))),inference(variable_rename,[status(thm)],[454])).
% cnf(456,plain,(rless(X1,X2)|X2=X1|rless(X2,X1)|~rreal(X3)|X2!=X3|~rreal(X4)|X1!=X4),inference(split_conjunct,[status(thm)],[455])).
% cnf(854,negated_conjecture,(vf(vd1352,vd1353)!=vf(vd1352,vd1354)),inference(split_conjunct,[status(thm)],[161])).
% cnf(855,plain,(rpoint(vd1354)),inference(rw,[status(thm)],[167,168,theory(equality)])).
% cnf(856,plain,(rpoint(vd1353)),inference(rw,[status(thm)],[171,172,theory(equality)])).
% cnf(857,plain,(rpoint(vd1352)),inference(rw,[status(thm)],[175,176,theory(equality)])).
% cnf(894,plain,(rreal(esk8_2(X1,X2))|X3!=X2|~rpoint(X1)|~rpoint(X3)),inference(er,[status(thm)],[253,theory(equality)])).
% cnf(895,plain,(rreal(esk8_2(X1,X2))|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[894,theory(equality)])).
% cnf(898,plain,(esk8_2(X1,X2)=vf(X1,X2)|X3!=X2|~rpoint(X1)|~rpoint(X3)),inference(er,[status(thm)],[254,theory(equality)])).
% cnf(899,plain,(esk8_2(X1,X2)=vf(X1,X2)|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[898,theory(equality)])).
% cnf(907,plain,(X1=X2|rless(X1,X2)|rless(X2,X1)|X1!=X3|~rreal(X3)|~rreal(X2)),inference(er,[status(thm)],[456,theory(equality)])).
% cnf(908,plain,(X1=X2|rless(X1,X2)|rless(X2,X1)|~rreal(X1)|~rreal(X2)),inference(er,[status(thm)],[907,theory(equality)])).
% cnf(1276,plain,(vf(X1,X2)=vf(X1,X3)|X1=X2|X1=X3|X2=X3|vangle(X1,X2,X3)!=vangle(X1,X3,X2)|X2!=X4|X1!=X5|~rless(vf(X1,X2),vf(X1,X3))|~rpoint(X5)|~rpoint(X3)|~rpoint(X4)),inference(er,[status(thm)],[315,theory(equality)])).
% cnf(1277,plain,(vf(X1,X2)=vf(X1,X3)|X1=X2|X1=X3|X2=X3|vangle(X1,X2,X3)!=vangle(X1,X3,X2)|X1!=X4|~rless(vf(X1,X2),vf(X1,X3))|~rpoint(X4)|~rpoint(X3)|~rpoint(X2)),inference(er,[status(thm)],[1276,theory(equality)])).
% cnf(1278,plain,(vf(X1,X2)=vf(X1,X3)|X1=X2|X1=X3|X2=X3|vangle(X1,X2,X3)!=vangle(X1,X3,X2)|~rless(vf(X1,X2),vf(X1,X3))|~rpoint(X1)|~rpoint(X3)|~rpoint(X2)),inference(er,[status(thm)],[1277,theory(equality)])).
% cnf(2076,plain,(rreal(vf(X1,X2))|~rpoint(X1)|~rpoint(X2)),inference(spm,[status(thm)],[895,899,theory(equality)])).
% cnf(4043,plain,(vf(vd1352,vd1354)=vf(vd1352,vd1353)|vd1354=vd1353|vd1352=vd1353|vd1352=vd1354|~rless(vf(vd1352,vd1354),vf(vd1352,vd1353))|~rpoint(vd1352)|~rpoint(vd1353)|~rpoint(vd1354)),inference(spm,[status(thm)],[1278,181,theory(equality)])).
% cnf(4046,plain,(vf(vd1352,vd1353)=vf(vd1352,vd1354)|vd1353=vd1354|vd1352=vd1354|vd1352=vd1353|~rless(vf(vd1352,vd1353),vf(vd1352,vd1354))|~rpoint(vd1352)|~rpoint(vd1354)|~rpoint(vd1353)),inference(spm,[status(thm)],[1278,181,theory(equality)])).
% cnf(4049,plain,(vf(vd1352,vd1354)=vf(vd1352,vd1353)|vd1354=vd1353|vd1352=vd1353|vd1352=vd1354|~rless(vf(vd1352,vd1354),vf(vd1352,vd1353))|$false|~rpoint(vd1353)|~rpoint(vd1354)),inference(rw,[status(thm)],[4043,857,theory(equality)])).
% cnf(4050,plain,(vf(vd1352,vd1354)=vf(vd1352,vd1353)|vd1354=vd1353|vd1352=vd1353|vd1352=vd1354|~rless(vf(vd1352,vd1354),vf(vd1352,vd1353))|$false|$false|~rpoint(vd1354)),inference(rw,[status(thm)],[4049,856,theory(equality)])).
% cnf(4051,plain,(vf(vd1352,vd1354)=vf(vd1352,vd1353)|vd1354=vd1353|vd1352=vd1353|vd1352=vd1354|~rless(vf(vd1352,vd1354),vf(vd1352,vd1353))|$false|$false|$false),inference(rw,[status(thm)],[4050,855,theory(equality)])).
% cnf(4052,plain,(vf(vd1352,vd1354)=vf(vd1352,vd1353)|vd1354=vd1353|vd1352=vd1353|vd1352=vd1354|~rless(vf(vd1352,vd1354),vf(vd1352,vd1353))),inference(cn,[status(thm)],[4051,theory(equality)])).
% cnf(4053,plain,(vd1353=vd1354|vd1353=vd1352|vd1354=vd1352|~rless(vf(vd1352,vd1354),vf(vd1352,vd1353))),inference(sr,[status(thm)],[4052,854,theory(equality)])).
% cnf(4054,plain,(vd1353=vd1352|vd1354=vd1352|~rless(vf(vd1352,vd1354),vf(vd1352,vd1353))),inference(sr,[status(thm)],[4053,162,theory(equality)])).
% cnf(4055,plain,(vd1354=vd1352|~rless(vf(vd1352,vd1354),vf(vd1352,vd1353))),inference(sr,[status(thm)],[4054,164,theory(equality)])).
% cnf(4056,plain,(~rless(vf(vd1352,vd1354),vf(vd1352,vd1353))),inference(sr,[status(thm)],[4055,163,theory(equality)])).
% cnf(4057,plain,(vf(vd1352,vd1353)=vf(vd1352,vd1354)|vd1353=vd1354|vd1352=vd1354|vd1352=vd1353|~rless(vf(vd1352,vd1353),vf(vd1352,vd1354))|$false|~rpoint(vd1354)|~rpoint(vd1353)),inference(rw,[status(thm)],[4046,857,theory(equality)])).
% cnf(4058,plain,(vf(vd1352,vd1353)=vf(vd1352,vd1354)|vd1353=vd1354|vd1352=vd1354|vd1352=vd1353|~rless(vf(vd1352,vd1353),vf(vd1352,vd1354))|$false|$false|~rpoint(vd1353)),inference(rw,[status(thm)],[4057,855,theory(equality)])).
% cnf(4059,plain,(vf(vd1352,vd1353)=vf(vd1352,vd1354)|vd1353=vd1354|vd1352=vd1354|vd1352=vd1353|~rless(vf(vd1352,vd1353),vf(vd1352,vd1354))|$false|$false|$false),inference(rw,[status(thm)],[4058,856,theory(equality)])).
% cnf(4060,plain,(vf(vd1352,vd1353)=vf(vd1352,vd1354)|vd1353=vd1354|vd1352=vd1354|vd1352=vd1353|~rless(vf(vd1352,vd1353),vf(vd1352,vd1354))),inference(cn,[status(thm)],[4059,theory(equality)])).
% cnf(4061,plain,(vd1353=vd1354|vd1354=vd1352|vd1353=vd1352|~rless(vf(vd1352,vd1353),vf(vd1352,vd1354))),inference(sr,[status(thm)],[4060,854,theory(equality)])).
% cnf(4062,plain,(vd1354=vd1352|vd1353=vd1352|~rless(vf(vd1352,vd1353),vf(vd1352,vd1354))),inference(sr,[status(thm)],[4061,162,theory(equality)])).
% cnf(4063,plain,(vd1353=vd1352|~rless(vf(vd1352,vd1353),vf(vd1352,vd1354))),inference(sr,[status(thm)],[4062,163,theory(equality)])).
% cnf(4064,plain,(~rless(vf(vd1352,vd1353),vf(vd1352,vd1354))),inference(sr,[status(thm)],[4063,164,theory(equality)])).
% cnf(4065,plain,(vf(vd1352,vd1354)=vf(vd1352,vd1353)|rless(vf(vd1352,vd1354),vf(vd1352,vd1353))|~rreal(vf(vd1352,vd1354))|~rreal(vf(vd1352,vd1353))),inference(spm,[status(thm)],[4064,908,theory(equality)])).
% cnf(4067,plain,(rless(vf(vd1352,vd1354),vf(vd1352,vd1353))|~rreal(vf(vd1352,vd1354))|~rreal(vf(vd1352,vd1353))),inference(sr,[status(thm)],[4065,854,theory(equality)])).
% cnf(4068,plain,(~rreal(vf(vd1352,vd1354))|~rreal(vf(vd1352,vd1353))),inference(sr,[status(thm)],[4067,4056,theory(equality)])).
% cnf(4071,plain,(~rreal(vf(vd1352,vd1353))|~rpoint(vd1352)|~rpoint(vd1354)),inference(spm,[status(thm)],[4068,2076,theory(equality)])).
% cnf(4072,plain,(~rreal(vf(vd1352,vd1353))|$false|~rpoint(vd1354)),inference(rw,[status(thm)],[4071,857,theory(equality)])).
% cnf(4073,plain,(~rreal(vf(vd1352,vd1353))|$false|$false),inference(rw,[status(thm)],[4072,855,theory(equality)])).
% cnf(4074,plain,(~rreal(vf(vd1352,vd1353))),inference(cn,[status(thm)],[4073,theory(equality)])).
% cnf(4075,plain,(~rpoint(vd1352)|~rpoint(vd1353)),inference(spm,[status(thm)],[4074,2076,theory(equality)])).
% cnf(4076,plain,($false|~rpoint(vd1353)),inference(rw,[status(thm)],[4075,857,theory(equality)])).
% cnf(4077,plain,($false|$false),inference(rw,[status(thm)],[4076,856,theory(equality)])).
% cnf(4078,plain,($false),inference(cn,[status(thm)],[4077,theory(equality)])).
% cnf(4079,plain,($false),4078,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1016
% # ...of these trivial : 0
% # ...subsumed : 446
% # ...remaining for further processing: 570
% # Other redundant clauses eliminated : 1203
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 7
% # Generated clauses : 1423
% # ...of the previous two non-trivial : 1365
% # Contextual simplify-reflections : 246
% # Paramodulations : 1142
% # Factorizations : 4
% # Equation resolutions : 1223
% # Current number of processed clauses: 299
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 276
% # Current number of unprocessed clauses: 584
% # ...number of literals in the above : 5253
% # Clause-clause subsumption calls (NU) : 8231
% # Rec. Clause-clause subsumption calls : 2305
% # Unit Clause-clause subsumption calls : 35
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 195 leaves, 1.74+/-1.886 terms/leaf
% # Paramod-from index: 91 leaves, 1.24+/-0.830 terms/leaf
% # Paramod-into index: 147 leaves, 1.64+/-1.620 terms/leaf
% # -------------------------------------------------
% # User time : 0.294 s
% # System time : 0.014 s
% # Total time : 0.308 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.57 CPU 0.65 WC
% FINAL PrfWatch: 0.57 CPU 0.65 WC
% SZS output end Solution for /tmp/SystemOnTPTP20900/GEO331+1.tptp
%
%------------------------------------------------------------------------------