TSTP Solution File: LCL684+1.001 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL684+1.001 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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 15:47:48 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP30198/LCL684+1.001.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP30198/LCL684+1.001.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30198/LCL684+1.001.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 30294
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:r1(X1,X1),file('/tmp/SRASS.s.p', reflexivity)).
% fof(3, conjecture,~(?[X1]:~((~(![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~((p201(X1)&p101(X1))))))|~((p201(X1)&p101(X1)))))),file('/tmp/SRASS.s.p', main)).
% fof(4, negated_conjecture,~(~(?[X1]:~((~(![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~((p201(X1)&p101(X1))))))|~((p201(X1)&p101(X1))))))),inference(assume_negation,[status(cth)],[3])).
% fof(5, negated_conjecture,~(~(?[X1]:~((~(![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~((p201(X1)&p101(X1))))))|~((p201(X1)&p101(X1))))))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(6, plain,![X2]:r1(X2,X2),inference(variable_rename,[status(thm)],[1])).
% cnf(7,plain,(r1(X1,X1)),inference(split_conjunct,[status(thm)],[6])).
% fof(11, negated_conjecture,?[X1]:(![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|(~(p201(X1))|~(p101(X1)))))&(p201(X1)&p101(X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(12, negated_conjecture,?[X3]:(![X4]:(~(r1(X3,X4))|![X5]:(~(r1(X4,X5))|(~(p201(X5))|~(p101(X5)))))&(p201(X3)&p101(X3))),inference(variable_rename,[status(thm)],[11])).
% fof(13, negated_conjecture,(![X4]:(~(r1(esk1_0,X4))|![X5]:(~(r1(X4,X5))|(~(p201(X5))|~(p101(X5)))))&(p201(esk1_0)&p101(esk1_0))),inference(skolemize,[status(esa)],[12])).
% fof(14, negated_conjecture,![X4]:![X5]:(((~(r1(X4,X5))|(~(p201(X5))|~(p101(X5))))|~(r1(esk1_0,X4)))&(p201(esk1_0)&p101(esk1_0))),inference(shift_quantors,[status(thm)],[13])).
% cnf(15,negated_conjecture,(p101(esk1_0)),inference(split_conjunct,[status(thm)],[14])).
% cnf(16,negated_conjecture,(p201(esk1_0)),inference(split_conjunct,[status(thm)],[14])).
% cnf(17,negated_conjecture,(~r1(esk1_0,X1)|~p101(X2)|~p201(X2)|~r1(X1,X2)),inference(split_conjunct,[status(thm)],[14])).
% cnf(19,negated_conjecture,(~p101(X1)|~p201(X1)|~r1(esk1_0,X1)),inference(spm,[status(thm)],[17,7,theory(equality)])).
% cnf(20,negated_conjecture,(~p201(esk1_0)|~r1(esk1_0,esk1_0)),inference(spm,[status(thm)],[19,15,theory(equality)])).
% cnf(21,negated_conjecture,($false|~r1(esk1_0,esk1_0)),inference(rw,[status(thm)],[20,16,theory(equality)])).
% cnf(22,negated_conjecture,($false|$false),inference(rw,[status(thm)],[21,7,theory(equality)])).
% cnf(23,negated_conjecture,($false),inference(cn,[status(thm)],[22,theory(equality)])).
% cnf(24,negated_conjecture,($false),23,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 11
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 11
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 3
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections : 0
% # Paramodulations : 3
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 6
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 8 leaves, 1.62+/-1.317 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 6 leaves, 1.17+/-0.373 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.001 s
% # Total time : 0.010 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP30198/LCL684+1.001.tptp
%
%------------------------------------------------------------------------------