TSTP Solution File: LCL459+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL459+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:24:58 EDT 2023
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 14 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 55 ( 22 ~; 21 |; 7 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 5 prp; 0-1 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 29 ( 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/sandbox2/tmp/tmp.3URaRVGQFN/E---3.1_19730.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/sandbox2/tmp/tmp.3URaRVGQFN/E---3.1_19730.p',implies_2) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/tmp/tmp.3URaRVGQFN/E---3.1_19730.p',hilbert_modus_ponens) ).
fof(hilbert_implies_2,axiom,
implies_2,
file('/export/starexec/sandbox2/tmp/tmp.3URaRVGQFN/E---3.1_19730.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/sandbox2/tmp/tmp.3URaRVGQFN/E---3.1_19730.p',and_3) ).
fof(kn1,axiom,
( kn1
<=> ! [X4] : is_a_theorem(implies(X4,and(X4,X4))) ),
file('/export/starexec/sandbox2/tmp/tmp.3URaRVGQFN/E---3.1_19730.p',kn1) ).
fof(rosser_kn1,conjecture,
kn1,
file('/export/starexec/sandbox2/tmp/tmp.3URaRVGQFN/E---3.1_19730.p',rosser_kn1) ).
fof(hilbert_and_3,axiom,
and_3,
file('/export/starexec/sandbox2/tmp/tmp.3URaRVGQFN/E---3.1_19730.p',hilbert_and_3) ).
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,
! [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])])])]) ).
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(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
implies_2,
inference(split_conjunct,[status(thm)],[hilbert_implies_2]) ).
fof(c_0_14,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])])])]) ).
fof(c_0_15,plain,
! [X71] :
( ( ~ kn1
| is_a_theorem(implies(X71,and(X71,X71))) )
& ( ~ is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0)))
| kn1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn1])])])]) ).
fof(c_0_16,negated_conjecture,
~ kn1,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[rosser_kn1])]) ).
cnf(c_0_17,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_18,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
and_3,
inference(split_conjunct,[status(thm)],[hilbert_and_3]) ).
cnf(c_0_21,plain,
( kn1
| ~ is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
~ kn1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_25,plain,
~ is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0))),
inference(sr,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : LCL459+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 11:56:06 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.3URaRVGQFN/E---3.1_19730.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 19807 completed with status 0
% 0.16/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.16/0.44 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.16/0.44 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.16/0.44 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.16/0.44 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.44 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 151s (1) cores
% 0.16/0.44 # U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 19821 completed with status 0
% 0.16/0.44 # Result found by U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.16/0.44 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.16/0.44 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.16/0.44 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.44 # Preprocessing time : 0.003 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 53
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 82
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 82
% 0.16/0.44 # Processed clauses : 167
% 0.16/0.44 # ...of these trivial : 31
% 0.16/0.44 # ...subsumed : 4
% 0.16/0.44 # ...remaining for further processing : 132
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 3
% 0.16/0.44 # Generated clauses : 132
% 0.16/0.44 # ...of the previous two non-redundant : 109
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 132
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Total rewrite steps : 116
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 75
% 0.16/0.44 # Positive orientable unit clauses : 42
% 0.16/0.44 # Positive unorientable unit clauses: 2
% 0.16/0.44 # Negative unit clauses : 3
% 0.16/0.44 # Non-unit-clauses : 28
% 0.16/0.44 # Current number of unprocessed clauses: 78
% 0.16/0.44 # ...number of literals in the above : 117
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 57
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 40
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 40
% 0.16/0.44 # Non-unit clause-clause subsumptions : 3
% 0.16/0.44 # Unit Clause-clause subsumption calls : 41
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 85
% 0.16/0.44 # BW rewrite match successes : 5
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 5627
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.011 s
% 0.16/0.44 # System time : 0.004 s
% 0.16/0.44 # Total time : 0.015 s
% 0.16/0.44 # Maximum resident set size: 2000 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.039 s
% 0.16/0.44 # System time : 0.018 s
% 0.16/0.44 # Total time : 0.057 s
% 0.16/0.44 # Maximum resident set size: 1724 pages
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------