%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL483+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.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:27 EDT 2022
% Result : Theorem 0.24s 1.40s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 20 unt; 0 def)
% Number of atoms : 54 ( 12 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 36 ( 17 ~; 12 |; 2 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(hilbert_modus_tollens,conjecture,
modus_tollens,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',hilbert_modus_tollens) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(modus_tollens,axiom,
( modus_tollens
<=> ! [X1,X2] : is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_tollens) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',hilbert_op_implies_and) ).
fof(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r3) ).
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',hilbert_op_or) ).
fof(principia_r3,axiom,
r3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r3) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
fof(c_0_10,negated_conjecture,
~ modus_tollens,
inference(assume_negation,[status(cth)],[hilbert_modus_tollens]) ).
fof(c_0_11,plain,
! [X3,X4] :
( ~ op_implies_and
| implies(X3,X4) = not(and(X3,not(X4))) ),
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_implies_and])])])])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ( ~ modus_tollens
| is_a_theorem(implies(implies(not(X4),not(X3)),implies(X3,X4))) )
& ( ~ is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0)))
| modus_tollens ) ),
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)],[modus_tollens])])])])])]) ).
fof(c_0_13,negated_conjecture,
~ modus_tollens,
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ~ op_or
| or(X3,X4) = not(and(not(X3),not(X4))) ),
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_or])])])])]) ).
cnf(c_0_15,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
fof(c_0_17,plain,
! [X6,X7] :
( ( ~ r3
| is_a_theorem(implies(or(X6,X7),or(X7,X6))) )
& ( ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))
| r3 ) ),
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)],[r3])])])])])]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ op_implies_or
| implies(X3,X4) = or(not(X3),X4) ),
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_implies_or])])])])]) ).
cnf(c_0_19,plain,
( modus_tollens
| ~ is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0))) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
~ modus_tollens,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_23,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
r3,
inference(split_conjunct,[status(thm)],[principia_r3]) ).
cnf(c_0_26,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
cnf(c_0_28,plain,
~ is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0))),
inference(sr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_31,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_32,plain,
~ is_a_theorem(implies(or(esk6_0,not(esk5_0)),implies(esk5_0,esk6_0))),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL483+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 3 00:57:22 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.24/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.40 # Preprocessing time : 0.008 s
% 0.24/1.40
% 0.24/1.40 # Failure: Out of unprocessed clauses!
% 0.24/1.40 # OLD status GaveUp
% 0.24/1.40 # Parsed axioms : 45
% 0.24/1.40 # Removed by relevancy pruning/SinE : 43
% 0.24/1.40 # Initial clauses : 3
% 0.24/1.40 # Removed in clause preprocessing : 0
% 0.24/1.40 # Initial clauses in saturation : 3
% 0.24/1.40 # Processed clauses : 3
% 0.24/1.40 # ...of these trivial : 0
% 0.24/1.40 # ...subsumed : 1
% 0.24/1.40 # ...remaining for further processing : 2
% 0.24/1.40 # Other redundant clauses eliminated : 0
% 0.24/1.40 # Clauses deleted for lack of memory : 0
% 0.24/1.40 # Backward-subsumed : 0
% 0.24/1.40 # Backward-rewritten : 0
% 0.24/1.40 # Generated clauses : 0
% 0.24/1.40 # ...of the previous two non-trivial : 0
% 0.24/1.40 # Contextual simplify-reflections : 0
% 0.24/1.40 # Paramodulations : 0
% 0.24/1.40 # Factorizations : 0
% 0.24/1.40 # Equation resolutions : 0
% 0.24/1.40 # Current number of processed clauses : 2
% 0.24/1.40 # Positive orientable unit clauses : 0
% 0.24/1.40 # Positive unorientable unit clauses: 0
% 0.24/1.40 # Negative unit clauses : 2
% 0.24/1.40 # Non-unit-clauses : 0
% 0.24/1.40 # Current number of unprocessed clauses: 0
% 0.24/1.40 # ...number of literals in the above : 0
% 0.24/1.40 # Current number of archived formulas : 0
% 0.24/1.40 # Current number of archived clauses : 0
% 0.24/1.40 # Clause-clause subsumption calls (NU) : 0
% 0.24/1.40 # Rec. Clause-clause subsumption calls : 0
% 0.24/1.40 # Non-unit clause-clause subsumptions : 0
% 0.24/1.40 # Unit Clause-clause subsumption calls : 0
% 0.24/1.40 # Rewrite failures with RHS unbound : 0
% 0.24/1.40 # BW rewrite match attempts : 0
% 0.24/1.40 # BW rewrite match successes : 0
% 0.24/1.40 # Condensation attempts : 0
% 0.24/1.40 # Condensation successes : 0
% 0.24/1.40 # Termbank termtop insertions : 512
% 0.24/1.40
% 0.24/1.40 # -------------------------------------------------
% 0.24/1.40 # User time : 0.007 s
% 0.24/1.40 # System time : 0.001 s
% 0.24/1.40 # Total time : 0.009 s
% 0.24/1.40 # Maximum resident set size: 2736 pages
% 0.24/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.40 # Preprocessing time : 0.011 s
% 0.24/1.40
% 0.24/1.40 # Proof found!
% 0.24/1.40 # SZS status Theorem
% 0.24/1.40 # SZS output start CNFRefutation
% See solution above
% 0.24/1.40 # Proof object total steps : 35
% 0.24/1.40 # Proof object clause steps : 18
% 0.24/1.40 # Proof object formula steps : 17
% 0.24/1.40 # Proof object conjectures : 4
% 0.24/1.40 # Proof object clause conjectures : 1
% 0.24/1.40 # Proof object formula conjectures : 3
% 0.24/1.40 # Proof object initial clauses used : 10
% 0.24/1.40 # Proof object initial formulas used : 10
% 0.24/1.40 # Proof object generating inferences : 1
% 0.24/1.40 # Proof object simplifying inferences : 13
% 0.24/1.40 # Training examples: 0 positive, 0 negative
% 0.24/1.40 # Parsed axioms : 45
% 0.24/1.40 # Removed by relevancy pruning/SinE : 0
% 0.24/1.40 # Initial clauses : 74
% 0.24/1.40 # Removed in clause preprocessing : 0
% 0.24/1.40 # Initial clauses in saturation : 74
% 0.24/1.40 # Processed clauses : 300
% 0.24/1.40 # ...of these trivial : 11
% 0.24/1.40 # ...subsumed : 78
% 0.24/1.40 # ...remaining for further processing : 211
% 0.24/1.40 # Other redundant clauses eliminated : 0
% 0.24/1.40 # Clauses deleted for lack of memory : 0
% 0.24/1.40 # Backward-subsumed : 12
% 0.24/1.40 # Backward-rewritten : 13
% 0.24/1.40 # Generated clauses : 889
% 0.24/1.40 # ...of the previous two non-trivial : 800
% 0.24/1.40 # Contextual simplify-reflections : 21
% 0.24/1.40 # Paramodulations : 889
% 0.24/1.40 # Factorizations : 0
% 0.24/1.40 # Equation resolutions : 0
% 0.24/1.40 # Current number of processed clauses : 186
% 0.24/1.40 # Positive orientable unit clauses : 39
% 0.24/1.40 # Positive unorientable unit clauses: 0
% 0.24/1.40 # Negative unit clauses : 3
% 0.24/1.40 # Non-unit-clauses : 144
% 0.24/1.40 # Current number of unprocessed clauses: 529
% 0.24/1.40 # ...number of literals in the above : 1080
% 0.24/1.40 # Current number of archived formulas : 0
% 0.24/1.40 # Current number of archived clauses : 25
% 0.24/1.40 # Clause-clause subsumption calls (NU) : 5553
% 0.24/1.40 # Rec. Clause-clause subsumption calls : 5438
% 0.24/1.40 # Non-unit clause-clause subsumptions : 108
% 0.24/1.40 # Unit Clause-clause subsumption calls : 203
% 0.24/1.40 # Rewrite failures with RHS unbound : 0
% 0.24/1.40 # BW rewrite match attempts : 46
% 0.24/1.40 # BW rewrite match successes : 13
% 0.24/1.40 # Condensation attempts : 0
% 0.24/1.40 # Condensation successes : 0
% 0.24/1.40 # Termbank termtop insertions : 15977
% 0.24/1.40
% 0.24/1.40 # -------------------------------------------------
% 0.24/1.40 # User time : 0.023 s
% 0.24/1.40 # System time : 0.002 s
% 0.24/1.40 # Total time : 0.025 s
% 0.24/1.40 # Maximum resident set size: 4116 pages
%------------------------------------------------------------------------------