TSTP Solution File: GEO300+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO300+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 : art06.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:31:14 EST 2010

% Result   : Theorem 2.17s
% Output   : Solution 2.17s
% 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/SystemOnTPTP27509/GEO300+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP27509/GEO300+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27509/GEO300+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 27605
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.080 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,vf(vd1199,vd1201)=vf(vd1185,vd1187),file('/tmp/SRASS.s.p', 'holds(314, 1247, 0)')).
% fof(3, axiom,rR(vd1187,vd1185,vd1201),file('/tmp/SRASS.s.p', 'holds(330, 1259, 0)')).
% fof(8, axiom,?[X1]:(vd1201=X1&rpoint(X1)),file('/tmp/SRASS.s.p', 'qe(s3(plural(271)))')).
% fof(10, axiom,![X6]:![X7]:![X8]:((((rR(X7,X6,X8)&?[X9]:(X8=X9&rpoint(X9)))&?[X10]:(X7=X10&rpoint(X10)))&?[X11]:(X6=X11&rpoint(X11)))=>vplus(vf(X6,X7),vf(X7,X8))=vf(X6,X8)),file('/tmp/SRASS.s.p', 'qu(cond(axiom(180), 0), imp(cond(axiom(180), 0)))')).
% fof(11, axiom,vd1199=vd1185,file('/tmp/SRASS.s.p', 'holds(291, 1230, 0)')).
% fof(51, axiom,?[X115]:(vd1199=X115&rpoint(X115)),file('/tmp/SRASS.s.p', 'qe(s1(plural(271)))')).
% fof(68, axiom,((((((((((((~(?[X205]:(((ron(vd1187,X205)&ron(vd1186,X205))&ron(vd1185,X205))&rline(X205)))&vangle(vd1179,vd1178,vd1180)=vangle(vd1186,vd1185,vd1187))&vf(vd1178,vd1180)=vf(vd1185,vd1187))&vf(vd1178,vd1179)=vf(vd1185,vd1186))&?[X206]:(vd1187=X206&rpoint(X206)))&?[X207]:(vd1186=X207&rpoint(X207)))&?[X208]:(vd1185=X208&rpoint(X208)))&~(vd1179=vd1180))&~(vd1178=vd1180))&~(vd1178=vd1179))&?[X209]:(vd1180=X209&rpoint(X209)))&?[X210]:(vd1179=X210&rpoint(X210)))&?[X211]:(vd1178=X211&rpoint(X211))),file('/tmp/SRASS.s.p', 'and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))')).
% fof(161, conjecture,vf(vd1185,vd1201)=vplus(vf(vd1185,vd1187),vf(vd1187,vd1201)),file('/tmp/SRASS.s.p', 'holds(331, 1260, 0)')).
% fof(162, negated_conjecture,~(vf(vd1185,vd1201)=vplus(vf(vd1185,vd1187),vf(vd1187,vd1201))),inference(assume_negation,[status(cth)],[161])).
% fof(204, negated_conjecture,~(vf(vd1185,vd1201)=vplus(vf(vd1185,vd1187),vf(vd1187,vd1201))),inference(fof_simplification,[status(thm)],[162,theory(equality)])).
% cnf(206,plain,(vf(vd1199,vd1201)=vf(vd1185,vd1187)),inference(split_conjunct,[status(thm)],[2])).
% cnf(207,plain,(rR(vd1187,vd1185,vd1201)),inference(split_conjunct,[status(thm)],[3])).
% fof(212, plain,?[X2]:(vd1201=X2&rpoint(X2)),inference(variable_rename,[status(thm)],[8])).
% fof(213, plain,(vd1201=esk1_0&rpoint(esk1_0)),inference(skolemize,[status(esa)],[212])).
% cnf(214,plain,(rpoint(esk1_0)),inference(split_conjunct,[status(thm)],[213])).
% cnf(215,plain,(vd1201=esk1_0),inference(split_conjunct,[status(thm)],[213])).
% fof(220, plain,![X6]:![X7]:![X8]:((((~(rR(X7,X6,X8))|![X9]:(~(X8=X9)|~(rpoint(X9))))|![X10]:(~(X7=X10)|~(rpoint(X10))))|![X11]:(~(X6=X11)|~(rpoint(X11))))|vplus(vf(X6,X7),vf(X7,X8))=vf(X6,X8)),inference(fof_nnf,[status(thm)],[10])).
% fof(221, plain,![X12]:![X13]:![X14]:((((~(rR(X13,X12,X14))|![X15]:(~(X14=X15)|~(rpoint(X15))))|![X16]:(~(X13=X16)|~(rpoint(X16))))|![X17]:(~(X12=X17)|~(rpoint(X17))))|vplus(vf(X12,X13),vf(X13,X14))=vf(X12,X14)),inference(variable_rename,[status(thm)],[220])).
% fof(222, plain,![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:(((~(X12=X17)|~(rpoint(X17)))|((~(X13=X16)|~(rpoint(X16)))|((~(X14=X15)|~(rpoint(X15)))|~(rR(X13,X12,X14)))))|vplus(vf(X12,X13),vf(X13,X14))=vf(X12,X14)),inference(shift_quantors,[status(thm)],[221])).
% cnf(223,plain,(vplus(vf(X1,X2),vf(X2,X3))=vf(X1,X3)|~rR(X2,X1,X3)|~rpoint(X4)|X3!=X4|~rpoint(X5)|X2!=X5|~rpoint(X6)|X1!=X6),inference(split_conjunct,[status(thm)],[222])).
% cnf(224,plain,(vd1199=vd1185),inference(split_conjunct,[status(thm)],[11])).
% fof(351, plain,?[X116]:(vd1199=X116&rpoint(X116)),inference(variable_rename,[status(thm)],[51])).
% fof(352, plain,(vd1199=esk9_0&rpoint(esk9_0)),inference(skolemize,[status(esa)],[351])).
% cnf(353,plain,(rpoint(esk9_0)),inference(split_conjunct,[status(thm)],[352])).
% cnf(354,plain,(vd1199=esk9_0),inference(split_conjunct,[status(thm)],[352])).
% fof(443, plain,((((((((((((![X205]:(((~(ron(vd1187,X205))|~(ron(vd1186,X205)))|~(ron(vd1185,X205)))|~(rline(X205)))&vangle(vd1179,vd1178,vd1180)=vangle(vd1186,vd1185,vd1187))&vf(vd1178,vd1180)=vf(vd1185,vd1187))&vf(vd1178,vd1179)=vf(vd1185,vd1186))&?[X206]:(vd1187=X206&rpoint(X206)))&?[X207]:(vd1186=X207&rpoint(X207)))&?[X208]:(vd1185=X208&rpoint(X208)))&~(vd1179=vd1180))&~(vd1178=vd1180))&~(vd1178=vd1179))&?[X209]:(vd1180=X209&rpoint(X209)))&?[X210]:(vd1179=X210&rpoint(X210)))&?[X211]:(vd1178=X211&rpoint(X211))),inference(fof_nnf,[status(thm)],[68])).
% fof(444, plain,((((((((((((![X212]:(((~(ron(vd1187,X212))|~(ron(vd1186,X212)))|~(ron(vd1185,X212)))|~(rline(X212)))&vangle(vd1179,vd1178,vd1180)=vangle(vd1186,vd1185,vd1187))&vf(vd1178,vd1180)=vf(vd1185,vd1187))&vf(vd1178,vd1179)=vf(vd1185,vd1186))&?[X213]:(vd1187=X213&rpoint(X213)))&?[X214]:(vd1186=X214&rpoint(X214)))&?[X215]:(vd1185=X215&rpoint(X215)))&~(vd1179=vd1180))&~(vd1178=vd1180))&~(vd1178=vd1179))&?[X216]:(vd1180=X216&rpoint(X216)))&?[X217]:(vd1179=X217&rpoint(X217)))&?[X218]:(vd1178=X218&rpoint(X218))),inference(variable_rename,[status(thm)],[443])).
% fof(445, plain,((((((((((((![X212]:(((~(ron(vd1187,X212))|~(ron(vd1186,X212)))|~(ron(vd1185,X212)))|~(rline(X212)))&vangle(vd1179,vd1178,vd1180)=vangle(vd1186,vd1185,vd1187))&vf(vd1178,vd1180)=vf(vd1185,vd1187))&vf(vd1178,vd1179)=vf(vd1185,vd1186))&(vd1187=esk18_0&rpoint(esk18_0)))&(vd1186=esk19_0&rpoint(esk19_0)))&(vd1185=esk20_0&rpoint(esk20_0)))&~(vd1179=vd1180))&~(vd1178=vd1180))&~(vd1178=vd1179))&(vd1180=esk21_0&rpoint(esk21_0)))&(vd1179=esk22_0&rpoint(esk22_0)))&(vd1178=esk23_0&rpoint(esk23_0))),inference(skolemize,[status(esa)],[444])).
% fof(446, plain,![X212]:(((((((((((((((~(ron(vd1187,X212))|~(ron(vd1186,X212)))|~(ron(vd1185,X212)))|~(rline(X212)))&vangle(vd1179,vd1178,vd1180)=vangle(vd1186,vd1185,vd1187))&vf(vd1178,vd1180)=vf(vd1185,vd1187))&vf(vd1178,vd1179)=vf(vd1185,vd1186))&(vd1187=esk18_0&rpoint(esk18_0)))&(vd1186=esk19_0&rpoint(esk19_0)))&(vd1185=esk20_0&rpoint(esk20_0)))&~(vd1179=vd1180))&~(vd1178=vd1180))&~(vd1178=vd1179))&(vd1180=esk21_0&rpoint(esk21_0)))&(vd1179=esk22_0&rpoint(esk22_0)))&(vd1178=esk23_0&rpoint(esk23_0))),inference(shift_quantors,[status(thm)],[445])).
% cnf(460,plain,(rpoint(esk18_0)),inference(split_conjunct,[status(thm)],[446])).
% cnf(461,plain,(vd1187=esk18_0),inference(split_conjunct,[status(thm)],[446])).
% cnf(922,negated_conjecture,(vf(vd1185,vd1201)!=vplus(vf(vd1185,vd1187),vf(vd1187,vd1201))),inference(split_conjunct,[status(thm)],[204])).
% cnf(923,plain,(vf(vd1185,vd1187)=vf(vd1185,vd1201)),inference(rw,[status(thm)],[206,224,theory(equality)])).
% cnf(924,negated_conjecture,(vplus(vf(vd1185,vd1201),vf(vd1187,vd1201))!=vf(vd1185,vd1201)),inference(rw,[status(thm)],[922,923,theory(equality)])).
% cnf(926,plain,(esk9_0=vd1185),inference(rw,[status(thm)],[354,224,theory(equality)])).
% cnf(929,plain,(rpoint(vd1201)),inference(rw,[status(thm)],[214,215,theory(equality)])).
% cnf(931,plain,(rpoint(vd1185)),inference(rw,[status(thm)],[353,926,theory(equality)])).
% cnf(932,plain,(rpoint(vd1187)),inference(rw,[status(thm)],[460,461,theory(equality)])).
% cnf(1215,plain,(vplus(vf(X1,X2),vf(X2,X3))=vf(X1,X3)|X2!=X4|X1!=X5|~rpoint(X5)|~rpoint(X4)|~rpoint(X3)|~rR(X2,X1,X3)),inference(er,[status(thm)],[223,theory(equality)])).
% cnf(1216,plain,(vplus(vf(X1,X2),vf(X2,X3))=vf(X1,X3)|X1!=X4|~rpoint(X4)|~rpoint(X2)|~rpoint(X3)|~rR(X2,X1,X3)),inference(er,[status(thm)],[1215,theory(equality)])).
% cnf(1217,plain,(vplus(vf(X1,X2),vf(X2,X3))=vf(X1,X3)|~rpoint(X1)|~rpoint(X2)|~rpoint(X3)|~rR(X2,X1,X3)),inference(er,[status(thm)],[1216,theory(equality)])).
% cnf(2627,plain,(vplus(vf(vd1185,vd1187),vf(vd1187,vd1201))=vf(vd1185,vd1201)|~rpoint(vd1185)|~rpoint(vd1187)|~rpoint(vd1201)),inference(spm,[status(thm)],[1217,207,theory(equality)])).
% cnf(2628,plain,(vplus(vf(vd1185,vd1201),vf(vd1187,vd1201))=vf(vd1185,vd1201)|~rpoint(vd1185)|~rpoint(vd1187)|~rpoint(vd1201)),inference(rw,[status(thm)],[2627,923,theory(equality)])).
% cnf(2629,plain,(vplus(vf(vd1185,vd1201),vf(vd1187,vd1201))=vf(vd1185,vd1201)|$false|~rpoint(vd1187)|~rpoint(vd1201)),inference(rw,[status(thm)],[2628,931,theory(equality)])).
% cnf(2630,plain,(vplus(vf(vd1185,vd1201),vf(vd1187,vd1201))=vf(vd1185,vd1201)|$false|$false|~rpoint(vd1201)),inference(rw,[status(thm)],[2629,932,theory(equality)])).
% cnf(2631,plain,(vplus(vf(vd1185,vd1201),vf(vd1187,vd1201))=vf(vd1185,vd1201)|$false|$false|$false),inference(rw,[status(thm)],[2630,929,theory(equality)])).
% cnf(2632,plain,(vplus(vf(vd1185,vd1201),vf(vd1187,vd1201))=vf(vd1185,vd1201)),inference(cn,[status(thm)],[2631,theory(equality)])).
% cnf(2633,plain,($false),inference(sr,[status(thm)],[2632,924,theory(equality)])).
% cnf(2634,plain,($false),2633,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 574
% # ...of these trivial                : 31
% # ...subsumed                        : 70
% # ...remaining for further processing: 473
% # Other redundant clauses eliminated : 1112
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 11
% # Backward-rewritten                 : 1
% # Generated clauses                  : 517
% # ...of the previous two non-trivial : 492
% # Contextual simplify-reflections    : 15
% # Paramodulations                    : 261
% # Factorizations                     : 2
% # Equation resolutions               : 1126
% # Current number of processed clauses: 221
% #    Positive orientable unit clauses: 66
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 20
% #    Non-unit-clauses                : 135
% # Current number of unprocessed clauses: 177
% # ...number of literals in the above : 1871
% # Clause-clause subsumption calls (NU) : 1720
% # Rec. Clause-clause subsumption calls : 610
% # Unit Clause-clause subsumption calls : 53
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 8
% # Indexed BW rewrite successes       : 3
% # Backwards rewriting index:   228 leaves,   1.32+/-0.805 terms/leaf
% # Paramod-from index:          104 leaves,   1.09+/-0.343 terms/leaf
% # Paramod-into index:          182 leaves,   1.23+/-0.702 terms/leaf
% # -------------------------------------------------
% # User time              : 0.200 s
% # System time            : 0.009 s
% # Total time             : 0.209 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.41 CPU 0.49 WC
% FINAL PrfWatch: 0.41 CPU 0.49 WC
% SZS output end Solution for /tmp/SystemOnTPTP27509/GEO300+1.tptp
% 
%------------------------------------------------------------------------------