TSTP Solution File: GEO343+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO343+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:38:17 EST 2010
% Result : Theorem 1.94s
% Output : Solution 1.94s
% 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/SystemOnTPTP17791/GEO343+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17791/GEO343+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17791/GEO343+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 17887
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.083 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,((ron(vd1399,vd1416)&ron(vd1401,vd1416))&rline(vd1416)),file('/tmp/SRASS.s.p', 'and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 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(38, 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(125, conjecture,![X777]:(((ron(vd1399,X777)&ron(vd1401,X777))&rline(X777))=>X777=vd1416),file('/tmp/SRASS.s.p', 'qu(theu(the(408), 1), imp(the(408)))')).
% fof(126, negated_conjecture,~(![X777]:(((ron(vd1399,X777)&ron(vd1401,X777))&rline(X777))=>X777=vd1416)),inference(assume_negation,[status(cth)],[125])).
% cnf(158,plain,(rline(vd1416)),inference(split_conjunct,[status(thm)],[1])).
% cnf(159,plain,(ron(vd1401,vd1416)),inference(split_conjunct,[status(thm)],[1])).
% cnf(160,plain,(ron(vd1399,vd1416)),inference(split_conjunct,[status(thm)],[1])).
% fof(169, 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(170, 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)],[169])).
% fof(171, 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)],[170])).
% cnf(172,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)],[171])).
% fof(370, 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)],[38])).
% fof(371, 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)],[370])).
% cnf(372,plain,(rpoint(esk22_0)),inference(split_conjunct,[status(thm)],[371])).
% cnf(373,plain,(vd1399=esk22_0),inference(split_conjunct,[status(thm)],[371])).
% cnf(376,plain,(rpoint(esk20_0)),inference(split_conjunct,[status(thm)],[371])).
% cnf(377,plain,(vd1401=esk20_0),inference(split_conjunct,[status(thm)],[371])).
% cnf(379,plain,(vd1399!=vd1401),inference(split_conjunct,[status(thm)],[371])).
% fof(850, negated_conjecture,?[X777]:(((ron(vd1399,X777)&ron(vd1401,X777))&rline(X777))&~(X777=vd1416)),inference(fof_nnf,[status(thm)],[126])).
% fof(851, negated_conjecture,?[X778]:(((ron(vd1399,X778)&ron(vd1401,X778))&rline(X778))&~(X778=vd1416)),inference(variable_rename,[status(thm)],[850])).
% fof(852, negated_conjecture,(((ron(vd1399,esk55_0)&ron(vd1401,esk55_0))&rline(esk55_0))&~(esk55_0=vd1416)),inference(skolemize,[status(esa)],[851])).
% cnf(853,negated_conjecture,(esk55_0!=vd1416),inference(split_conjunct,[status(thm)],[852])).
% cnf(854,negated_conjecture,(rline(esk55_0)),inference(split_conjunct,[status(thm)],[852])).
% cnf(855,negated_conjecture,(ron(vd1401,esk55_0)),inference(split_conjunct,[status(thm)],[852])).
% cnf(856,negated_conjecture,(ron(vd1399,esk55_0)),inference(split_conjunct,[status(thm)],[852])).
% cnf(858,plain,(rpoint(vd1401)),inference(rw,[status(thm)],[376,377,theory(equality)])).
% cnf(860,plain,(rpoint(vd1399)),inference(rw,[status(thm)],[372,373,theory(equality)])).
% cnf(1119,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)],[172,theory(equality)])).
% cnf(1120,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)],[1119,theory(equality)])).
% cnf(1121,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)],[1120,theory(equality)])).
% cnf(1122,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)],[1121,theory(equality)])).
% cnf(3364,negated_conjecture,(X1=vd1401|X2=esk55_0|~rpoint(X1)|~rpoint(vd1401)|~rline(X2)|~rline(esk55_0)|~ron(vd1401,X2)|~ron(X1,esk55_0)|~ron(X1,X2)),inference(spm,[status(thm)],[1122,855,theory(equality)])).
% cnf(3421,negated_conjecture,(X1=vd1401|X2=esk55_0|~rpoint(X1)|$false|~rline(X2)|~rline(esk55_0)|~ron(vd1401,X2)|~ron(X1,esk55_0)|~ron(X1,X2)),inference(rw,[status(thm)],[3364,858,theory(equality)])).
% cnf(3422,negated_conjecture,(X1=vd1401|X2=esk55_0|~rpoint(X1)|$false|~rline(X2)|$false|~ron(vd1401,X2)|~ron(X1,esk55_0)|~ron(X1,X2)),inference(rw,[status(thm)],[3421,854,theory(equality)])).
% cnf(3423,negated_conjecture,(X1=vd1401|X2=esk55_0|~rpoint(X1)|~rline(X2)|~ron(vd1401,X2)|~ron(X1,esk55_0)|~ron(X1,X2)),inference(cn,[status(thm)],[3422,theory(equality)])).
% cnf(3445,negated_conjecture,(vd1416=esk55_0|X1=vd1401|~rpoint(X1)|~rline(vd1416)|~ron(X1,esk55_0)|~ron(X1,vd1416)),inference(spm,[status(thm)],[3423,159,theory(equality)])).
% cnf(3452,negated_conjecture,(vd1416=esk55_0|X1=vd1401|~rpoint(X1)|$false|~ron(X1,esk55_0)|~ron(X1,vd1416)),inference(rw,[status(thm)],[3445,158,theory(equality)])).
% cnf(3453,negated_conjecture,(vd1416=esk55_0|X1=vd1401|~rpoint(X1)|~ron(X1,esk55_0)|~ron(X1,vd1416)),inference(cn,[status(thm)],[3452,theory(equality)])).
% cnf(3454,negated_conjecture,(X1=vd1401|~rpoint(X1)|~ron(X1,esk55_0)|~ron(X1,vd1416)),inference(sr,[status(thm)],[3453,853,theory(equality)])).
% cnf(3461,negated_conjecture,(vd1399=vd1401|~rpoint(vd1399)|~ron(vd1399,vd1416)),inference(spm,[status(thm)],[3454,856,theory(equality)])).
% cnf(3472,negated_conjecture,(vd1399=vd1401|$false|~ron(vd1399,vd1416)),inference(rw,[status(thm)],[3461,860,theory(equality)])).
% cnf(3473,negated_conjecture,(vd1399=vd1401|$false|$false),inference(rw,[status(thm)],[3472,160,theory(equality)])).
% cnf(3474,negated_conjecture,(vd1399=vd1401),inference(cn,[status(thm)],[3473,theory(equality)])).
% cnf(3475,negated_conjecture,($false),inference(sr,[status(thm)],[3474,379,theory(equality)])).
% cnf(3476,negated_conjecture,($false),3475,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 684
% # ...of these trivial : 6
% # ...subsumed : 92
% # ...remaining for further processing: 586
% # Other redundant clauses eliminated : 1197
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 11
% # Generated clauses : 831
% # ...of the previous two non-trivial : 800
% # Contextual simplify-reflections : 16
% # Paramodulations : 555
% # Factorizations : 2
% # Equation resolutions : 1216
% # Current number of processed clauses: 315
% # Positive orientable unit clauses: 67
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 23
% # Non-unit-clauses : 225
% # Current number of unprocessed clauses: 350
% # ...number of literals in the above : 2844
% # Clause-clause subsumption calls (NU) : 2429
% # Rec. Clause-clause subsumption calls : 882
% # Unit Clause-clause subsumption calls : 98
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 46
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 242 leaves, 1.71+/-1.417 terms/leaf
% # Paramod-from index: 94 leaves, 1.32+/-0.913 terms/leaf
% # Paramod-into index: 174 leaves, 1.47+/-1.049 terms/leaf
% # -------------------------------------------------
% # User time : 0.233 s
% # System time : 0.008 s
% # Total time : 0.241 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.45 CPU 0.54 WC
% FINAL PrfWatch: 0.45 CPU 0.54 WC
% SZS output end Solution for /tmp/SystemOnTPTP17791/GEO343+1.tptp
%
%------------------------------------------------------------------------------