TSTP Solution File: LCL456+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL456+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:12:49 EDT 2023
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 43 ( 25 unt; 0 def)
% Number of atoms : 65 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 39 ( 17 ~; 14 |; 2 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox/tmp/tmp.8Xs2XazSsH/E---3.1_15363.p',op_implies_or) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox/tmp/tmp.8Xs2XazSsH/E---3.1_15363.p',op_implies_and) ).
fof(op_and,axiom,
( op_and
=> ! [X1,X2] : and(X1,X2) = not(or(not(X1),not(X2))) ),
file('/export/starexec/sandbox/tmp/tmp.8Xs2XazSsH/E---3.1_15363.p',op_and) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox/tmp/tmp.8Xs2XazSsH/E---3.1_15363.p',principia_op_implies_or) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox/tmp/tmp.8Xs2XazSsH/E---3.1_15363.p',op_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/tmp/tmp.8Xs2XazSsH/E---3.1_15363.p',hilbert_op_implies_and) ).
fof(principia_op_and,axiom,
op_and,
file('/export/starexec/sandbox/tmp/tmp.8Xs2XazSsH/E---3.1_15363.p',principia_op_and) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox/tmp/tmp.8Xs2XazSsH/E---3.1_15363.p',hilbert_op_or) ).
fof(modus_tollens,axiom,
( modus_tollens
<=> ! [X1,X2] : is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))) ),
file('/export/starexec/sandbox/tmp/tmp.8Xs2XazSsH/E---3.1_15363.p',modus_tollens) ).
fof(hilbert_modus_tollens,axiom,
modus_tollens,
file('/export/starexec/sandbox/tmp/tmp.8Xs2XazSsH/E---3.1_15363.p',hilbert_modus_tollens) ).
fof(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox/tmp/tmp.8Xs2XazSsH/E---3.1_15363.p',r3) ).
fof(principia_r3,conjecture,
r3,
file('/export/starexec/sandbox/tmp/tmp.8Xs2XazSsH/E---3.1_15363.p',principia_r3) ).
fof(c_0_12,plain,
! [X123,X124] :
( ~ op_implies_or
| implies(X123,X124) = or(not(X123),X124) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])]) ).
fof(c_0_13,plain,
! [X121,X122] :
( ~ op_implies_and
| implies(X121,X122) = not(and(X121,not(X122))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])]) ).
fof(c_0_14,plain,
! [X119,X120] :
( ~ op_and
| and(X119,X120) = not(or(not(X119),not(X120))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_and])])]) ).
cnf(c_0_15,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
fof(c_0_17,plain,
! [X117,X118] :
( ~ op_or
| or(X117,X118) = not(and(not(X117),not(X118))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])]) ).
cnf(c_0_18,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
cnf(c_0_20,plain,
( and(X1,X2) = not(or(not(X1),not(X2)))
| ~ op_and ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_22,plain,
op_and,
inference(split_conjunct,[status(thm)],[principia_op_and]) ).
cnf(c_0_23,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_25,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
fof(c_0_26,plain,
! [X15,X16] :
( ( ~ modus_tollens
| is_a_theorem(implies(implies(not(X16),not(X15)),implies(X15,X16))) )
& ( ~ 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_tollens])])])]) ).
cnf(c_0_27,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_28,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))
| ~ modus_tollens ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,plain,
modus_tollens,
inference(split_conjunct,[status(thm)],[hilbert_modus_tollens]) ).
cnf(c_0_31,plain,
not(or(X1,not(X2))) = and(not(X1),X2),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_32,plain,
! [X101,X102] :
( ( ~ r3
| is_a_theorem(implies(or(X101,X102),or(X102,X101))) )
& ( ~ 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r3])])])]) ).
fof(c_0_33,negated_conjecture,
~ r3,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[principia_r3])]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_28]),c_0_30])]) ).
cnf(c_0_35,plain,
implies(or(X1,not(X2)),X3) = or(and(not(X1),X2),X3),
inference(spm,[status(thm)],[c_0_21,c_0_31]) ).
cnf(c_0_36,plain,
( r3
| ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0))) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
~ r3,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
is_a_theorem(or(and(not(X1),X2),implies(X2,X1))),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
or(and(X1,not(X2)),X3) = implies(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_40,plain,
~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0))),
inference(sr,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_28]),c_0_39]),c_0_28]) ).
cnf(c_0_42,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL456+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 12:47:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.8Xs2XazSsH/E---3.1_15363.p
% 0.19/0.50 # Version: 3.1pre001
% 0.19/0.50 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 15441 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.19/0.50 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.19/0.50 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.19/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.19/0.50 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.50 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 151s (1) cores
% 0.19/0.50 # H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 15456 completed with status 0
% 0.19/0.50 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.19/0.50 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.19/0.50 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.19/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.19/0.50 # Preprocessing time : 0.002 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 53
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 82
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 82
% 0.19/0.50 # Processed clauses : 191
% 0.19/0.50 # ...of these trivial : 27
% 0.19/0.50 # ...subsumed : 11
% 0.19/0.50 # ...remaining for further processing : 153
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 4
% 0.19/0.50 # Generated clauses : 416
% 0.19/0.50 # ...of the previous two non-redundant : 333
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 416
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Total rewrite steps : 268
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 91
% 0.19/0.50 # Positive orientable unit clauses : 63
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 4
% 0.19/0.50 # Non-unit-clauses : 24
% 0.19/0.50 # Current number of unprocessed clauses: 275
% 0.19/0.50 # ...number of literals in the above : 357
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 62
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 147
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 147
% 0.19/0.50 # Non-unit clause-clause subsumptions : 10
% 0.19/0.50 # Unit Clause-clause subsumption calls : 28
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 34
% 0.19/0.50 # BW rewrite match successes : 4
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 8382
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.016 s
% 0.19/0.50 # System time : 0.003 s
% 0.19/0.50 # Total time : 0.019 s
% 0.19/0.50 # Maximum resident set size: 1964 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.057 s
% 0.19/0.50 # System time : 0.014 s
% 0.19/0.50 # Total time : 0.071 s
% 0.19/0.50 # Maximum resident set size: 1724 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------