TSTP Solution File: LCL531+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL531+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:13:03 EDT 2023
% Result : Theorem 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 42 ( 20 unt; 0 def)
% Number of atoms : 90 ( 4 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 80 ( 32 ~; 31 |; 9 &)
% ( 5 <=>; 3 =>; 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 : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(necessitation,axiom,
( necessitation
<=> ! [X1] :
( is_a_theorem(X1)
=> is_a_theorem(necessarily(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.wkqu54vTGT/E---3.1_29730.p',necessitation) ).
fof(op_strict_implies,axiom,
( op_strict_implies
=> ! [X1,X2] : strict_implies(X1,X2) = necessarily(implies(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.wkqu54vTGT/E---3.1_29730.p',op_strict_implies) ).
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.wkqu54vTGT/E---3.1_29730.p',modus_ponens) ).
fof(implies_2,axiom,
( implies_2
<=> ! [X1,X2] : is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))) ),
file('/export/starexec/sandbox/tmp/tmp.wkqu54vTGT/E---3.1_29730.p',implies_2) ).
fof(axiom_m4,axiom,
( axiom_m4
<=> ! [X1] : is_a_theorem(strict_implies(X1,and(X1,X1))) ),
file('/export/starexec/sandbox/tmp/tmp.wkqu54vTGT/E---3.1_29730.p',axiom_m4) ).
fof(s1_0_axiom_m4,conjecture,
axiom_m4,
file('/export/starexec/sandbox/tmp/tmp.wkqu54vTGT/E---3.1_29730.p',s1_0_axiom_m4) ).
fof(km5_necessitation,axiom,
necessitation,
file('/export/starexec/sandbox/tmp/tmp.wkqu54vTGT/E---3.1_29730.p',km5_necessitation) ).
fof(s1_0_op_strict_implies,axiom,
op_strict_implies,
file('/export/starexec/sandbox/tmp/tmp.wkqu54vTGT/E---3.1_29730.p',s1_0_op_strict_implies) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/tmp/tmp.wkqu54vTGT/E---3.1_29730.p',hilbert_modus_ponens) ).
fof(hilbert_implies_2,axiom,
implies_2,
file('/export/starexec/sandbox/tmp/tmp.wkqu54vTGT/E---3.1_29730.p',hilbert_implies_2) ).
fof(and_3,axiom,
( and_3
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
file('/export/starexec/sandbox/tmp/tmp.wkqu54vTGT/E---3.1_29730.p',and_3) ).
fof(hilbert_and_3,axiom,
and_3,
file('/export/starexec/sandbox/tmp/tmp.wkqu54vTGT/E---3.1_29730.p',hilbert_and_3) ).
fof(c_0_12,plain,
! [X127] :
( ( ~ necessitation
| ~ is_a_theorem(X127)
| is_a_theorem(necessarily(X127)) )
& ( is_a_theorem(esk56_0)
| necessitation )
& ( ~ is_a_theorem(necessarily(esk56_0))
| necessitation ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[necessitation])])])])]) ).
fof(c_0_13,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])])]) ).
fof(c_0_14,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_15,plain,
! [X23,X24] :
( ( ~ implies_2
| is_a_theorem(implies(implies(X23,implies(X23,X24)),implies(X23,X24))) )
& ( ~ is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0)))
| implies_2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_2])])])]) ).
fof(c_0_16,plain,
! [X183] :
( ( ~ axiom_m4
| is_a_theorem(strict_implies(X183,and(X183,X183))) )
& ( ~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0)))
| axiom_m4 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m4])])])]) ).
fof(c_0_17,negated_conjecture,
~ axiom_m4,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[s1_0_axiom_m4])]) ).
cnf(c_0_18,plain,
( is_a_theorem(necessarily(X1))
| ~ necessitation
| ~ is_a_theorem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
necessitation,
inference(split_conjunct,[status(thm)],[km5_necessitation]) ).
cnf(c_0_20,plain,
( strict_implies(X1,X2) = necessarily(implies(X1,X2))
| ~ op_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
cnf(c_0_22,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
implies_2,
inference(split_conjunct,[status(thm)],[hilbert_implies_2]) ).
fof(c_0_26,plain,
! [X41,X42] :
( ( ~ and_3
| is_a_theorem(implies(X41,implies(X42,and(X41,X42)))) )
& ( ~ 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_3])])])]) ).
cnf(c_0_27,plain,
( axiom_m4
| ~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,negated_conjecture,
~ axiom_m4,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,plain,
( is_a_theorem(necessarily(X1))
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_30,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_31,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_22,c_0_23])]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
and_3,
inference(split_conjunct,[status(thm)],[hilbert_and_3]) ).
cnf(c_0_35,plain,
~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0))),
inference(sr,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,plain,
( is_a_theorem(strict_implies(X1,X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_39,plain,
~ is_a_theorem(implies(esk84_0,and(esk84_0,esk84_0))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : LCL531+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 12:26:46 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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.wkqu54vTGT/E---3.1_29730.p
% 0.16/0.47 # Version: 3.1pre001
% 0.16/0.47 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 29808 completed with status 0
% 0.16/0.47 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.16/0.47 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.16/0.47 # No SInE strategy applied
% 0.16/0.47 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.16/0.47 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 675s (1) cores
% 0.16/0.47 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.16/0.47 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.16/0.47 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.47 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.16/0.47 # U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 29822 completed with status 0
% 0.16/0.47 # Result found by U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.47 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.16/0.47 # No SInE strategy applied
% 0.16/0.47 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.16/0.47 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 675s (1) cores
% 0.16/0.47 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.16/0.47 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.16/0.47 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.47 # Preprocessing time : 0.002 s
% 0.16/0.47 # Presaturation interreduction done
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Theorem
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 88
% 0.16/0.47 # Removed by relevancy pruning/SinE : 0
% 0.16/0.47 # Initial clauses : 146
% 0.16/0.47 # Removed in clause preprocessing : 0
% 0.16/0.47 # Initial clauses in saturation : 146
% 0.16/0.47 # Processed clauses : 320
% 0.16/0.47 # ...of these trivial : 35
% 0.16/0.47 # ...subsumed : 2
% 0.16/0.47 # ...remaining for further processing : 283
% 0.16/0.47 # Other redundant clauses eliminated : 0
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 0
% 0.16/0.47 # Backward-rewritten : 21
% 0.16/0.47 # Generated clauses : 135
% 0.16/0.47 # ...of the previous two non-redundant : 133
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 2
% 0.16/0.47 # Paramodulations : 135
% 0.16/0.47 # Factorizations : 0
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 0
% 0.16/0.47 # Total rewrite steps : 150
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 149
% 0.16/0.47 # Positive orientable unit clauses : 62
% 0.16/0.47 # Positive unorientable unit clauses: 0
% 0.16/0.47 # Negative unit clauses : 4
% 0.16/0.47 # Non-unit-clauses : 83
% 0.16/0.47 # Current number of unprocessed clauses: 71
% 0.16/0.47 # ...number of literals in the above : 105
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 134
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 2082
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 939
% 0.16/0.47 # Non-unit clause-clause subsumptions : 3
% 0.16/0.47 # Unit Clause-clause subsumption calls : 317
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 97
% 0.16/0.47 # BW rewrite match successes : 13
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 9670
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.017 s
% 0.16/0.47 # System time : 0.007 s
% 0.16/0.47 # Total time : 0.024 s
% 0.16/0.47 # Maximum resident set size: 2252 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.083 s
% 0.16/0.47 # System time : 0.013 s
% 0.16/0.47 # Total time : 0.096 s
% 0.16/0.47 # Maximum resident set size: 1764 pages
% 0.16/0.47 % E---3.1 exiting
% 0.16/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------