TSTP Solution File: LCL512+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL512+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 10:11:37 EDT 2022
% Result : Theorem 0.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 13 unt; 0 def)
% Number of atoms : 35 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 25 ( 12 ~; 8 |; 2 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 2 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(hilbert_equivalence_1,conjecture,
equivalence_1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',hilbert_equivalence_1) ).
fof(kn2,axiom,
( kn2
<=> ! [X4,X5] : is_a_theorem(implies(and(X4,X5),X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',kn2) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(equivalence_1,axiom,
( equivalence_1
<=> ! [X1,X2] : is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',equivalence_1) ).
fof(rosser_kn2,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_kn2) ).
fof(rosser_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_op_equiv) ).
fof(c_0_6,negated_conjecture,
~ equivalence_1,
inference(assume_negation,[status(cth)],[hilbert_equivalence_1]) ).
fof(c_0_7,plain,
! [X6,X7] :
( ( ~ kn2
| is_a_theorem(implies(and(X6,X7),X6)) )
& ( ~ is_a_theorem(implies(and(esk34_0,esk35_0),esk34_0))
| kn2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn2])])])])])]) ).
fof(c_0_8,plain,
! [X3,X4] :
( ~ op_equiv
| equiv(X3,X4) = and(implies(X3,X4),implies(X4,X3)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])])])]) ).
fof(c_0_9,plain,
! [X3,X4] :
( ( ~ equivalence_1
| is_a_theorem(implies(equiv(X3,X4),implies(X3,X4))) )
& ( ~ is_a_theorem(implies(equiv(esk27_0,esk28_0),implies(esk27_0,esk28_0)))
| equivalence_1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equivalence_1])])])])])]) ).
fof(c_0_10,negated_conjecture,
~ equivalence_1,
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
kn2,
inference(split_conjunct,[status(thm)],[rosser_kn2]) ).
cnf(c_0_13,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[rosser_op_equiv]) ).
cnf(c_0_15,plain,
( equivalence_1
| ~ is_a_theorem(implies(equiv(esk27_0,esk28_0),implies(esk27_0,esk28_0))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
~ equivalence_1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_18,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_19,plain,
~ is_a_theorem(implies(equiv(esk27_0,esk28_0),implies(esk27_0,esk28_0))),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL512+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.13/0.36 % Computer : n020.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 600
% 0.13/0.36 % DateTime : Mon Jul 4 09:25:45 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44 # Preprocessing time : 0.015 s
% 0.26/1.44
% 0.26/1.44 # Failure: Out of unprocessed clauses!
% 0.26/1.44 # OLD status GaveUp
% 0.26/1.44 # Parsed axioms : 43
% 0.26/1.44 # Removed by relevancy pruning/SinE : 41
% 0.26/1.44 # Initial clauses : 3
% 0.26/1.44 # Removed in clause preprocessing : 0
% 0.26/1.44 # Initial clauses in saturation : 3
% 0.26/1.44 # Processed clauses : 3
% 0.26/1.44 # ...of these trivial : 0
% 0.26/1.44 # ...subsumed : 1
% 0.26/1.44 # ...remaining for further processing : 2
% 0.26/1.44 # Other redundant clauses eliminated : 0
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 0
% 0.26/1.44 # Backward-rewritten : 0
% 0.26/1.44 # Generated clauses : 0
% 0.26/1.44 # ...of the previous two non-trivial : 0
% 0.26/1.44 # Contextual simplify-reflections : 0
% 0.26/1.44 # Paramodulations : 0
% 0.26/1.44 # Factorizations : 0
% 0.26/1.44 # Equation resolutions : 0
% 0.26/1.44 # Current number of processed clauses : 2
% 0.26/1.44 # Positive orientable unit clauses : 0
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 2
% 0.26/1.44 # Non-unit-clauses : 0
% 0.26/1.44 # Current number of unprocessed clauses: 0
% 0.26/1.44 # ...number of literals in the above : 0
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 0
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 0
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 0
% 0.26/1.44 # Non-unit clause-clause subsumptions : 0
% 0.26/1.44 # Unit Clause-clause subsumption calls : 0
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 0
% 0.26/1.44 # BW rewrite match successes : 0
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 492
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.012 s
% 0.26/1.44 # System time : 0.003 s
% 0.26/1.44 # Total time : 0.015 s
% 0.26/1.44 # Maximum resident set size: 2728 pages
% 0.26/1.44 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.26/1.44 # Preprocessing time : 0.020 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 22
% 0.26/1.44 # Proof object clause steps : 11
% 0.26/1.44 # Proof object formula steps : 11
% 0.26/1.44 # Proof object conjectures : 4
% 0.26/1.44 # Proof object clause conjectures : 1
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 6
% 0.26/1.44 # Proof object initial formulas used : 6
% 0.26/1.44 # Proof object generating inferences : 1
% 0.26/1.44 # Proof object simplifying inferences : 7
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 43
% 0.26/1.44 # Removed by relevancy pruning/SinE : 0
% 0.26/1.44 # Initial clauses : 72
% 0.26/1.44 # Removed in clause preprocessing : 0
% 0.26/1.44 # Initial clauses in saturation : 72
% 0.26/1.44 # Processed clauses : 520
% 0.26/1.44 # ...of these trivial : 10
% 0.26/1.44 # ...subsumed : 194
% 0.26/1.44 # ...remaining for further processing : 316
% 0.26/1.44 # Other redundant clauses eliminated : 0
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 18
% 0.26/1.44 # Backward-rewritten : 8
% 0.26/1.44 # Generated clauses : 1356
% 0.26/1.44 # ...of the previous two non-trivial : 1228
% 0.26/1.44 # Contextual simplify-reflections : 281
% 0.26/1.44 # Paramodulations : 1356
% 0.26/1.44 # Factorizations : 0
% 0.26/1.44 # Equation resolutions : 0
% 0.26/1.44 # Current number of processed clauses : 290
% 0.26/1.44 # Positive orientable unit clauses : 19
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 1
% 0.26/1.44 # Non-unit-clauses : 270
% 0.26/1.44 # Current number of unprocessed clauses: 772
% 0.26/1.44 # ...number of literals in the above : 2595
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 26
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 26674
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 12390
% 0.26/1.44 # Non-unit clause-clause subsumptions : 491
% 0.26/1.44 # Unit Clause-clause subsumption calls : 58
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 13
% 0.26/1.44 # BW rewrite match successes : 9
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 18406
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.058 s
% 0.26/1.44 # System time : 0.006 s
% 0.26/1.44 # Total time : 0.064 s
% 0.26/1.44 # Maximum resident set size: 4380 pages
%------------------------------------------------------------------------------