%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL484+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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:28 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% 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 ( 3 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(hilbert_implies_1,conjecture,
implies_1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',hilbert_implies_1) ).
fof(r2,axiom,
( r2
<=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r2) ).
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(implies_1,axiom,
( implies_1
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_1) ).
fof(principia_r2,axiom,
r2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
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_6,negated_conjecture,
~ implies_1,
inference(assume_negation,[status(cth)],[hilbert_implies_1]) ).
fof(c_0_7,plain,
! [X6,X7] :
( ( ~ r2
| is_a_theorem(implies(X7,or(X6,X7))) )
& ( ~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0)))
| r2 ) ),
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)],[r2])])])])])]) ).
fof(c_0_8,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])])])])]) ).
fof(c_0_9,plain,
! [X3,X4] :
( ( ~ implies_1
| is_a_theorem(implies(X3,implies(X4,X3))) )
& ( ~ is_a_theorem(implies(esk7_0,implies(esk8_0,esk7_0)))
| implies_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)],[implies_1])])])])])]) ).
fof(c_0_10,negated_conjecture,
~ implies_1,
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
r2,
inference(split_conjunct,[status(thm)],[principia_r2]) ).
cnf(c_0_13,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
cnf(c_0_15,plain,
( implies_1
| ~ is_a_theorem(implies(esk7_0,implies(esk8_0,esk7_0))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
~ implies_1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_18,plain,
or(not(X1),X2) = implies(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(esk7_0,implies(esk8_0,esk7_0))),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
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.11/0.12 % Problem : LCL484+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 08:23:53 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.009 s
% 0.25/1.42
% 0.25/1.42 # Failure: Out of unprocessed clauses!
% 0.25/1.42 # OLD status GaveUp
% 0.25/1.42 # Parsed axioms : 45
% 0.25/1.42 # Removed by relevancy pruning/SinE : 43
% 0.25/1.42 # Initial clauses : 3
% 0.25/1.42 # Removed in clause preprocessing : 0
% 0.25/1.42 # Initial clauses in saturation : 3
% 0.25/1.42 # Processed clauses : 3
% 0.25/1.42 # ...of these trivial : 0
% 0.25/1.42 # ...subsumed : 1
% 0.25/1.42 # ...remaining for further processing : 2
% 0.25/1.42 # Other redundant clauses eliminated : 0
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 0
% 0.25/1.42 # Backward-rewritten : 0
% 0.25/1.42 # Generated clauses : 0
% 0.25/1.42 # ...of the previous two non-trivial : 0
% 0.25/1.42 # Contextual simplify-reflections : 0
% 0.25/1.42 # Paramodulations : 0
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 0
% 0.25/1.42 # Current number of processed clauses : 2
% 0.25/1.42 # Positive orientable unit clauses : 0
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 2
% 0.25/1.42 # Non-unit-clauses : 0
% 0.25/1.42 # Current number of unprocessed clauses: 0
% 0.25/1.42 # ...number of literals in the above : 0
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 0
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.25/1.42 # Non-unit clause-clause subsumptions : 0
% 0.25/1.42 # Unit Clause-clause subsumption calls : 0
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 0
% 0.25/1.42 # BW rewrite match successes : 0
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 485
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.007 s
% 0.25/1.42 # System time : 0.002 s
% 0.25/1.42 # Total time : 0.009 s
% 0.25/1.42 # Maximum resident set size: 2732 pages
% 0.25/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.42 # Preprocessing time : 0.019 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 22
% 0.25/1.42 # Proof object clause steps : 11
% 0.25/1.42 # Proof object formula steps : 11
% 0.25/1.42 # Proof object conjectures : 4
% 0.25/1.42 # Proof object clause conjectures : 1
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 6
% 0.25/1.42 # Proof object initial formulas used : 6
% 0.25/1.42 # Proof object generating inferences : 1
% 0.25/1.42 # Proof object simplifying inferences : 7
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 45
% 0.25/1.42 # Removed by relevancy pruning/SinE : 0
% 0.25/1.42 # Initial clauses : 74
% 0.25/1.42 # Removed in clause preprocessing : 0
% 0.25/1.42 # Initial clauses in saturation : 74
% 0.25/1.42 # Processed clauses : 102
% 0.25/1.42 # ...of these trivial : 11
% 0.25/1.42 # ...subsumed : 2
% 0.25/1.42 # ...remaining for further processing : 89
% 0.25/1.42 # Other redundant clauses eliminated : 0
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 1
% 0.25/1.42 # Backward-rewritten : 7
% 0.25/1.42 # Generated clauses : 144
% 0.25/1.42 # ...of the previous two non-trivial : 120
% 0.25/1.42 # Contextual simplify-reflections : 0
% 0.25/1.42 # Paramodulations : 144
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 0
% 0.25/1.42 # Current number of processed clauses : 81
% 0.25/1.42 # Positive orientable unit clauses : 25
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 3
% 0.25/1.42 # Non-unit-clauses : 53
% 0.25/1.42 # Current number of unprocessed clauses: 90
% 0.25/1.42 # ...number of literals in the above : 175
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 8
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 478
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 477
% 0.25/1.42 # Non-unit clause-clause subsumptions : 1
% 0.25/1.42 # Unit Clause-clause subsumption calls : 123
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 36
% 0.25/1.42 # BW rewrite match successes : 8
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 5694
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.021 s
% 0.25/1.42 # System time : 0.003 s
% 0.25/1.42 # Total time : 0.024 s
% 0.25/1.42 # Maximum resident set size: 3324 pages
%------------------------------------------------------------------------------