TSTP Solution File: LCL452+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL452+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:57 EDT 2023
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 41 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 28 ( 12 ~; 10 |; 2 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 2 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.n5wH50UR9Y/E---3.1_26292.p',op_implies_and) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.n5wH50UR9Y/E---3.1_26292.p',op_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox2/tmp/tmp.n5wH50UR9Y/E---3.1_26292.p',hilbert_op_implies_and) ).
fof(or_1,axiom,
( or_1
<=> ! [X1,X2] : is_a_theorem(implies(X1,or(X1,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.n5wH50UR9Y/E---3.1_26292.p',or_1) ).
fof(cn2,axiom,
( cn2
<=> ! [X4,X5] : is_a_theorem(implies(X4,implies(not(X4),X5))) ),
file('/export/starexec/sandbox2/tmp/tmp.n5wH50UR9Y/E---3.1_26292.p',cn2) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/tmp/tmp.n5wH50UR9Y/E---3.1_26292.p',hilbert_op_or) ).
fof(hilbert_or_1,axiom,
or_1,
file('/export/starexec/sandbox2/tmp/tmp.n5wH50UR9Y/E---3.1_26292.p',hilbert_or_1) ).
fof(luka_cn2,conjecture,
cn2,
file('/export/starexec/sandbox2/tmp/tmp.n5wH50UR9Y/E---3.1_26292.p',luka_cn2) ).
fof(c_0_8,plain,
! [X121,X122] :
( ~ op_implies_and
| implies(X121,X122) = not(and(X121,not(X122))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])]) ).
fof(c_0_9,plain,
! [X117,X118] :
( ~ op_or
| or(X117,X118) = not(and(not(X117),not(X118))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])]) ).
cnf(c_0_10,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
fof(c_0_12,plain,
! [X45,X46] :
( ( ~ or_1
| is_a_theorem(implies(X45,or(X45,X46))) )
& ( ~ is_a_theorem(implies(esk20_0,or(esk20_0,esk21_0)))
| or_1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[or_1])])])]) ).
fof(c_0_13,plain,
! [X89,X90] :
( ( ~ cn2
| is_a_theorem(implies(X89,implies(not(X89),X90))) )
& ( ~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0)))
| cn2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn2])])])]) ).
cnf(c_0_14,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_16,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,or(X1,X2)))
| ~ or_1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
or_1,
inference(split_conjunct,[status(thm)],[hilbert_or_1]) ).
fof(c_0_19,negated_conjecture,
~ cn2,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[luka_cn2])]) ).
cnf(c_0_20,plain,
( cn2
| ~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_23,negated_conjecture,
~ cn2,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL452+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Oct 2 13:05:40 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.n5wH50UR9Y/E---3.1_26292.p
% 0.19/0.49 # Version: 3.1pre001
% 0.19/0.49 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 26424 completed with status 0
% 0.19/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.19/0.49 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.19/0.49 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.19/0.49 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.19/0.49 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.49 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 151s (1) cores
% 0.19/0.49 # H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 26444 completed with status 0
% 0.19/0.49 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.19/0.49 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.19/0.49 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.19/0.49 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.19/0.49 # Preprocessing time : 0.003 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 53
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 82
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 82
% 0.19/0.49 # Processed clauses : 63
% 0.19/0.49 # ...of these trivial : 16
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 46
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 0
% 0.19/0.49 # Generated clauses : 0
% 0.19/0.49 # ...of the previous two non-redundant : 0
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 0
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Total rewrite steps : 45
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 46
% 0.19/0.49 # Positive orientable unit clauses : 35
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 1
% 0.19/0.49 # Non-unit-clauses : 10
% 0.19/0.49 # Current number of unprocessed clauses: 19
% 0.19/0.49 # ...number of literals in the above : 38
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 0
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 4
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 4
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 6
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 7
% 0.19/0.49 # BW rewrite match successes : 0
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 3978
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.50 # User time : 0.007 s
% 0.19/0.50 # System time : 0.005 s
% 0.19/0.50 # Total time : 0.013 s
% 0.19/0.50 # Maximum resident set size: 1964 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.021 s
% 0.19/0.50 # System time : 0.022 s
% 0.19/0.50 # Total time : 0.043 s
% 0.19/0.50 # Maximum resident set size: 1724 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------