TSTP Solution File: LCL527+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL527+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:42 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 13 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 64 ( 24 ~; 26 |; 9 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(and_3,axiom,
( and_3
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_3) ).
fof(s1_0_adjunction,conjecture,
adjunction,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',s1_0_adjunction) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(hilbert_and_3,axiom,
and_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
fof(adjunction,axiom,
( adjunction
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(X2) )
=> is_a_theorem(and(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',adjunction) ).
fof(c_0_6,plain,
! [X3,X4] :
( ( ~ modus_ponens
| ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X3,X4))
| is_a_theorem(X4) )
& ( is_a_theorem(esk1_0)
| modus_ponens )
& ( is_a_theorem(implies(esk1_0,esk2_0))
| modus_ponens )
& ( ~ is_a_theorem(esk2_0)
| modus_ponens ) ),
inference(distribute,[status(thm)],[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_ponens])])])])])])]) ).
fof(c_0_7,plain,
! [X3,X4] :
( ( ~ and_3
| is_a_theorem(implies(X3,implies(X4,and(X3,X4)))) )
& ( ~ is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0))))
| and_3 ) ),
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)],[and_3])])])])])]) ).
fof(c_0_8,negated_conjecture,
~ adjunction,
inference(assume_negation,[status(cth)],[s1_0_adjunction]) ).
cnf(c_0_9,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| ~ modus_ponens ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
and_3,
inference(split_conjunct,[status(thm)],[hilbert_and_3]) ).
fof(c_0_13,plain,
! [X3,X4] :
( ( ~ adjunction
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X4)
| is_a_theorem(and(X3,X4)) )
& ( is_a_theorem(esk59_0)
| adjunction )
& ( is_a_theorem(esk60_0)
| adjunction )
& ( ~ is_a_theorem(and(esk59_0,esk60_0))
| adjunction ) ),
inference(distribute,[status(thm)],[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)],[adjunction])])])])])])]) ).
fof(c_0_14,negated_conjecture,
~ adjunction,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_17,plain,
( adjunction
| ~ is_a_theorem(and(esk59_0,esk60_0)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
~ adjunction,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,and(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( adjunction
| is_a_theorem(esk60_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( adjunction
| is_a_theorem(esk59_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
~ is_a_theorem(and(esk59_0,esk60_0)),
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_24,plain,
is_a_theorem(esk60_0),
inference(sr,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_25,plain,
is_a_theorem(esk59_0),
inference(sr,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_26,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL527+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 14:17:03 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.015 s
% 0.23/1.41
% 0.23/1.41 # Failure: Out of unprocessed clauses!
% 0.23/1.41 # OLD status GaveUp
% 0.23/1.41 # Parsed axioms : 88
% 0.23/1.41 # Removed by relevancy pruning/SinE : 86
% 0.23/1.41 # Initial clauses : 5
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 5
% 0.23/1.41 # Processed clauses : 5
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 1
% 0.23/1.41 # ...remaining for further processing : 4
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 0
% 0.23/1.41 # ...of the previous two non-trivial : 0
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 0
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 4
% 0.23/1.41 # Positive orientable unit clauses : 2
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 0
% 0.23/1.41 # Current number of unprocessed clauses: 0
% 0.23/1.41 # ...number of literals in the above : 0
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 0
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 0
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 0
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 900
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.014 s
% 0.23/1.41 # System time : 0.001 s
% 0.23/1.41 # Total time : 0.015 s
% 0.23/1.41 # Maximum resident set size: 2860 pages
% 0.23/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.022 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 27
% 0.23/1.41 # Proof object clause steps : 16
% 0.23/1.41 # Proof object formula steps : 11
% 0.23/1.41 # Proof object conjectures : 4
% 0.23/1.41 # Proof object clause conjectures : 1
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 8
% 0.23/1.41 # Proof object initial formulas used : 6
% 0.23/1.41 # Proof object generating inferences : 3
% 0.23/1.41 # Proof object simplifying inferences : 10
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 88
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 146
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 146
% 0.23/1.41 # Processed clauses : 445
% 0.23/1.41 # ...of these trivial : 29
% 0.23/1.41 # ...subsumed : 79
% 0.23/1.41 # ...remaining for further processing : 337
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 2
% 0.23/1.41 # Backward-rewritten : 22
% 0.23/1.41 # Generated clauses : 1867
% 0.23/1.41 # ...of the previous two non-trivial : 1777
% 0.23/1.41 # Contextual simplify-reflections : 61
% 0.23/1.41 # Paramodulations : 1867
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 313
% 0.23/1.41 # Positive orientable unit clauses : 65
% 0.23/1.41 # Positive unorientable unit clauses: 1
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 245
% 0.23/1.41 # Current number of unprocessed clauses: 1449
% 0.23/1.41 # ...number of literals in the above : 4786
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 24
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 10390
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 6197
% 0.23/1.41 # Non-unit clause-clause subsumptions : 141
% 0.23/1.41 # Unit Clause-clause subsumption calls : 409
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 47
% 0.23/1.41 # BW rewrite match successes : 11
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 32590
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.067 s
% 0.23/1.41 # System time : 0.006 s
% 0.23/1.41 # Total time : 0.073 s
% 0.23/1.41 # Maximum resident set size: 5596 pages
%------------------------------------------------------------------------------