TSTP Solution File: LCL496+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL496+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:56 EDT 2023
% Result : Theorem 0.17s 0.51s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 37 ( 20 unt; 0 def)
% Number of atoms : 73 ( 4 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 60 ( 24 ~; 23 |; 7 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn; 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(r4,axiom,
( r4
<=> ! [X4,X5,X6] : is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6)))) ),
file('/export/starexec/sandbox/tmp/tmp.5DAqSMOrBL/E---3.1_12490.p',r4) ).
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox/tmp/tmp.5DAqSMOrBL/E---3.1_12490.p',op_implies_or) ).
fof(principia_r4,axiom,
r4,
file('/export/starexec/sandbox/tmp/tmp.5DAqSMOrBL/E---3.1_12490.p',principia_r4) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox/tmp/tmp.5DAqSMOrBL/E---3.1_12490.p',principia_op_implies_or) ).
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/tmp/tmp.5DAqSMOrBL/E---3.1_12490.p',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/sandbox/tmp/tmp.5DAqSMOrBL/E---3.1_12490.p',r5) ).
fof(principia_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/tmp/tmp.5DAqSMOrBL/E---3.1_12490.p',principia_modus_ponens) ).
fof(principia_r5,axiom,
r5,
file('/export/starexec/sandbox/tmp/tmp.5DAqSMOrBL/E---3.1_12490.p',principia_r5) ).
fof(cn1,axiom,
( cn1
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))) ),
file('/export/starexec/sandbox/tmp/tmp.5DAqSMOrBL/E---3.1_12490.p',cn1) ).
fof(luka_cn1,conjecture,
cn1,
file('/export/starexec/sandbox/tmp/tmp.5DAqSMOrBL/E---3.1_12490.p',luka_cn1) ).
fof(c_0_10,plain,
! [X105,X106,X107] :
( ( ~ r4
| is_a_theorem(implies(or(X105,or(X106,X107)),or(X106,or(X105,X107)))) )
& ( ~ is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0))))
| r4 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r4])])])]) ).
fof(c_0_11,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])])]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))
| ~ r4 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
r4,
inference(split_conjunct,[status(thm)],[principia_r4]) ).
cnf(c_0_14,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
fof(c_0_16,plain,
! [X7,X8] :
( ( ~ modus_ponens
| ~ is_a_theorem(X7)
| ~ is_a_theorem(implies(X7,X8))
| is_a_theorem(X8) )
& ( 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_18,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
fof(c_0_19,plain,
! [X111,X112,X113] :
( ( ~ r5
| is_a_theorem(implies(implies(X112,X113),implies(or(X111,X112),or(X111,X113)))) )
& ( ~ 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r5])])])]) ).
cnf(c_0_20,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[principia_modus_ponens]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(X1,or(X2,X3)),or(X2,implies(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
r5,
inference(split_conjunct,[status(thm)],[principia_r5]) ).
fof(c_0_25,plain,
! [X83,X84,X85] :
( ( ~ cn1
| is_a_theorem(implies(implies(X83,X84),implies(implies(X84,X85),implies(X83,X85)))) )
& ( ~ is_a_theorem(implies(implies(esk39_0,esk40_0),implies(implies(esk40_0,esk41_0),implies(esk39_0,esk41_0))))
| cn1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn1])])])]) ).
fof(c_0_26,negated_conjecture,
~ cn1,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[luka_cn1])]) ).
cnf(c_0_27,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_20,c_0_21])]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_18]),c_0_18]) ).
cnf(c_0_29,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_23,c_0_24])]) ).
cnf(c_0_30,plain,
( cn1
| ~ is_a_theorem(implies(implies(esk39_0,esk40_0),implies(implies(esk40_0,esk41_0),implies(esk39_0,esk41_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
~ cn1,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_18]),c_0_18]) ).
cnf(c_0_34,plain,
~ is_a_theorem(implies(implies(esk39_0,esk40_0),implies(implies(esk40_0,esk41_0),implies(esk39_0,esk41_0)))),
inference(sr,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : LCL496+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n032.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 11:57:19 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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.5DAqSMOrBL/E---3.1_12490.p
% 0.17/0.51 # Version: 3.1pre001
% 0.17/0.51 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.17/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.51 # Starting sh5l with 300s (1) cores
% 0.17/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 12606 completed with status 0
% 0.17/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.17/0.51 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.17/0.51 # No SInE strategy applied
% 0.17/0.51 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.17/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.17/0.51 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.17/0.51 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.17/0.51 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.51 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 151s (1) cores
% 0.17/0.51 # U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 12620 completed with status 0
% 0.17/0.51 # Result found by U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.51 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.17/0.51 # No SInE strategy applied
% 0.17/0.51 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.17/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.17/0.51 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.17/0.51 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.17/0.51 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.51 # Preprocessing time : 0.003 s
% 0.17/0.51 # Presaturation interreduction done
% 0.17/0.51
% 0.17/0.51 # Proof found!
% 0.17/0.51 # SZS status Theorem
% 0.17/0.51 # SZS output start CNFRefutation
% See solution above
% 0.17/0.51 # Parsed axioms : 45
% 0.17/0.51 # Removed by relevancy pruning/SinE : 0
% 0.17/0.51 # Initial clauses : 74
% 0.17/0.51 # Removed in clause preprocessing : 0
% 0.17/0.51 # Initial clauses in saturation : 74
% 0.17/0.51 # Processed clauses : 544
% 0.17/0.51 # ...of these trivial : 58
% 0.17/0.51 # ...subsumed : 164
% 0.17/0.51 # ...remaining for further processing : 322
% 0.17/0.51 # Other redundant clauses eliminated : 0
% 0.17/0.51 # Clauses deleted for lack of memory : 0
% 0.17/0.51 # Backward-subsumed : 1
% 0.17/0.51 # Backward-rewritten : 10
% 0.17/0.51 # Generated clauses : 1941
% 0.17/0.51 # ...of the previous two non-redundant : 1662
% 0.17/0.51 # ...aggressively subsumed : 0
% 0.17/0.51 # Contextual simplify-reflections : 0
% 0.17/0.51 # Paramodulations : 1941
% 0.17/0.51 # Factorizations : 0
% 0.17/0.51 # NegExts : 0
% 0.17/0.51 # Equation resolutions : 0
% 0.17/0.51 # Total rewrite steps : 681
% 0.17/0.51 # Propositional unsat checks : 0
% 0.17/0.51 # Propositional check models : 0
% 0.17/0.51 # Propositional check unsatisfiable : 0
% 0.17/0.51 # Propositional clauses : 0
% 0.17/0.51 # Propositional clauses after purity: 0
% 0.17/0.51 # Propositional unsat core size : 0
% 0.17/0.51 # Propositional preprocessing time : 0.000
% 0.17/0.51 # Propositional encoding time : 0.000
% 0.17/0.51 # Propositional solver time : 0.000
% 0.17/0.51 # Success case prop preproc time : 0.000
% 0.17/0.51 # Success case prop encoding time : 0.000
% 0.17/0.51 # Success case prop solver time : 0.000
% 0.17/0.51 # Current number of processed clauses : 250
% 0.17/0.51 # Positive orientable unit clauses : 88
% 0.17/0.51 # Positive unorientable unit clauses: 2
% 0.17/0.51 # Negative unit clauses : 4
% 0.17/0.51 # Non-unit-clauses : 156
% 0.17/0.51 # Current number of unprocessed clauses: 1250
% 0.17/0.51 # ...number of literals in the above : 1952
% 0.17/0.51 # Current number of archived formulas : 0
% 0.17/0.51 # Current number of archived clauses : 72
% 0.17/0.51 # Clause-clause subsumption calls (NU) : 3528
% 0.17/0.51 # Rec. Clause-clause subsumption calls : 3517
% 0.17/0.51 # Non-unit clause-clause subsumptions : 161
% 0.17/0.51 # Unit Clause-clause subsumption calls : 248
% 0.17/0.51 # Rewrite failures with RHS unbound : 0
% 0.17/0.51 # BW rewrite match attempts : 841
% 0.17/0.51 # BW rewrite match successes : 11
% 0.17/0.51 # Condensation attempts : 0
% 0.17/0.51 # Condensation successes : 0
% 0.17/0.51 # Termbank termtop insertions : 33970
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.026 s
% 0.17/0.51 # System time : 0.007 s
% 0.17/0.51 # Total time : 0.034 s
% 0.17/0.51 # Maximum resident set size: 1956 pages
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.278 s
% 0.17/0.51 # System time : 0.035 s
% 0.17/0.51 # Total time : 0.313 s
% 0.17/0.51 # Maximum resident set size: 1724 pages
% 0.17/0.51 % E---3.1 exiting
% 0.17/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------