TSTP Solution File: LCL512+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL512+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:25:07 EDT 2023
% Result : Theorem 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 12 unt; 0 def)
% Number of atoms : 34 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 11 ~; 8 |; 2 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 2 sgn; 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kn2,axiom,
( kn2
<=> ! [X4,X5] : is_a_theorem(implies(and(X4,X5),X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.XcJK56y4ib/E---3.1_28677.p',kn2) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.XcJK56y4ib/E---3.1_28677.p',op_equiv) ).
fof(equivalence_1,axiom,
( equivalence_1
<=> ! [X1,X2] : is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.XcJK56y4ib/E---3.1_28677.p',equivalence_1) ).
fof(hilbert_equivalence_1,conjecture,
equivalence_1,
file('/export/starexec/sandbox2/tmp/tmp.XcJK56y4ib/E---3.1_28677.p',hilbert_equivalence_1) ).
fof(rosser_kn2,axiom,
kn2,
file('/export/starexec/sandbox2/tmp/tmp.XcJK56y4ib/E---3.1_28677.p',rosser_kn2) ).
fof(rosser_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox2/tmp/tmp.XcJK56y4ib/E---3.1_28677.p',rosser_op_equiv) ).
fof(c_0_6,plain,
! [X27,X28] :
( ( ~ kn2
| is_a_theorem(implies(and(X27,X28),X27)) )
& ( ~ is_a_theorem(implies(and(esk10_0,esk11_0),esk10_0))
| kn2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn2])])])]) ).
fof(c_0_7,plain,
! [X23,X24] :
( ~ op_equiv
| equiv(X23,X24) = and(implies(X23,X24),implies(X24,X23)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])]) ).
fof(c_0_8,plain,
! [X7,X8] :
( ( ~ equivalence_1
| is_a_theorem(implies(equiv(X7,X8),implies(X7,X8))) )
& ( ~ is_a_theorem(implies(equiv(esk1_0,esk2_0),implies(esk1_0,esk2_0)))
| equivalence_1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equivalence_1])])])]) ).
fof(c_0_9,negated_conjecture,
~ equivalence_1,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hilbert_equivalence_1])]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
kn2,
inference(split_conjunct,[status(thm)],[rosser_kn2]) ).
cnf(c_0_12,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[rosser_op_equiv]) ).
cnf(c_0_14,plain,
( equivalence_1
| ~ is_a_theorem(implies(equiv(esk1_0,esk2_0),implies(esk1_0,esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
~ equivalence_1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_17,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_18,plain,
~ is_a_theorem(implies(equiv(esk1_0,esk2_0),implies(esk1_0,esk2_0))),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LCL512+1 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 12:48:46 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/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.XcJK56y4ib/E---3.1_28677.p
% 0.15/0.44 # Version: 3.1pre001
% 0.15/0.44 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # sh5l with pid 28757 completed with status 0
% 0.15/0.44 # Result found by sh5l
% 0.15/0.44 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.44 # Search class: FGUSF-FFSM21-MFFFFFNN
% 0.15/0.44 # partial match(1): FGUSF-FFMM21-MFFFFFNN
% 0.15/0.44 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 135s (1) cores
% 0.15/0.44 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 28760 completed with status 0
% 0.15/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.15/0.44 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.44 # Search class: FGUSF-FFSM21-MFFFFFNN
% 0.15/0.44 # partial match(1): FGUSF-FFMM21-MFFFFFNN
% 0.15/0.44 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 135s (1) cores
% 0.15/0.44 # Preprocessing time : 0.003 s
% 0.15/0.44 # Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Theorem
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.44 # Parsed axioms : 43
% 0.15/0.44 # Removed by relevancy pruning/SinE : 22
% 0.15/0.44 # Initial clauses : 29
% 0.15/0.44 # Removed in clause preprocessing : 0
% 0.15/0.44 # Initial clauses in saturation : 29
% 0.15/0.44 # Processed clauses : 51
% 0.15/0.44 # ...of these trivial : 8
% 0.15/0.44 # ...subsumed : 1
% 0.15/0.44 # ...remaining for further processing : 42
% 0.15/0.44 # Other redundant clauses eliminated : 0
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 0
% 0.15/0.44 # Backward-rewritten : 1
% 0.15/0.44 # Generated clauses : 9
% 0.15/0.44 # ...of the previous two non-redundant : 9
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 0
% 0.15/0.44 # Paramodulations : 9
% 0.15/0.44 # Factorizations : 0
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 0
% 0.15/0.44 # Total rewrite steps : 17
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 21
% 0.15/0.44 # Positive orientable unit clauses : 15
% 0.15/0.44 # Positive unorientable unit clauses: 0
% 0.15/0.44 # Negative unit clauses : 1
% 0.15/0.44 # Non-unit-clauses : 5
% 0.15/0.44 # Current number of unprocessed clauses: 7
% 0.15/0.44 # ...number of literals in the above : 9
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 21
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 4
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 4
% 0.15/0.44 # Non-unit clause-clause subsumptions : 0
% 0.15/0.44 # Unit Clause-clause subsumption calls : 4
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 7
% 0.15/0.44 # BW rewrite match successes : 1
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 1637
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.004 s
% 0.15/0.44 # System time : 0.004 s
% 0.15/0.44 # Total time : 0.007 s
% 0.15/0.44 # Maximum resident set size: 1832 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.004 s
% 0.15/0.44 # System time : 0.006 s
% 0.15/0.44 # Total time : 0.010 s
% 0.15/0.44 # Maximum resident set size: 1724 pages
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------