TSTP Solution File: LCL512+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL512+1 : TPTP v5.0.0. Released v3.3.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 13:48:59 EST 2010
% Result : Theorem 1.18s
% Output : Solution 1.18s
% 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/SystemOnTPTP8267/LCL512+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8267/LCL512+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8267/LCL512+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 8399
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(equivalence_1<=>![X1]:![X2]:is_a_theorem(implies(equiv(X1,X2),implies(X1,X2)))),file('/tmp/SRASS.s.p', equivalence_1)).
% fof(2, axiom,op_equiv,file('/tmp/SRASS.s.p', rosser_op_equiv)).
% fof(5, axiom,kn2,file('/tmp/SRASS.s.p', rosser_kn2)).
% fof(22, axiom,(op_equiv=>![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),file('/tmp/SRASS.s.p', op_equiv)).
% fof(30, axiom,(kn2<=>![X4]:![X5]:is_a_theorem(implies(and(X4,X5),X4))),file('/tmp/SRASS.s.p', kn2)).
% fof(43, conjecture,equivalence_1,file('/tmp/SRASS.s.p', hilbert_equivalence_1)).
% fof(44, negated_conjecture,~(equivalence_1),inference(assume_negation,[status(cth)],[43])).
% fof(45, negated_conjecture,~(equivalence_1),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(46, plain,((~(equivalence_1)|![X1]:![X2]:is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))))|equivalence_1)),inference(fof_nnf,[status(thm)],[1])).
% fof(47, plain,((~(equivalence_1)|![X3]:![X4]:is_a_theorem(implies(equiv(X3,X4),implies(X3,X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(equiv(X5,X6),implies(X5,X6))))|equivalence_1)),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,((~(equivalence_1)|![X3]:![X4]:is_a_theorem(implies(equiv(X3,X4),implies(X3,X4))))&(~(is_a_theorem(implies(equiv(esk1_0,esk2_0),implies(esk1_0,esk2_0))))|equivalence_1)),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X3]:![X4]:((is_a_theorem(implies(equiv(X3,X4),implies(X3,X4)))|~(equivalence_1))&(~(is_a_theorem(implies(equiv(esk1_0,esk2_0),implies(esk1_0,esk2_0))))|equivalence_1)),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,plain,(equivalence_1|~is_a_theorem(implies(equiv(esk1_0,esk2_0),implies(esk1_0,esk2_0)))),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,plain,(op_equiv),inference(split_conjunct,[status(thm)],[2])).
% cnf(55,plain,(kn2),inference(split_conjunct,[status(thm)],[5])).
% fof(120, plain,(~(op_equiv)|![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),inference(fof_nnf,[status(thm)],[22])).
% fof(121, plain,(~(op_equiv)|![X3]:![X4]:equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))),inference(variable_rename,[status(thm)],[120])).
% fof(122, plain,![X3]:![X4]:(equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))|~(op_equiv)),inference(shift_quantors,[status(thm)],[121])).
% cnf(123,plain,(equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv),inference(split_conjunct,[status(thm)],[122])).
% fof(166, plain,((~(kn2)|![X4]:![X5]:is_a_theorem(implies(and(X4,X5),X4)))&(?[X4]:?[X5]:~(is_a_theorem(implies(and(X4,X5),X4)))|kn2)),inference(fof_nnf,[status(thm)],[30])).
% fof(167, plain,((~(kn2)|![X6]:![X7]:is_a_theorem(implies(and(X6,X7),X6)))&(?[X8]:?[X9]:~(is_a_theorem(implies(and(X8,X9),X8)))|kn2)),inference(variable_rename,[status(thm)],[166])).
% fof(168, plain,((~(kn2)|![X6]:![X7]:is_a_theorem(implies(and(X6,X7),X6)))&(~(is_a_theorem(implies(and(esk35_0,esk36_0),esk35_0)))|kn2)),inference(skolemize,[status(esa)],[167])).
% fof(169, plain,![X6]:![X7]:((is_a_theorem(implies(and(X6,X7),X6))|~(kn2))&(~(is_a_theorem(implies(and(esk35_0,esk36_0),esk35_0)))|kn2)),inference(shift_quantors,[status(thm)],[168])).
% cnf(171,plain,(is_a_theorem(implies(and(X1,X2),X1))|~kn2),inference(split_conjunct,[status(thm)],[169])).
% cnf(238,negated_conjecture,(~equivalence_1),inference(split_conjunct,[status(thm)],[45])).
% cnf(251,plain,(~is_a_theorem(implies(equiv(esk1_0,esk2_0),implies(esk1_0,esk2_0)))),inference(sr,[status(thm)],[50,238,theory(equality)])).
% cnf(254,plain,(is_a_theorem(implies(and(X1,X2),X1))|$false),inference(rw,[status(thm)],[171,55,theory(equality)])).
% cnf(255,plain,(is_a_theorem(implies(and(X1,X2),X1))),inference(cn,[status(thm)],[254,theory(equality)])).
% cnf(279,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)|$false),inference(rw,[status(thm)],[123,52,theory(equality)])).
% cnf(280,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)),inference(cn,[status(thm)],[279,theory(equality)])).
% cnf(281,plain,(is_a_theorem(implies(equiv(X1,X2),implies(X1,X2)))),inference(spm,[status(thm)],[255,280,theory(equality)])).
% cnf(343,plain,($false),inference(rw,[status(thm)],[251,281,theory(equality)])).
% cnf(344,plain,($false),inference(cn,[status(thm)],[343,theory(equality)])).
% cnf(345,plain,($false),344,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 92
% # ...of these trivial : 12
% # ...subsumed : 1
% # ...remaining for further processing: 79
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 56
% # ...of the previous two non-trivial : 55
% # Contextual simplify-reflections : 0
% # Paramodulations : 56
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 72
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 51
% # Current number of unprocessed clauses: 35
% # ...number of literals in the above : 49
% # Clause-clause subsumption calls (NU) : 103
% # Rec. Clause-clause subsumption calls : 103
% # Unit Clause-clause subsumption calls : 38
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 211 leaves, 1.28+/-1.042 terms/leaf
% # Paramod-from index: 20 leaves, 1.05+/-0.218 terms/leaf
% # Paramod-into index: 185 leaves, 1.12+/-0.576 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.007 s
% # Total time : 0.025 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.18 WC
% FINAL PrfWatch: 0.13 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP8267/LCL512+1.tptp
%
%------------------------------------------------------------------------------