TSTP Solution File: GEO305+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO305+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:31:49 EST 2010
% Result : Theorem 1.90s
% Output : Solution 1.90s
% 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/SystemOnTPTP15122/GEO305+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15122/GEO305+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15122/GEO305+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 15218
% 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,rline(vd1297),file('/tmp/SRASS.s.p', 'pred(347, 0)')).
% fof(2, axiom,ron(vd1289,vd1297),file('/tmp/SRASS.s.p', 'pred(s2(plural(347)), 0)')).
% fof(3, axiom,ron(vd1287,vd1297),file('/tmp/SRASS.s.p', 'pred(s1(plural(347)), 0)')).
% fof(22, axiom,![X112]:![X113]:![X114]:![X115]:![X116]:((((((((X115=X116&ron(X113,X115))&ron(X112,X115))&rR(X113,X112,X114))&rline(X116))&?[X117]:(X114=X117&rpoint(X117)))&?[X118]:(X113=X118&rpoint(X118)))&?[X119]:(X112=X119&rpoint(X119)))=>ron(X114,X115)),file('/tmp/SRASS.s.p', 'qu(cond(axiom(83), 0), imp(cond(axiom(83), 0)))')).
% fof(100, axiom,(((vd1302=vd1303&rR(vd1289,vd1287,vd1302))&rpoint(vd1303))&rR(vd1288,vd1287,vd1299)),file('/tmp/SRASS.s.p', 'and(pred(conjunct2(348), 4), and(holds(conjunct2(348), 1304, 0), and(pred(conjunct2(348), 1), holds(conjunct1(348), 1301, 0))))')).
% fof(113, axiom,((((((vf(vd1287,vd1288)=vf(vd1287,vd1289)&~(vd1288=vd1289))&~(vd1287=vd1289))&~(vd1287=vd1288))&?[X723]:(vd1289=X723&rpoint(X723)))&?[X724]:(vd1288=X724&rpoint(X724)))&?[X725]:(vd1287=X725&rpoint(X725))),file('/tmp/SRASS.s.p', 'and(holds(conjunct2(345), 1294, 0), and(pred(conjunct1(345), 9), and(pred(conjunct1(345), 8), and(pred(conjunct1(345), 7), and(qe(s3(plural(345))), and(qe(s2(plural(345))), qe(s1(plural(345)))))))))')).
% fof(125, conjecture,ron(vd1302,vd1297),file('/tmp/SRASS.s.p', 'pred(conjunct2(349), 0)')).
% fof(126, negated_conjecture,~(ron(vd1302,vd1297)),inference(assume_negation,[status(cth)],[125])).
% fof(158, negated_conjecture,~(ron(vd1302,vd1297)),inference(fof_simplification,[status(thm)],[126,theory(equality)])).
% cnf(159,plain,(rline(vd1297)),inference(split_conjunct,[status(thm)],[1])).
% cnf(160,plain,(ron(vd1289,vd1297)),inference(split_conjunct,[status(thm)],[2])).
% cnf(161,plain,(ron(vd1287,vd1297)),inference(split_conjunct,[status(thm)],[3])).
% fof(275, plain,![X112]:![X113]:![X114]:![X115]:![X116]:((((((((~(X115=X116)|~(ron(X113,X115)))|~(ron(X112,X115)))|~(rR(X113,X112,X114)))|~(rline(X116)))|![X117]:(~(X114=X117)|~(rpoint(X117))))|![X118]:(~(X113=X118)|~(rpoint(X118))))|![X119]:(~(X112=X119)|~(rpoint(X119))))|ron(X114,X115)),inference(fof_nnf,[status(thm)],[22])).
% fof(276, plain,![X120]:![X121]:![X122]:![X123]:![X124]:((((((((~(X123=X124)|~(ron(X121,X123)))|~(ron(X120,X123)))|~(rR(X121,X120,X122)))|~(rline(X124)))|![X125]:(~(X122=X125)|~(rpoint(X125))))|![X126]:(~(X121=X126)|~(rpoint(X126))))|![X127]:(~(X120=X127)|~(rpoint(X127))))|ron(X122,X123)),inference(variable_rename,[status(thm)],[275])).
% fof(277, plain,![X120]:![X121]:![X122]:![X123]:![X124]:![X125]:![X126]:![X127]:(((~(X120=X127)|~(rpoint(X127)))|((~(X121=X126)|~(rpoint(X126)))|((~(X122=X125)|~(rpoint(X125)))|((((~(X123=X124)|~(ron(X121,X123)))|~(ron(X120,X123)))|~(rR(X121,X120,X122)))|~(rline(X124))))))|ron(X122,X123)),inference(shift_quantors,[status(thm)],[276])).
% cnf(278,plain,(ron(X1,X2)|~rline(X3)|~rR(X4,X5,X1)|~ron(X5,X2)|~ron(X4,X2)|X2!=X3|~rpoint(X6)|X1!=X6|~rpoint(X7)|X4!=X7|~rpoint(X8)|X5!=X8),inference(split_conjunct,[status(thm)],[277])).
% cnf(709,plain,(rpoint(vd1303)),inference(split_conjunct,[status(thm)],[100])).
% cnf(710,plain,(rR(vd1289,vd1287,vd1302)),inference(split_conjunct,[status(thm)],[100])).
% cnf(711,plain,(vd1302=vd1303),inference(split_conjunct,[status(thm)],[100])).
% fof(785, plain,((((((vf(vd1287,vd1288)=vf(vd1287,vd1289)&~(vd1288=vd1289))&~(vd1287=vd1289))&~(vd1287=vd1288))&?[X726]:(vd1289=X726&rpoint(X726)))&?[X727]:(vd1288=X727&rpoint(X727)))&?[X728]:(vd1287=X728&rpoint(X728))),inference(variable_rename,[status(thm)],[113])).
% fof(786, plain,((((((vf(vd1287,vd1288)=vf(vd1287,vd1289)&~(vd1288=vd1289))&~(vd1287=vd1289))&~(vd1287=vd1288))&(vd1289=esk49_0&rpoint(esk49_0)))&(vd1288=esk50_0&rpoint(esk50_0)))&(vd1287=esk51_0&rpoint(esk51_0))),inference(skolemize,[status(esa)],[785])).
% cnf(787,plain,(rpoint(esk51_0)),inference(split_conjunct,[status(thm)],[786])).
% cnf(788,plain,(vd1287=esk51_0),inference(split_conjunct,[status(thm)],[786])).
% cnf(791,plain,(rpoint(esk49_0)),inference(split_conjunct,[status(thm)],[786])).
% cnf(792,plain,(vd1289=esk49_0),inference(split_conjunct,[status(thm)],[786])).
% cnf(840,negated_conjecture,(~ron(vd1302,vd1297)),inference(split_conjunct,[status(thm)],[158])).
% cnf(842,plain,(rpoint(vd1302)),inference(rw,[status(thm)],[709,711,theory(equality)])).
% cnf(843,plain,(rpoint(vd1289)),inference(rw,[status(thm)],[791,792,theory(equality)])).
% cnf(845,plain,(rpoint(vd1287)),inference(rw,[status(thm)],[787,788,theory(equality)])).
% cnf(1118,plain,(ron(X1,X2)|X3!=X4|X2!=X5|X1!=X6|~rR(X3,X7,X1)|~rpoint(X7)|~rpoint(X4)|~rpoint(X6)|~ron(X7,X2)|~ron(X3,X2)|~rline(X5)),inference(er,[status(thm)],[278,theory(equality)])).
% cnf(1119,plain,(ron(X1,X2)|X2!=X3|X1!=X4|~rR(X5,X6,X1)|~rpoint(X6)|~rpoint(X5)|~rpoint(X4)|~ron(X6,X2)|~ron(X5,X2)|~rline(X3)),inference(er,[status(thm)],[1118,theory(equality)])).
% cnf(1120,plain,(ron(X1,X2)|X1!=X3|~rR(X4,X5,X1)|~rpoint(X5)|~rpoint(X4)|~rpoint(X3)|~ron(X5,X2)|~ron(X4,X2)|~rline(X2)),inference(er,[status(thm)],[1119,theory(equality)])).
% cnf(1121,plain,(ron(X1,X2)|~rR(X3,X4,X1)|~rpoint(X4)|~rpoint(X3)|~rpoint(X1)|~ron(X4,X2)|~ron(X3,X2)|~rline(X2)),inference(er,[status(thm)],[1120,theory(equality)])).
% cnf(3167,plain,(ron(vd1302,X1)|~rpoint(vd1287)|~rpoint(vd1289)|~rpoint(vd1302)|~ron(vd1287,X1)|~ron(vd1289,X1)|~rline(X1)),inference(spm,[status(thm)],[1121,710,theory(equality)])).
% cnf(3180,plain,(ron(vd1302,X1)|$false|~rpoint(vd1289)|~rpoint(vd1302)|~ron(vd1287,X1)|~ron(vd1289,X1)|~rline(X1)),inference(rw,[status(thm)],[3167,845,theory(equality)])).
% cnf(3181,plain,(ron(vd1302,X1)|$false|$false|~rpoint(vd1302)|~ron(vd1287,X1)|~ron(vd1289,X1)|~rline(X1)),inference(rw,[status(thm)],[3180,843,theory(equality)])).
% cnf(3182,plain,(ron(vd1302,X1)|$false|$false|$false|~ron(vd1287,X1)|~ron(vd1289,X1)|~rline(X1)),inference(rw,[status(thm)],[3181,842,theory(equality)])).
% cnf(3183,plain,(ron(vd1302,X1)|~ron(vd1287,X1)|~ron(vd1289,X1)|~rline(X1)),inference(cn,[status(thm)],[3182,theory(equality)])).
% cnf(3188,plain,(ron(vd1302,vd1297)|~ron(vd1289,vd1297)|~rline(vd1297)),inference(spm,[status(thm)],[3183,161,theory(equality)])).
% cnf(3197,plain,(ron(vd1302,vd1297)|$false|~rline(vd1297)),inference(rw,[status(thm)],[3188,160,theory(equality)])).
% cnf(3198,plain,(ron(vd1302,vd1297)|$false|$false),inference(rw,[status(thm)],[3197,159,theory(equality)])).
% cnf(3199,plain,(ron(vd1302,vd1297)),inference(cn,[status(thm)],[3198,theory(equality)])).
% cnf(3200,plain,($false),inference(sr,[status(thm)],[3199,840,theory(equality)])).
% cnf(3201,plain,($false),3200,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 683
% # ...of these trivial : 0
% # ...subsumed : 136
% # ...remaining for further processing: 547
% # Other redundant clauses eliminated : 1184
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 0
% # Generated clauses : 798
% # ...of the previous two non-trivial : 763
% # Contextual simplify-reflections : 30
% # Paramodulations : 526
% # Factorizations : 2
% # Equation resolutions : 1202
% # Current number of processed clauses: 289
% # Positive orientable unit clauses: 53
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 224
% # Current number of unprocessed clauses: 335
% # ...number of literals in the above : 2835
% # Clause-clause subsumption calls (NU) : 2732
% # Rec. Clause-clause subsumption calls : 911
% # Unit Clause-clause subsumption calls : 38
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 44
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 225 leaves, 1.69+/-1.509 terms/leaf
% # Paramod-from index: 83 leaves, 1.34+/-1.175 terms/leaf
% # Paramod-into index: 161 leaves, 1.49+/-1.276 terms/leaf
% # -------------------------------------------------
% # User time : 0.226 s
% # System time : 0.013 s
% # Total time : 0.239 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.44 CPU 0.53 WC
% FINAL PrfWatch: 0.44 CPU 0.53 WC
% SZS output end Solution for /tmp/SystemOnTPTP15122/GEO305+1.tptp
%
%------------------------------------------------------------------------------