TSTP Solution File: SEU350+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU350+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 19:26:06 EDT 2023
% Result : Theorem 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 8 unt; 0 def)
% Number of atoms : 149 ( 8 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 179 ( 65 ~; 64 |; 28 &)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn; 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(dt_k5_lattice3,axiom,
! [X1,X2] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& latt_str(X1)
& element(X2,the_carrier(poset_of_lattice(X1))) )
=> element(cast_to_el_of_lattice(X1,X2),the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.UJLlHkw6sc/E---3.1_10533.p',dt_k5_lattice3) ).
fof(d4_lattice3,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& latt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(poset_of_lattice(X1)))
=> cast_to_el_of_lattice(X1,X2) = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.UJLlHkw6sc/E---3.1_10533.p',d4_lattice3) ).
fof(t30_lattice3,axiom,
! [X1,X2] :
( ( ~ empty_carrier(X2)
& lattice(X2)
& latt_str(X2) )
=> ! [X3] :
( element(X3,the_carrier(X2))
=> ( latt_element_smaller(X2,X3,X1)
<=> relstr_set_smaller(poset_of_lattice(X2),X1,cast_to_el_of_LattPOSet(X2,X3)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.UJLlHkw6sc/E---3.1_10533.p',t30_lattice3) ).
fof(d3_lattice3,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& latt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> cast_to_el_of_LattPOSet(X1,X2) = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.UJLlHkw6sc/E---3.1_10533.p',d3_lattice3) ).
fof(t31_lattice3,conjecture,
! [X1,X2] :
( ( ~ empty_carrier(X2)
& lattice(X2)
& latt_str(X2) )
=> ! [X3] :
( element(X3,the_carrier(poset_of_lattice(X2)))
=> ( relstr_set_smaller(poset_of_lattice(X2),X1,X3)
<=> latt_element_smaller(X2,cast_to_el_of_lattice(X2,X3),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.UJLlHkw6sc/E---3.1_10533.p',t31_lattice3) ).
fof(c_0_5,plain,
! [X1,X2] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& latt_str(X1)
& element(X2,the_carrier(poset_of_lattice(X1))) )
=> element(cast_to_el_of_lattice(X1,X2),the_carrier(X1)) ),
inference(fof_simplification,[status(thm)],[dt_k5_lattice3]) ).
fof(c_0_6,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& latt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(poset_of_lattice(X1)))
=> cast_to_el_of_lattice(X1,X2) = X2 ) ),
inference(fof_simplification,[status(thm)],[d4_lattice3]) ).
fof(c_0_7,plain,
! [X1,X2] :
( ( ~ empty_carrier(X2)
& lattice(X2)
& latt_str(X2) )
=> ! [X3] :
( element(X3,the_carrier(X2))
=> ( latt_element_smaller(X2,X3,X1)
<=> relstr_set_smaller(poset_of_lattice(X2),X1,cast_to_el_of_LattPOSet(X2,X3)) ) ) ),
inference(fof_simplification,[status(thm)],[t30_lattice3]) ).
fof(c_0_8,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& latt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> cast_to_el_of_LattPOSet(X1,X2) = X2 ) ),
inference(fof_simplification,[status(thm)],[d3_lattice3]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( ( ~ empty_carrier(X2)
& lattice(X2)
& latt_str(X2) )
=> ! [X3] :
( element(X3,the_carrier(poset_of_lattice(X2)))
=> ( relstr_set_smaller(poset_of_lattice(X2),X1,X3)
<=> latt_element_smaller(X2,cast_to_el_of_lattice(X2,X3),X1) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t31_lattice3])]) ).
fof(c_0_10,plain,
! [X13,X14] :
( empty_carrier(X13)
| ~ lattice(X13)
| ~ latt_str(X13)
| ~ element(X14,the_carrier(poset_of_lattice(X13)))
| element(cast_to_el_of_lattice(X13,X14),the_carrier(X13)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
fof(c_0_11,plain,
! [X11,X12] :
( empty_carrier(X11)
| ~ lattice(X11)
| ~ latt_str(X11)
| ~ element(X12,the_carrier(poset_of_lattice(X11)))
| cast_to_el_of_lattice(X11,X12) = X12 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_12,plain,
! [X8,X9,X10] :
( ( ~ latt_element_smaller(X9,X10,X8)
| relstr_set_smaller(poset_of_lattice(X9),X8,cast_to_el_of_LattPOSet(X9,X10))
| ~ element(X10,the_carrier(X9))
| empty_carrier(X9)
| ~ lattice(X9)
| ~ latt_str(X9) )
& ( ~ relstr_set_smaller(poset_of_lattice(X9),X8,cast_to_el_of_LattPOSet(X9,X10))
| latt_element_smaller(X9,X10,X8)
| ~ element(X10,the_carrier(X9))
| empty_carrier(X9)
| ~ lattice(X9)
| ~ latt_str(X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_13,plain,
! [X18,X19] :
( empty_carrier(X18)
| ~ lattice(X18)
| ~ latt_str(X18)
| ~ element(X19,the_carrier(X18))
| cast_to_el_of_LattPOSet(X18,X19) = X19 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_14,negated_conjecture,
( ~ empty_carrier(esk2_0)
& lattice(esk2_0)
& latt_str(esk2_0)
& element(esk3_0,the_carrier(poset_of_lattice(esk2_0)))
& ( ~ relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0)
| ~ latt_element_smaller(esk2_0,cast_to_el_of_lattice(esk2_0,esk3_0),esk1_0) )
& ( relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0)
| latt_element_smaller(esk2_0,cast_to_el_of_lattice(esk2_0,esk3_0),esk1_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_15,plain,
( empty_carrier(X1)
| element(cast_to_el_of_lattice(X1,X2),the_carrier(X1))
| ~ lattice(X1)
| ~ latt_str(X1)
| ~ element(X2,the_carrier(poset_of_lattice(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( empty_carrier(X1)
| cast_to_el_of_lattice(X1,X2) = X2
| ~ lattice(X1)
| ~ latt_str(X1)
| ~ element(X2,the_carrier(poset_of_lattice(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( latt_element_smaller(X1,X3,X2)
| empty_carrier(X1)
| ~ relstr_set_smaller(poset_of_lattice(X1),X2,cast_to_el_of_LattPOSet(X1,X3))
| ~ element(X3,the_carrier(X1))
| ~ lattice(X1)
| ~ latt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( empty_carrier(X1)
| cast_to_el_of_LattPOSet(X1,X2) = X2
| ~ lattice(X1)
| ~ latt_str(X1)
| ~ element(X2,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0)
| latt_element_smaller(esk2_0,cast_to_el_of_lattice(esk2_0,esk3_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
element(esk3_0,the_carrier(poset_of_lattice(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
lattice(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
latt_str(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
~ empty_carrier(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( element(X1,the_carrier(X2))
| empty_carrier(X2)
| ~ element(X1,the_carrier(poset_of_lattice(X2)))
| ~ lattice(X2)
| ~ latt_str(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( ~ relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0)
| ~ latt_element_smaller(esk2_0,cast_to_el_of_lattice(esk2_0,esk3_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,plain,
( latt_element_smaller(X1,X2,X3)
| empty_carrier(X1)
| ~ relstr_set_smaller(poset_of_lattice(X1),X3,X2)
| ~ element(X2,the_carrier(X1))
| ~ lattice(X1)
| ~ latt_str(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0)
| latt_element_smaller(esk2_0,esk3_0,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_16]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_28,negated_conjecture,
element(esk3_0,the_carrier(esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( ~ relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0)
| ~ latt_element_smaller(esk2_0,esk3_0,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_30,negated_conjecture,
latt_element_smaller(esk2_0,esk3_0,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_31,plain,
( relstr_set_smaller(poset_of_lattice(X1),X3,cast_to_el_of_LattPOSet(X1,X2))
| empty_carrier(X1)
| ~ latt_element_smaller(X1,X2,X3)
| ~ element(X2,the_carrier(X1))
| ~ lattice(X1)
| ~ latt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,negated_conjecture,
~ relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_33,plain,
( relstr_set_smaller(poset_of_lattice(X1),X2,X3)
| empty_carrier(X1)
| ~ latt_element_smaller(X1,X3,X2)
| ~ element(X3,the_carrier(X1))
| ~ lattice(X1)
| ~ latt_str(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_30]),c_0_28]),c_0_21]),c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU350+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 08:34:35 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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.UJLlHkw6sc/E---3.1_10533.p
% 0.18/0.46 # Version: 3.1pre001
% 0.18/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting sh5l with 300s (1) cores
% 0.18/0.46 # new_bool_3 with pid 10612 completed with status 0
% 0.18/0.46 # Result found by new_bool_3
% 0.18/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.18/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.46 # SAT001_MinMin_p005000_rr_RG with pid 10615 completed with status 0
% 0.18/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.18/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.46 # Preprocessing time : 0.004 s
% 0.18/0.46 # Presaturation interreduction done
% 0.18/0.46
% 0.18/0.46 # Proof found!
% 0.18/0.46 # SZS status Theorem
% 0.18/0.46 # SZS output start CNFRefutation
% See solution above
% 0.18/0.46 # Parsed axioms : 65
% 0.18/0.46 # Removed by relevancy pruning/SinE : 57
% 0.18/0.46 # Initial clauses : 14
% 0.18/0.46 # Removed in clause preprocessing : 0
% 0.18/0.46 # Initial clauses in saturation : 14
% 0.18/0.46 # Processed clauses : 41
% 0.18/0.46 # ...of these trivial : 0
% 0.18/0.46 # ...subsumed : 0
% 0.18/0.46 # ...remaining for further processing : 41
% 0.18/0.46 # Other redundant clauses eliminated : 0
% 0.18/0.46 # Clauses deleted for lack of memory : 0
% 0.18/0.46 # Backward-subsumed : 1
% 0.18/0.46 # Backward-rewritten : 2
% 0.18/0.46 # Generated clauses : 26
% 0.18/0.46 # ...of the previous two non-redundant : 18
% 0.18/0.46 # ...aggressively subsumed : 0
% 0.18/0.46 # Contextual simplify-reflections : 0
% 0.18/0.46 # Paramodulations : 25
% 0.18/0.46 # Factorizations : 0
% 0.18/0.46 # NegExts : 0
% 0.18/0.46 # Equation resolutions : 0
% 0.18/0.46 # Total rewrite steps : 21
% 0.18/0.46 # Propositional unsat checks : 0
% 0.18/0.46 # Propositional check models : 0
% 0.18/0.46 # Propositional check unsatisfiable : 0
% 0.18/0.46 # Propositional clauses : 0
% 0.18/0.46 # Propositional clauses after purity: 0
% 0.18/0.46 # Propositional unsat core size : 0
% 0.18/0.46 # Propositional preprocessing time : 0.000
% 0.18/0.46 # Propositional encoding time : 0.000
% 0.18/0.46 # Propositional solver time : 0.000
% 0.18/0.46 # Success case prop preproc time : 0.000
% 0.18/0.46 # Success case prop encoding time : 0.000
% 0.18/0.46 # Success case prop solver time : 0.000
% 0.18/0.46 # Current number of processed clauses : 23
% 0.18/0.46 # Positive orientable unit clauses : 8
% 0.18/0.46 # Positive unorientable unit clauses: 0
% 0.18/0.46 # Negative unit clauses : 2
% 0.18/0.46 # Non-unit-clauses : 13
% 0.18/0.46 # Current number of unprocessed clauses: 5
% 0.18/0.46 # ...number of literals in the above : 41
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 18
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 107
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 13
% 0.18/0.46 # Non-unit clause-clause subsumptions : 0
% 0.18/0.46 # Unit Clause-clause subsumption calls : 2
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 1
% 0.18/0.46 # BW rewrite match successes : 1
% 0.18/0.46 # Condensation attempts : 0
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 2576
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.003 s
% 0.18/0.46 # System time : 0.006 s
% 0.18/0.46 # Total time : 0.009 s
% 0.18/0.46 # Maximum resident set size: 1880 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.005 s
% 0.18/0.46 # System time : 0.007 s
% 0.18/0.46 # Total time : 0.013 s
% 0.18/0.46 # Maximum resident set size: 1748 pages
% 0.18/0.46 % E---3.1 exiting
% 0.18/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------