TSTP Solution File: GEO342+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO342+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:42:46 EST 2010
% Result : Theorem 2.04s
% Output : Solution 2.04s
% 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/SystemOnTPTP27693/GEO342+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27693/GEO342+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27693/GEO342+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 27825
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.081 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(((~(X1=X2)&?[X3]:(X2=X3&rpoint(X3)))&?[X4]:(X1=X4&rpoint(X4)))=>?[X5]:((ron(X2,X5)&ron(X1,X5))&rline(X5))),file('/tmp/SRASS.s.p', 'qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))')).
% fof(37, axiom,(((((((((vd1406=vd1407&ron(vd1400,vd1406))&ron(vd1399,vd1406))&rline(vd1407))&~(vd1400=vd1401))&~(vd1399=vd1401))&~(vd1399=vd1400))&?[X251]:(vd1401=X251&rpoint(X251)))&?[X252]:(vd1400=X252&rpoint(X252)))&?[X253]:(vd1399=X253&rpoint(X253))),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(124, conjecture,?[X777]:((ron(vd1399,X777)&ron(vd1401,X777))&rline(X777)),file('/tmp/SRASS.s.p', 'qe(thee(the(408), 1))')).
% fof(125, negated_conjecture,~(?[X777]:((ron(vd1399,X777)&ron(vd1401,X777))&rline(X777))),inference(assume_negation,[status(cth)],[124])).
% fof(157, plain,![X1]:![X2]:(((X1=X2|![X3]:(~(X2=X3)|~(rpoint(X3))))|![X4]:(~(X1=X4)|~(rpoint(X4))))|?[X5]:((ron(X2,X5)&ron(X1,X5))&rline(X5))),inference(fof_nnf,[status(thm)],[1])).
% fof(158, plain,![X6]:![X7]:(((X6=X7|![X8]:(~(X7=X8)|~(rpoint(X8))))|![X9]:(~(X6=X9)|~(rpoint(X9))))|?[X10]:((ron(X7,X10)&ron(X6,X10))&rline(X10))),inference(variable_rename,[status(thm)],[157])).
% fof(159, plain,![X6]:![X7]:(((X6=X7|![X8]:(~(X7=X8)|~(rpoint(X8))))|![X9]:(~(X6=X9)|~(rpoint(X9))))|((ron(X7,esk1_2(X6,X7))&ron(X6,esk1_2(X6,X7)))&rline(esk1_2(X6,X7)))),inference(skolemize,[status(esa)],[158])).
% fof(160, plain,![X6]:![X7]:![X8]:![X9]:(((~(X6=X9)|~(rpoint(X9)))|((~(X7=X8)|~(rpoint(X8)))|X6=X7))|((ron(X7,esk1_2(X6,X7))&ron(X6,esk1_2(X6,X7)))&rline(esk1_2(X6,X7)))),inference(shift_quantors,[status(thm)],[159])).
% fof(161, plain,![X6]:![X7]:![X8]:![X9]:(((ron(X7,esk1_2(X6,X7))|((~(X6=X9)|~(rpoint(X9)))|((~(X7=X8)|~(rpoint(X8)))|X6=X7)))&(ron(X6,esk1_2(X6,X7))|((~(X6=X9)|~(rpoint(X9)))|((~(X7=X8)|~(rpoint(X8)))|X6=X7))))&(rline(esk1_2(X6,X7))|((~(X6=X9)|~(rpoint(X9)))|((~(X7=X8)|~(rpoint(X8)))|X6=X7)))),inference(distribute,[status(thm)],[160])).
% cnf(162,plain,(X1=X2|rline(esk1_2(X1,X2))|~rpoint(X3)|X2!=X3|~rpoint(X4)|X1!=X4),inference(split_conjunct,[status(thm)],[161])).
% cnf(163,plain,(X1=X2|ron(X1,esk1_2(X1,X2))|~rpoint(X3)|X2!=X3|~rpoint(X4)|X1!=X4),inference(split_conjunct,[status(thm)],[161])).
% cnf(164,plain,(X1=X2|ron(X2,esk1_2(X1,X2))|~rpoint(X3)|X2!=X3|~rpoint(X4)|X1!=X4),inference(split_conjunct,[status(thm)],[161])).
% fof(366, plain,(((((((((vd1406=vd1407&ron(vd1400,vd1406))&ron(vd1399,vd1406))&rline(vd1407))&~(vd1400=vd1401))&~(vd1399=vd1401))&~(vd1399=vd1400))&?[X254]:(vd1401=X254&rpoint(X254)))&?[X255]:(vd1400=X255&rpoint(X255)))&?[X256]:(vd1399=X256&rpoint(X256))),inference(variable_rename,[status(thm)],[37])).
% fof(367, plain,(((((((((vd1406=vd1407&ron(vd1400,vd1406))&ron(vd1399,vd1406))&rline(vd1407))&~(vd1400=vd1401))&~(vd1399=vd1401))&~(vd1399=vd1400))&(vd1401=esk20_0&rpoint(esk20_0)))&(vd1400=esk21_0&rpoint(esk21_0)))&(vd1399=esk22_0&rpoint(esk22_0))),inference(skolemize,[status(esa)],[366])).
% cnf(368,plain,(rpoint(esk22_0)),inference(split_conjunct,[status(thm)],[367])).
% cnf(369,plain,(vd1399=esk22_0),inference(split_conjunct,[status(thm)],[367])).
% cnf(372,plain,(rpoint(esk20_0)),inference(split_conjunct,[status(thm)],[367])).
% cnf(373,plain,(vd1401=esk20_0),inference(split_conjunct,[status(thm)],[367])).
% cnf(375,plain,(vd1399!=vd1401),inference(split_conjunct,[status(thm)],[367])).
% fof(846, negated_conjecture,![X777]:((~(ron(vd1399,X777))|~(ron(vd1401,X777)))|~(rline(X777))),inference(fof_nnf,[status(thm)],[125])).
% fof(847, negated_conjecture,![X778]:((~(ron(vd1399,X778))|~(ron(vd1401,X778)))|~(rline(X778))),inference(variable_rename,[status(thm)],[846])).
% cnf(848,negated_conjecture,(~rline(X1)|~ron(vd1401,X1)|~ron(vd1399,X1)),inference(split_conjunct,[status(thm)],[847])).
% cnf(850,plain,(rpoint(vd1401)),inference(rw,[status(thm)],[372,373,theory(equality)])).
% cnf(852,plain,(rpoint(vd1399)),inference(rw,[status(thm)],[368,369,theory(equality)])).
% cnf(895,plain,(X1=X2|rline(esk1_2(X1,X2))|X1!=X3|~rpoint(X3)|~rpoint(X2)),inference(er,[status(thm)],[162,theory(equality)])).
% cnf(896,plain,(X1=X2|rline(esk1_2(X1,X2))|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[895,theory(equality)])).
% cnf(936,plain,(X1=X2|ron(X2,esk1_2(X1,X2))|X1!=X3|~rpoint(X3)|~rpoint(X2)),inference(er,[status(thm)],[164,theory(equality)])).
% cnf(937,plain,(X1=X2|ron(X2,esk1_2(X1,X2))|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[936,theory(equality)])).
% cnf(940,plain,(X1=X2|ron(X1,esk1_2(X1,X2))|X1!=X3|~rpoint(X3)|~rpoint(X2)),inference(er,[status(thm)],[163,theory(equality)])).
% cnf(941,plain,(X1=X2|ron(X1,esk1_2(X1,X2))|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[940,theory(equality)])).
% cnf(2248,negated_conjecture,(X1=vd1399|~rline(esk1_2(X1,vd1399))|~ron(vd1401,esk1_2(X1,vd1399))|~rpoint(X1)|~rpoint(vd1399)),inference(spm,[status(thm)],[848,937,theory(equality)])).
% cnf(2249,negated_conjecture,(X1=vd1399|~rline(esk1_2(X1,vd1399))|~ron(vd1401,esk1_2(X1,vd1399))|~rpoint(X1)|$false),inference(rw,[status(thm)],[2248,852,theory(equality)])).
% cnf(2250,negated_conjecture,(X1=vd1399|~rline(esk1_2(X1,vd1399))|~ron(vd1401,esk1_2(X1,vd1399))|~rpoint(X1)),inference(cn,[status(thm)],[2249,theory(equality)])).
% cnf(2251,negated_conjecture,(X1=vd1399|~ron(vd1401,esk1_2(X1,vd1399))|~rpoint(X1)|~rpoint(vd1399)),inference(spm,[status(thm)],[2250,896,theory(equality)])).
% cnf(2252,negated_conjecture,(X1=vd1399|~ron(vd1401,esk1_2(X1,vd1399))|~rpoint(X1)|$false),inference(rw,[status(thm)],[2251,852,theory(equality)])).
% cnf(2253,negated_conjecture,(X1=vd1399|~ron(vd1401,esk1_2(X1,vd1399))|~rpoint(X1)),inference(cn,[status(thm)],[2252,theory(equality)])).
% cnf(2257,negated_conjecture,(vd1401=vd1399|~rpoint(vd1401)|~rpoint(vd1399)),inference(spm,[status(thm)],[2253,941,theory(equality)])).
% cnf(2259,negated_conjecture,(vd1401=vd1399|$false|~rpoint(vd1399)),inference(rw,[status(thm)],[2257,850,theory(equality)])).
% cnf(2260,negated_conjecture,(vd1401=vd1399|$false|$false),inference(rw,[status(thm)],[2259,852,theory(equality)])).
% cnf(2261,negated_conjecture,(vd1401=vd1399),inference(cn,[status(thm)],[2260,theory(equality)])).
% cnf(2262,negated_conjecture,($false),inference(sr,[status(thm)],[2261,375,theory(equality)])).
% cnf(2263,negated_conjecture,($false),2262,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 395
% # ...of these trivial : 5
% # ...subsumed : 19
% # ...remaining for further processing: 371
% # Other redundant clauses eliminated : 1197
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 7
% # Generated clauses : 326
% # ...of the previous two non-trivial : 322
% # Contextual simplify-reflections : 2
% # Paramodulations : 62
% # Factorizations : 0
% # Equation resolutions : 1206
% # Current number of processed clauses: 108
% # Positive orientable unit clauses: 26
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 73
% # Current number of unprocessed clauses: 212
% # ...number of literals in the above : 2131
% # Clause-clause subsumption calls (NU) : 596
% # Rec. Clause-clause subsumption calls : 182
% # Unit Clause-clause subsumption calls : 39
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 110 leaves, 1.26+/-0.656 terms/leaf
% # Paramod-from index: 48 leaves, 1.06+/-0.317 terms/leaf
% # Paramod-into index: 90 leaves, 1.14+/-0.528 terms/leaf
% # -------------------------------------------------
% # User time : 0.182 s
% # System time : 0.007 s
% # Total time : 0.189 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.40 CPU 0.46 WC
% FINAL PrfWatch: 0.40 CPU 0.46 WC
% SZS output end Solution for /tmp/SystemOnTPTP27693/GEO342+1.tptp
%
%------------------------------------------------------------------------------