TSTP Solution File: LCL469+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL469+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:12:52 EDT 2023
% Result : Theorem 0.11s 0.35s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 15 unt; 0 def)
% Number of atoms : 43 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 14 ~; 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.6CtqnCd0Rs/E---3.1_29302.p',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.6CtqnCd0Rs/E---3.1_29302.p',or_1) ).
fof(hilbert_or_1,conjecture,
or_1,
file('/export/starexec/sandbox2/tmp/tmp.6CtqnCd0Rs/E---3.1_29302.p',hilbert_or_1) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.6CtqnCd0Rs/E---3.1_29302.p',op_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox2/tmp/tmp.6CtqnCd0Rs/E---3.1_29302.p',hilbert_op_implies_and) ).
fof(luka_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/tmp/tmp.6CtqnCd0Rs/E---3.1_29302.p',luka_op_or) ).
fof(cn2,axiom,
( cn2
<=> ! [X4,X5] : is_a_theorem(implies(X4,implies(not(X4),X5))) ),
file('/export/starexec/sandbox2/tmp/tmp.6CtqnCd0Rs/E---3.1_29302.p',cn2) ).
fof(luka_cn2,axiom,
cn2,
file('/export/starexec/sandbox2/tmp/tmp.6CtqnCd0Rs/E---3.1_29302.p',luka_cn2) ).
fof(c_0_8,plain,
! [X19,X20] :
( ~ op_implies_and
| implies(X19,X20) = not(and(X19,not(X20))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])]) ).
fof(c_0_9,plain,
! [X7,X8] :
( ( ~ or_1
| is_a_theorem(implies(X7,or(X7,X8))) )
& ( ~ is_a_theorem(implies(esk1_0,or(esk1_0,esk2_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_10,negated_conjecture,
~ or_1,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hilbert_or_1])]) ).
fof(c_0_11,plain,
! [X11,X12] :
( ~ op_or
| or(X11,X12) = not(and(not(X11),not(X12))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])]) ).
cnf(c_0_12,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
cnf(c_0_14,plain,
( or_1
| ~ is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
~ or_1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_18,plain,
op_or,
inference(split_conjunct,[status(thm)],[luka_op_or]) ).
fof(c_0_19,plain,
! [X13,X14] :
( ( ~ cn2
| is_a_theorem(implies(X13,implies(not(X13),X14))) )
& ( ~ is_a_theorem(implies(esk3_0,implies(not(esk3_0),esk4_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_20,plain,
~ is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0))),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
or(X1,X2) = implies(not(X1),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,implies(not(X1),X2)))
| ~ cn2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
cn2,
inference(split_conjunct,[status(thm)],[luka_cn2]) ).
cnf(c_0_24,plain,
~ is_a_theorem(implies(esk1_0,implies(not(esk1_0),esk2_0))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_26,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : LCL469+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.08 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n019.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 2400
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Mon Oct 2 12:41:21 EDT 2023
% 0.07/0.27 % CPUTime :
% 0.11/0.34 Running first-order theorem proving
% 0.11/0.34 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.6CtqnCd0Rs/E---3.1_29302.p
% 0.11/0.35 # Version: 3.1pre001
% 0.11/0.35 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.11/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.35 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.11/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.35 # Starting sh5l with 300s (1) cores
% 0.11/0.35 # sh5l with pid 29384 completed with status 0
% 0.11/0.35 # Result found by sh5l
% 0.11/0.35 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.11/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.35 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.11/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.35 # Starting sh5l with 300s (1) cores
% 0.11/0.35 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.35 # Search class: FGUSF-FFSM21-MFFFFFNN
% 0.11/0.35 # partial match(1): FGUSF-FFMM21-MFFFFFNN
% 0.11/0.35 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.35 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 135s (1) cores
% 0.11/0.35 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 29387 completed with status 0
% 0.11/0.35 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.11/0.35 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.11/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.35 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.11/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.35 # Starting sh5l with 300s (1) cores
% 0.11/0.35 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.35 # Search class: FGUSF-FFSM21-MFFFFFNN
% 0.11/0.35 # partial match(1): FGUSF-FFMM21-MFFFFFNN
% 0.11/0.35 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.35 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 135s (1) cores
% 0.11/0.35 # Preprocessing time : 0.001 s
% 0.11/0.35 # Presaturation interreduction done
% 0.11/0.35
% 0.11/0.35 # Proof found!
% 0.11/0.35 # SZS status Theorem
% 0.11/0.35 # SZS output start CNFRefutation
% See solution above
% 0.11/0.35 # Parsed axioms : 43
% 0.11/0.35 # Removed by relevancy pruning/SinE : 25
% 0.11/0.35 # Initial clauses : 26
% 0.11/0.35 # Removed in clause preprocessing : 0
% 0.11/0.35 # Initial clauses in saturation : 26
% 0.11/0.35 # Processed clauses : 48
% 0.11/0.35 # ...of these trivial : 4
% 0.11/0.35 # ...subsumed : 1
% 0.11/0.35 # ...remaining for further processing : 43
% 0.11/0.35 # Other redundant clauses eliminated : 0
% 0.11/0.35 # Clauses deleted for lack of memory : 0
% 0.11/0.35 # Backward-subsumed : 0
% 0.11/0.35 # Backward-rewritten : 1
% 0.11/0.35 # Generated clauses : 8
% 0.11/0.35 # ...of the previous two non-redundant : 7
% 0.11/0.35 # ...aggressively subsumed : 0
% 0.11/0.35 # Contextual simplify-reflections : 0
% 0.11/0.35 # Paramodulations : 8
% 0.11/0.35 # Factorizations : 0
% 0.11/0.35 # NegExts : 0
% 0.11/0.35 # Equation resolutions : 0
% 0.11/0.35 # Total rewrite steps : 11
% 0.11/0.35 # Propositional unsat checks : 0
% 0.11/0.35 # Propositional check models : 0
% 0.11/0.35 # Propositional check unsatisfiable : 0
% 0.11/0.35 # Propositional clauses : 0
% 0.11/0.35 # Propositional clauses after purity: 0
% 0.11/0.35 # Propositional unsat core size : 0
% 0.11/0.35 # Propositional preprocessing time : 0.000
% 0.11/0.35 # Propositional encoding time : 0.000
% 0.11/0.35 # Propositional solver time : 0.000
% 0.11/0.36 # Success case prop preproc time : 0.000
% 0.11/0.36 # Success case prop encoding time : 0.000
% 0.11/0.36 # Success case prop solver time : 0.000
% 0.11/0.36 # Current number of processed clauses : 21
% 0.11/0.36 # Positive orientable unit clauses : 8
% 0.11/0.36 # Positive unorientable unit clauses: 0
% 0.11/0.36 # Negative unit clauses : 2
% 0.11/0.36 # Non-unit-clauses : 11
% 0.11/0.36 # Current number of unprocessed clauses: 6
% 0.11/0.36 # ...number of literals in the above : 9
% 0.11/0.36 # Current number of archived formulas : 0
% 0.11/0.36 # Current number of archived clauses : 22
% 0.11/0.36 # Clause-clause subsumption calls (NU) : 40
% 0.11/0.36 # Rec. Clause-clause subsumption calls : 39
% 0.11/0.36 # Non-unit clause-clause subsumptions : 0
% 0.11/0.36 # Unit Clause-clause subsumption calls : 2
% 0.11/0.36 # Rewrite failures with RHS unbound : 0
% 0.11/0.36 # BW rewrite match attempts : 8
% 0.11/0.36 # BW rewrite match successes : 1
% 0.11/0.36 # Condensation attempts : 0
% 0.11/0.36 # Condensation successes : 0
% 0.11/0.36 # Termbank termtop insertions : 1536
% 0.11/0.36
% 0.11/0.36 # -------------------------------------------------
% 0.11/0.36 # User time : 0.003 s
% 0.11/0.36 # System time : 0.001 s
% 0.11/0.36 # Total time : 0.005 s
% 0.11/0.36 # Maximum resident set size: 1860 pages
% 0.11/0.36
% 0.11/0.36 # -------------------------------------------------
% 0.11/0.36 # User time : 0.005 s
% 0.11/0.36 # System time : 0.001 s
% 0.11/0.36 # Total time : 0.007 s
% 0.11/0.36 # Maximum resident set size: 1724 pages
% 0.11/0.36 % E---3.1 exiting
% 0.11/0.36 % E---3.1 exiting
%------------------------------------------------------------------------------