TSTP Solution File: LCL490+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL490+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:30 EDT 2022
% Result : Theorem 0.26s 10.78s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 21 unt; 0 def)
% Number of atoms : 90 ( 4 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 79 ( 33 ~; 31 |; 8 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-2 aty)
% Number of variables : 62 ( 4 sgn 26 !; 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/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(r5,axiom,
( r5
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r5) ).
fof(principia_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_modus_ponens) ).
fof(principia_r5,axiom,
r5,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r5) ).
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
fof(r2,axiom,
( r2
<=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(hilbert_or_1,conjecture,
or_1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',hilbert_or_1) ).
fof(principia_r2,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
fof(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r3) ).
fof(or_1,axiom,
( or_1
<=> ! [X1,X2] : is_a_theorem(implies(X1,or(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',or_1) ).
fof(principia_r3,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r3) ).
fof(c_0_12,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_13,plain,
! [X7,X8,X9] :
( ( ~ r5
| is_a_theorem(implies(implies(X8,X9),implies(or(X7,X8),or(X7,X9)))) )
& ( ~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0))))
| r5 ) ),
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)],[r5])])])])])]) ).
cnf(c_0_14,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| ~ modus_ponens ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[principia_modus_ponens]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
r5,
inference(split_conjunct,[status(thm)],[principia_r5]) ).
cnf(c_0_18,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_14,c_0_15])]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
fof(c_0_20,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_21,plain,
( is_a_theorem(implies(or(X1,X2),or(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
fof(c_0_24,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_25,negated_conjecture,
~ or_1,
inference(assume_negation,[status(cth)],[hilbert_or_1]) ).
cnf(c_0_26,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_27,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
r2,
inference(split_conjunct,[status(thm)],[principia_r2]) ).
fof(c_0_30,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_31,plain,
! [X3,X4] :
( ( ~ or_1
| is_a_theorem(implies(X3,or(X3,X4))) )
& ( ~ is_a_theorem(implies(esk20_0,or(esk20_0,esk21_0)))
| or_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)],[or_1])])])])])]) ).
fof(c_0_32,negated_conjecture,
~ or_1,
inference(fof_simplification,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_27]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
r3,
inference(split_conjunct,[status(thm)],[principia_r3]) ).
cnf(c_0_37,plain,
( or_1
| ~ is_a_theorem(implies(esk20_0,or(esk20_0,esk21_0))) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
~ or_1,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(or(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_41,plain,
~ is_a_theorem(implies(esk20_0,or(esk20_0,esk21_0))),
inference(sr,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.19 % Problem : LCL490+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.20 % Command : run_ET %s %d
% 0.13/0.40 % Computer : n020.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8042.1875MB
% 0.13/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 600
% 0.13/0.40 % DateTime : Mon Jul 4 03:34:15 EDT 2022
% 0.13/0.40 % CPUTime :
% 0.26/10.78 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/10.78 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/10.78 # Preprocessing time : 0.010 s
% 0.26/10.78
% 0.26/10.78 # Failure: Out of unprocessed clauses!
% 0.26/10.78 # OLD status GaveUp
% 0.26/10.78 # Parsed axioms : 45
% 0.26/10.78 # Removed by relevancy pruning/SinE : 43
% 0.26/10.78 # Initial clauses : 3
% 0.26/10.78 # Removed in clause preprocessing : 0
% 0.26/10.78 # Initial clauses in saturation : 3
% 0.26/10.78 # Processed clauses : 3
% 0.26/10.78 # ...of these trivial : 0
% 0.26/10.78 # ...subsumed : 1
% 0.26/10.78 # ...remaining for further processing : 2
% 0.26/10.78 # Other redundant clauses eliminated : 0
% 0.26/10.78 # Clauses deleted for lack of memory : 0
% 0.26/10.78 # Backward-subsumed : 0
% 0.26/10.78 # Backward-rewritten : 0
% 0.26/10.78 # Generated clauses : 0
% 0.26/10.78 # ...of the previous two non-trivial : 0
% 0.26/10.78 # Contextual simplify-reflections : 0
% 0.26/10.78 # Paramodulations : 0
% 0.26/10.78 # Factorizations : 0
% 0.26/10.78 # Equation resolutions : 0
% 0.26/10.78 # Current number of processed clauses : 2
% 0.26/10.78 # Positive orientable unit clauses : 0
% 0.26/10.78 # Positive unorientable unit clauses: 0
% 0.26/10.78 # Negative unit clauses : 2
% 0.26/10.78 # Non-unit-clauses : 0
% 0.26/10.78 # Current number of unprocessed clauses: 0
% 0.26/10.78 # ...number of literals in the above : 0
% 0.26/10.78 # Current number of archived formulas : 0
% 0.26/10.78 # Current number of archived clauses : 0
% 0.26/10.78 # Clause-clause subsumption calls (NU) : 0
% 0.26/10.78 # Rec. Clause-clause subsumption calls : 0
% 0.26/10.78 # Non-unit clause-clause subsumptions : 0
% 0.26/10.78 # Unit Clause-clause subsumption calls : 0
% 0.26/10.78 # Rewrite failures with RHS unbound : 0
% 0.26/10.78 # BW rewrite match attempts : 0
% 0.26/10.78 # BW rewrite match successes : 0
% 0.26/10.78 # Condensation attempts : 0
% 0.26/10.78 # Condensation successes : 0
% 0.26/10.78 # Termbank termtop insertions : 485
% 0.26/10.78
% 0.26/10.78 # -------------------------------------------------
% 0.26/10.78 # User time : 0.007 s
% 0.26/10.78 # System time : 0.003 s
% 0.26/10.78 # Total time : 0.010 s
% 0.26/10.78 # Maximum resident set size: 2732 pages
% 0.26/10.78 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.26/10.78 # Preprocessing time : 0.013 s
% 0.26/10.78
% 0.26/10.78 # Proof found!
% 0.26/10.78 # SZS status Theorem
% 0.26/10.78 # SZS output start CNFRefutation
% See solution above
% 0.26/10.78 # Proof object total steps : 44
% 0.26/10.78 # Proof object clause steps : 24
% 0.26/10.78 # Proof object formula steps : 20
% 0.26/10.78 # Proof object conjectures : 4
% 0.26/10.78 # Proof object clause conjectures : 1
% 0.26/10.78 # Proof object formula conjectures : 3
% 0.26/10.78 # Proof object initial clauses used : 12
% 0.26/10.78 # Proof object initial formulas used : 12
% 0.26/10.78 # Proof object generating inferences : 5
% 0.26/10.78 # Proof object simplifying inferences : 14
% 0.26/10.78 # Training examples: 0 positive, 0 negative
% 0.26/10.78 # Parsed axioms : 45
% 0.26/10.78 # Removed by relevancy pruning/SinE : 0
% 0.26/10.78 # Initial clauses : 74
% 0.26/10.78 # Removed in clause preprocessing : 0
% 0.26/10.78 # Initial clauses in saturation : 74
% 0.26/10.78 # Processed clauses : 34772
% 0.26/10.78 # ...of these trivial : 328
% 0.26/10.78 # ...subsumed : 31946
% 0.26/10.78 # ...remaining for further processing : 2498
% 0.26/10.78 # Other redundant clauses eliminated : 0
% 0.26/10.78 # Clauses deleted for lack of memory : 73973
% 0.26/10.78 # Backward-subsumed : 434
% 0.26/10.78 # Backward-rewritten : 764
% 0.26/10.78 # Generated clauses : 352714
% 0.26/10.78 # ...of the previous two non-trivial : 343770
% 0.26/10.78 # Contextual simplify-reflections : 28758
% 0.26/10.78 # Paramodulations : 352714
% 0.26/10.78 # Factorizations : 0
% 0.26/10.78 # Equation resolutions : 0
% 0.26/10.78 # Current number of processed clauses : 1300
% 0.26/10.78 # Positive orientable unit clauses : 117
% 0.26/10.78 # Positive unorientable unit clauses: 6
% 0.26/10.78 # Negative unit clauses : 18
% 0.26/10.78 # Non-unit-clauses : 1159
% 0.26/10.78 # Current number of unprocessed clauses: 79934
% 0.26/10.78 # ...number of literals in the above : 283474
% 0.26/10.78 # Current number of archived formulas : 0
% 0.26/10.78 # Current number of archived clauses : 1198
% 0.26/10.78 # Clause-clause subsumption calls (NU) : 4481820
% 0.26/10.78 # Rec. Clause-clause subsumption calls : 1480433
% 0.26/10.78 # Non-unit clause-clause subsumptions : 46534
% 0.26/10.78 # Unit Clause-clause subsumption calls : 6571
% 0.26/10.78 # Rewrite failures with RHS unbound : 0
% 0.26/10.78 # BW rewrite match attempts : 3084
% 0.26/10.78 # BW rewrite match successes : 437
% 0.26/10.78 # Condensation attempts : 0
% 0.26/10.78 # Condensation successes : 0
% 0.26/10.78 # Termbank termtop insertions : 6249162
% 0.26/10.78
% 0.26/10.78 # -------------------------------------------------
% 0.26/10.78 # User time : 7.198 s
% 0.26/10.78 # System time : 0.109 s
% 0.26/10.78 # Total time : 7.307 s
% 0.26/10.78 # Maximum resident set size: 134728 pages
% 0.26/25.83 eprover: CPU time limit exceeded, terminating
% 0.26/25.85 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/25.85 eprover: No such file or directory
% 0.26/25.85 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/25.85 eprover: No such file or directory
% 0.26/25.86 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/25.86 eprover: No such file or directory
% 0.26/25.86 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/25.86 eprover: No such file or directory
% 0.26/25.86 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/25.86 eprover: No such file or directory
% 0.26/25.87 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/25.87 eprover: No such file or directory
% 0.26/25.87 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/25.87 eprover: No such file or directory
% 0.26/25.88 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/25.88 eprover: No such file or directory
% 0.26/26.30 eprover: CPU time limit exceeded, terminating
% 0.26/26.32 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/26.32 eprover: No such file or directory
% 0.26/26.32 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/26.32 eprover: No such file or directory
% 0.26/26.33 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/26.33 eprover: No such file or directory
% 0.26/26.33 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/26.33 eprover: No such file or directory
% 0.26/26.34 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/26.34 eprover: No such file or directory
% 0.26/26.35 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/26.35 eprover: No such file or directory
% 0.26/26.35 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/26.35 eprover: No such file or directory
% 0.26/26.36 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/26.36 eprover: No such file or directory
% 0.26/26.36 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/26.36 eprover: No such file or directory
% 0.26/26.37 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/26.37 eprover: No such file or directory
% 0.26/26.38 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/26.38 eprover: No such file or directory
%------------------------------------------------------------------------------