TSTP Solution File: LCL542+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL542+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:05 EDT 2023
% Result : Theorem 0.24s 0.56s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 13 unt; 0 def)
% Number of atoms : 52 ( 4 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 43 ( 18 ~; 16 |; 4 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 26 ( 2 sgn; 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(necessitation,axiom,
( necessitation
<=> ! [X1] :
( is_a_theorem(X1)
=> is_a_theorem(necessarily(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.o5kxAmaz9T/E---3.1_14199.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.o5kxAmaz9T/E---3.1_14199.p',op_strict_implies) ).
fof(axiom_m2,axiom,
( axiom_m2
<=> ! [X1,X2] : is_a_theorem(strict_implies(and(X1,X2),X1)) ),
file('/export/starexec/sandbox/tmp/tmp.o5kxAmaz9T/E---3.1_14199.p',axiom_m2) ).
fof(s1_0_axiom_m2,conjecture,
axiom_m2,
file('/export/starexec/sandbox/tmp/tmp.o5kxAmaz9T/E---3.1_14199.p',s1_0_axiom_m2) ).
fof(km4b_necessitation,axiom,
necessitation,
file('/export/starexec/sandbox/tmp/tmp.o5kxAmaz9T/E---3.1_14199.p',km4b_necessitation) ).
fof(s1_0_op_strict_implies,axiom,
op_strict_implies,
file('/export/starexec/sandbox/tmp/tmp.o5kxAmaz9T/E---3.1_14199.p',s1_0_op_strict_implies) ).
fof(and_1,axiom,
( and_1
<=> ! [X1,X2] : is_a_theorem(implies(and(X1,X2),X1)) ),
file('/export/starexec/sandbox/tmp/tmp.o5kxAmaz9T/E---3.1_14199.p',and_1) ).
fof(hilbert_and_1,axiom,
and_1,
file('/export/starexec/sandbox/tmp/tmp.o5kxAmaz9T/E---3.1_14199.p',hilbert_and_1) ).
fof(c_0_8,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_9,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_10,plain,
! [X173,X174] :
( ( ~ axiom_m2
| is_a_theorem(strict_implies(and(X173,X174),X173)) )
& ( ~ is_a_theorem(strict_implies(and(esk79_0,esk80_0),esk79_0))
| axiom_m2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m2])])])]) ).
fof(c_0_11,negated_conjecture,
~ axiom_m2,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[s1_0_axiom_m2])]) ).
cnf(c_0_12,plain,
( is_a_theorem(necessarily(X1))
| ~ necessitation
| ~ is_a_theorem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
necessitation,
inference(split_conjunct,[status(thm)],[km4b_necessitation]) ).
cnf(c_0_14,plain,
( strict_implies(X1,X2) = necessarily(implies(X1,X2))
| ~ op_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
fof(c_0_16,plain,
! [X33,X34] :
( ( ~ and_1
| is_a_theorem(implies(and(X33,X34),X33)) )
& ( ~ is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0))
| and_1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_1])])])]) ).
cnf(c_0_17,plain,
( axiom_m2
| ~ is_a_theorem(strict_implies(and(esk79_0,esk80_0),esk79_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
~ axiom_m2,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( is_a_theorem(necessarily(X1))
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_20,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ and_1 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
and_1,
inference(split_conjunct,[status(thm)],[hilbert_and_1]) ).
cnf(c_0_23,plain,
~ is_a_theorem(strict_implies(and(esk79_0,esk80_0),esk79_0)),
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( is_a_theorem(strict_implies(X1,X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_26,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : LCL542+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n029.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 12:11:51 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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.o5kxAmaz9T/E---3.1_14199.p
% 0.24/0.56 # Version: 3.1pre001
% 0.24/0.56 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.24/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.24/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.56 # Starting sh5l with 300s (1) cores
% 0.24/0.56 # H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 14277 completed with status 0
% 0.24/0.56 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.24/0.56 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.24/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.24/0.56 # No SInE strategy applied
% 0.24/0.56 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.24/0.56 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 675s (1) cores
% 0.24/0.56 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.24/0.56 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.24/0.56 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/0.56 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.24/0.56 # U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 14289 completed with status 0
% 0.24/0.56 # Result found by U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.56 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.24/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.24/0.56 # No SInE strategy applied
% 0.24/0.56 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.24/0.56 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 675s (1) cores
% 0.24/0.56 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.24/0.56 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.24/0.56 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/0.56 # Preprocessing time : 0.002 s
% 0.24/0.56 # Presaturation interreduction done
% 0.24/0.56
% 0.24/0.56 # Proof found!
% 0.24/0.56 # SZS status Theorem
% 0.24/0.56 # SZS output start CNFRefutation
% See solution above
% 0.24/0.56 # Parsed axioms : 89
% 0.24/0.56 # Removed by relevancy pruning/SinE : 0
% 0.24/0.56 # Initial clauses : 147
% 0.24/0.56 # Removed in clause preprocessing : 0
% 0.24/0.56 # Initial clauses in saturation : 147
% 0.24/0.56 # Processed clauses : 266
% 0.24/0.56 # ...of these trivial : 36
% 0.24/0.56 # ...subsumed : 1
% 0.24/0.56 # ...remaining for further processing : 229
% 0.24/0.56 # Other redundant clauses eliminated : 0
% 0.24/0.56 # Clauses deleted for lack of memory : 0
% 0.24/0.56 # Backward-subsumed : 0
% 0.24/0.56 # Backward-rewritten : 6
% 0.24/0.56 # Generated clauses : 71
% 0.24/0.56 # ...of the previous two non-redundant : 68
% 0.24/0.56 # ...aggressively subsumed : 0
% 0.24/0.56 # Contextual simplify-reflections : 0
% 0.24/0.56 # Paramodulations : 71
% 0.24/0.56 # Factorizations : 0
% 0.24/0.56 # NegExts : 0
% 0.24/0.56 # Equation resolutions : 0
% 0.24/0.56 # Total rewrite steps : 134
% 0.24/0.56 # Propositional unsat checks : 0
% 0.24/0.56 # Propositional check models : 0
% 0.24/0.56 # Propositional check unsatisfiable : 0
% 0.24/0.56 # Propositional clauses : 0
% 0.24/0.56 # Propositional clauses after purity: 0
% 0.24/0.56 # Propositional unsat core size : 0
% 0.24/0.56 # Propositional preprocessing time : 0.000
% 0.24/0.56 # Propositional encoding time : 0.000
% 0.24/0.56 # Propositional solver time : 0.000
% 0.24/0.56 # Success case prop preproc time : 0.000
% 0.24/0.56 # Success case prop encoding time : 0.000
% 0.24/0.56 # Success case prop solver time : 0.000
% 0.24/0.56 # Current number of processed clauses : 110
% 0.24/0.56 # Positive orientable unit clauses : 58
% 0.24/0.56 # Positive unorientable unit clauses: 0
% 0.24/0.56 # Negative unit clauses : 2
% 0.24/0.56 # Non-unit-clauses : 50
% 0.24/0.56 # Current number of unprocessed clauses: 53
% 0.24/0.56 # ...number of literals in the above : 69
% 0.24/0.56 # Current number of archived formulas : 0
% 0.24/0.56 # Current number of archived clauses : 119
% 0.24/0.56 # Clause-clause subsumption calls (NU) : 1312
% 0.24/0.56 # Rec. Clause-clause subsumption calls : 563
% 0.24/0.56 # Non-unit clause-clause subsumptions : 0
% 0.24/0.56 # Unit Clause-clause subsumption calls : 132
% 0.24/0.56 # Rewrite failures with RHS unbound : 0
% 0.24/0.56 # BW rewrite match attempts : 42
% 0.24/0.56 # BW rewrite match successes : 6
% 0.24/0.56 # Condensation attempts : 0
% 0.24/0.56 # Condensation successes : 0
% 0.24/0.56 # Termbank termtop insertions : 9034
% 0.24/0.56
% 0.24/0.56 # -------------------------------------------------
% 0.24/0.56 # User time : 0.015 s
% 0.24/0.56 # System time : 0.004 s
% 0.24/0.56 # Total time : 0.020 s
% 0.24/0.56 # Maximum resident set size: 2256 pages
% 0.24/0.56
% 0.24/0.56 # -------------------------------------------------
% 0.24/0.56 # User time : 0.059 s
% 0.24/0.56 # System time : 0.015 s
% 0.24/0.56 # Total time : 0.075 s
% 0.24/0.56 # Maximum resident set size: 1768 pages
% 0.24/0.56 % E---3.1 exiting
% 0.24/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------