TSTP Solution File: LCL538+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL538+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:25:13 EDT 2023
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 16 unt; 0 def)
% Number of atoms : 75 ( 4 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 66 ( 24 ~; 27 |; 9 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn; 14 !; 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/tmp/tmp.1VCyLitIMK/E---3.1_1174.p',modus_ponens) ).
fof(axiom_M,axiom,
( axiom_M
<=> ! [X1] : is_a_theorem(implies(necessarily(X1),X1)) ),
file('/export/starexec/sandbox/tmp/tmp.1VCyLitIMK/E---3.1_1174.p',axiom_M) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/tmp/tmp.1VCyLitIMK/E---3.1_1174.p',hilbert_modus_ponens) ).
fof(km4b_axiom_M,axiom,
axiom_M,
file('/export/starexec/sandbox/tmp/tmp.1VCyLitIMK/E---3.1_1174.p',km4b_axiom_M) ).
fof(op_strict_implies,axiom,
( op_strict_implies
=> ! [X1,X2] : strict_implies(X1,X2) = necessarily(implies(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.1VCyLitIMK/E---3.1_1174.p',op_strict_implies) ).
fof(s1_0_op_strict_implies,axiom,
op_strict_implies,
file('/export/starexec/sandbox/tmp/tmp.1VCyLitIMK/E---3.1_1174.p',s1_0_op_strict_implies) ).
fof(modus_ponens_strict_implies,axiom,
( modus_ponens_strict_implies
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(strict_implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.1VCyLitIMK/E---3.1_1174.p',modus_ponens_strict_implies) ).
fof(s1_0_modus_ponens_strict_implies,conjecture,
modus_ponens_strict_implies,
file('/export/starexec/sandbox/tmp/tmp.1VCyLitIMK/E---3.1_1174.p',s1_0_modus_ponens_strict_implies) ).
fof(c_0_8,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])])])])]) ).
fof(c_0_9,plain,
! [X145] :
( ( ~ axiom_M
| is_a_theorem(implies(necessarily(X145),X145)) )
& ( ~ is_a_theorem(implies(necessarily(esk65_0),esk65_0))
| axiom_M ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_M])])])]) ).
cnf(c_0_10,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(necessarily(X1),X1))
| ~ axiom_M ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
axiom_M,
inference(split_conjunct,[status(thm)],[km4b_axiom_M]) ).
fof(c_0_14,plain,
! [X207,X208] :
( ~ op_strict_implies
| strict_implies(X207,X208) = necessarily(implies(X207,X208)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_strict_implies])])]) ).
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_10,c_0_11])]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(necessarily(X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_17,plain,
( strict_implies(X1,X2) = necessarily(implies(X1,X2))
| ~ op_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
fof(c_0_19,plain,
! [X129,X130] :
( ( ~ modus_ponens_strict_implies
| ~ is_a_theorem(X129)
| ~ is_a_theorem(strict_implies(X129,X130))
| is_a_theorem(X130) )
& ( is_a_theorem(esk57_0)
| modus_ponens_strict_implies )
& ( is_a_theorem(strict_implies(esk57_0,esk58_0))
| modus_ponens_strict_implies )
& ( ~ is_a_theorem(esk58_0)
| modus_ponens_strict_implies ) ),
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_strict_implies])])])])]) ).
fof(c_0_20,negated_conjecture,
~ modus_ponens_strict_implies,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[s1_0_modus_ponens_strict_implies])]) ).
cnf(c_0_21,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(necessarily(X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_23,plain,
( is_a_theorem(strict_implies(esk57_0,esk58_0))
| modus_ponens_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
~ modus_ponens_strict_implies,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(strict_implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
is_a_theorem(strict_implies(esk57_0,esk58_0)),
inference(sr,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( is_a_theorem(esk57_0)
| modus_ponens_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
( modus_ponens_strict_implies
| ~ is_a_theorem(esk58_0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(esk57_0,esk58_0)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
is_a_theorem(esk57_0),
inference(sr,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_31,plain,
~ is_a_theorem(esk58_0),
inference(sr,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_29]),c_0_30])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL538+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.09/0.31 % Computer : n011.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 2400
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Mon Oct 2 13:06:23 EDT 2023
% 0.15/0.31 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.1VCyLitIMK/E---3.1_1174.p
% 0.16/0.46 # Version: 3.1pre001
% 0.16/0.46 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 1251 completed with status 0
% 0.16/0.46 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.16/0.46 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.16/0.46 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 675s (1) cores
% 0.16/0.46 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.16/0.46 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.16/0.46 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.46 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.16/0.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 1259 completed with status 0
% 0.16/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.16/0.46 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.16/0.46 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 675s (1) cores
% 0.16/0.46 # Preprocessing time : 0.002 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Theorem
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 89
% 0.16/0.46 # Removed by relevancy pruning/SinE : 0
% 0.16/0.46 # Initial clauses : 147
% 0.16/0.46 # Removed in clause preprocessing : 0
% 0.16/0.46 # Initial clauses in saturation : 147
% 0.16/0.46 # Processed clauses : 235
% 0.16/0.46 # ...of these trivial : 30
% 0.16/0.46 # ...subsumed : 1
% 0.16/0.46 # ...remaining for further processing : 204
% 0.16/0.46 # Other redundant clauses eliminated : 0
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 0
% 0.16/0.46 # Backward-rewritten : 3
% 0.16/0.46 # Generated clauses : 27
% 0.16/0.46 # ...of the previous two non-redundant : 28
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 0
% 0.16/0.46 # Paramodulations : 27
% 0.16/0.46 # Factorizations : 0
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 0
% 0.16/0.46 # Total rewrite steps : 75
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 85
% 0.16/0.46 # Positive orientable unit clauses : 37
% 0.16/0.46 # Positive unorientable unit clauses: 0
% 0.16/0.46 # Negative unit clauses : 2
% 0.16/0.46 # Non-unit-clauses : 46
% 0.16/0.46 # Current number of unprocessed clauses: 56
% 0.16/0.46 # ...number of literals in the above : 98
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 119
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 954
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 375
% 0.16/0.46 # Non-unit clause-clause subsumptions : 0
% 0.16/0.46 # Unit Clause-clause subsumption calls : 102
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 31
% 0.16/0.46 # BW rewrite match successes : 4
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 8132
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.013 s
% 0.16/0.46 # System time : 0.005 s
% 0.16/0.46 # Total time : 0.018 s
% 0.16/0.46 # Maximum resident set size: 2256 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.048 s
% 0.16/0.46 # System time : 0.014 s
% 0.16/0.46 # Total time : 0.063 s
% 0.16/0.46 # Maximum resident set size: 1768 pages
% 0.16/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------