TSTP Solution File: SEU350+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU350+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:31:45 EDT 2023
% Result : Theorem 0.80s 0.69s
% Output : CNFRefutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 8 unt; 0 def)
% Number of atoms : 151 ( 8 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 182 ( 67 ~; 65 |; 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(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.B9BYM1kmXm/E---3.1_14144.p',t31_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.B9BYM1kmXm/E---3.1_14144.p',d4_lattice3) ).
fof(t30_lattice3,lemma,
! [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.B9BYM1kmXm/E---3.1_14144.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.B9BYM1kmXm/E---3.1_14144.p',d3_lattice3) ).
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.B9BYM1kmXm/E---3.1_14144.p',dt_k5_lattice3) ).
fof(c_0_5,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_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,lemma,
! [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,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_10,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_5])])]) ).
fof(c_0_11,plain,
! [X33,X34] :
( empty_carrier(X33)
| ~ lattice(X33)
| ~ latt_str(X33)
| ~ element(X34,the_carrier(poset_of_lattice(X33)))
| cast_to_el_of_lattice(X33,X34) = X34 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_12,lemma,
! [X30,X31,X32] :
( ( ~ latt_element_smaller(X31,X32,X30)
| relstr_set_smaller(poset_of_lattice(X31),X30,cast_to_el_of_LattPOSet(X31,X32))
| ~ element(X32,the_carrier(X31))
| empty_carrier(X31)
| ~ lattice(X31)
| ~ latt_str(X31) )
& ( ~ relstr_set_smaller(poset_of_lattice(X31),X30,cast_to_el_of_LattPOSet(X31,X32))
| latt_element_smaller(X31,X32,X30)
| ~ element(X32,the_carrier(X31))
| empty_carrier(X31)
| ~ lattice(X31)
| ~ latt_str(X31) ) ),
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,
! [X83,X84] :
( empty_carrier(X83)
| ~ lattice(X83)
| ~ latt_str(X83)
| ~ element(X84,the_carrier(X83))
| cast_to_el_of_LattPOSet(X83,X84) = X84 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_14,plain,
! [X35,X36] :
( empty_carrier(X35)
| ~ lattice(X35)
| ~ latt_str(X35)
| ~ element(X36,the_carrier(poset_of_lattice(X35)))
| element(cast_to_el_of_lattice(X35,X36),the_carrier(X35)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
cnf(c_0_15,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_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,negated_conjecture,
lattice(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
element(esk3_0,the_carrier(poset_of_lattice(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
latt_str(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
~ empty_carrier(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,lemma,
( 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_22,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_23,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_14]) ).
cnf(c_0_24,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_15,c_0_16]),c_0_17]),c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_25,lemma,
( relstr_set_smaller(poset_of_lattice(X1),X2,X3)
| empty_carrier(X1)
| ~ latt_element_smaller(X1,X3,X2)
| ~ lattice(X1)
| ~ element(X3,the_carrier(X1))
| ~ latt_str(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( empty_carrier(X1)
| element(X2,the_carrier(X1))
| ~ lattice(X1)
| ~ element(X2,the_carrier(poset_of_lattice(X1)))
| ~ latt_str(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_27,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_10]) ).
cnf(c_0_28,negated_conjecture,
( ~ latt_element_smaller(esk2_0,esk3_0,esk1_0)
| ~ 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_25]),c_0_17]),c_0_19])]),c_0_20]) ).
cnf(c_0_29,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_26,c_0_18]),c_0_17]),c_0_19])]),c_0_20]) ).
cnf(c_0_30,lemma,
( 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_31,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_27,c_0_16]),c_0_17]),c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_32,negated_conjecture,
~ latt_element_smaller(esk2_0,esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_33,lemma,
( latt_element_smaller(X1,X2,X3)
| empty_carrier(X1)
| ~ relstr_set_smaller(poset_of_lattice(X1),X3,X2)
| ~ lattice(X1)
| ~ element(X2,the_carrier(X1))
| ~ latt_str(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_34,negated_conjecture,
relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0),
inference(sr,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[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_33,c_0_34]),c_0_17]),c_0_29]),c_0_19])]),c_0_32]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU350+2 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n013.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 08:46:14 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.48 Running first-order model finding
% 0.16/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.B9BYM1kmXm/E---3.1_14144.p
% 0.80/0.69 # Version: 3.1pre001
% 0.80/0.69 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.80/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/0.69 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.80/0.69 # Starting new_bool_3 with 600s (2) cores
% 0.80/0.69 # Starting new_bool_1 with 600s (2) cores
% 0.80/0.69 # Starting sh5l with 300s (1) cores
% 0.80/0.69 # new_bool_1 with pid 14223 completed with status 0
% 0.80/0.69 # Result found by new_bool_1
% 0.80/0.69 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.80/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/0.69 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.80/0.69 # Starting new_bool_3 with 600s (2) cores
% 0.80/0.69 # Starting new_bool_1 with 600s (2) cores
% 0.80/0.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.80/0.69 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.80/0.69 # Scheduled 12 strats onto 2 cores with 600 seconds (600 total)
% 0.80/0.69 # Starting G-E--_303_C18_F1_URBAN_S0Y with 50s (1) cores
% 0.80/0.69 # Starting new_bool_1 with 61s (1) cores
% 0.80/0.69 # G-E--_303_C18_F1_URBAN_S0Y with pid 14225 completed with status 0
% 0.80/0.69 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 0.80/0.69 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.80/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/0.69 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.80/0.69 # Starting new_bool_3 with 600s (2) cores
% 0.80/0.69 # Starting new_bool_1 with 600s (2) cores
% 0.80/0.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.80/0.69 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.80/0.69 # Scheduled 12 strats onto 2 cores with 600 seconds (600 total)
% 0.80/0.69 # Starting G-E--_303_C18_F1_URBAN_S0Y with 50s (1) cores
% 0.80/0.69 # Preprocessing time : 0.012 s
% 0.80/0.69
% 0.80/0.69 # Proof found!
% 0.80/0.69 # SZS status Theorem
% 0.80/0.69 # SZS output start CNFRefutation
% See solution above
% 0.80/0.69 # Parsed axioms : 640
% 0.80/0.69 # Removed by relevancy pruning/SinE : 557
% 0.80/0.69 # Initial clauses : 512
% 0.80/0.69 # Removed in clause preprocessing : 4
% 0.80/0.69 # Initial clauses in saturation : 508
% 0.80/0.69 # Processed clauses : 598
% 0.80/0.69 # ...of these trivial : 4
% 0.80/0.69 # ...subsumed : 36
% 0.80/0.69 # ...remaining for further processing : 558
% 0.80/0.69 # Other redundant clauses eliminated : 113
% 0.80/0.69 # Clauses deleted for lack of memory : 0
% 0.80/0.69 # Backward-subsumed : 6
% 0.80/0.69 # Backward-rewritten : 8
% 0.80/0.69 # Generated clauses : 2823
% 0.80/0.69 # ...of the previous two non-redundant : 2748
% 0.80/0.69 # ...aggressively subsumed : 0
% 0.80/0.69 # Contextual simplify-reflections : 4
% 0.80/0.69 # Paramodulations : 2647
% 0.80/0.69 # Factorizations : 2
% 0.80/0.69 # NegExts : 0
% 0.80/0.69 # Equation resolutions : 173
% 0.80/0.69 # Total rewrite steps : 91
% 0.80/0.69 # Propositional unsat checks : 0
% 0.80/0.69 # Propositional check models : 0
% 0.80/0.69 # Propositional check unsatisfiable : 0
% 0.80/0.69 # Propositional clauses : 0
% 0.80/0.69 # Propositional clauses after purity: 0
% 0.80/0.69 # Propositional unsat core size : 0
% 0.80/0.69 # Propositional preprocessing time : 0.000
% 0.80/0.69 # Propositional encoding time : 0.000
% 0.80/0.69 # Propositional solver time : 0.000
% 0.80/0.69 # Success case prop preproc time : 0.000
% 0.80/0.69 # Success case prop encoding time : 0.000
% 0.80/0.69 # Success case prop solver time : 0.000
% 0.80/0.69 # Current number of processed clauses : 457
% 0.80/0.69 # Positive orientable unit clauses : 44
% 0.80/0.69 # Positive unorientable unit clauses: 0
% 0.80/0.69 # Negative unit clauses : 15
% 0.80/0.69 # Non-unit-clauses : 398
% 0.80/0.69 # Current number of unprocessed clauses: 2653
% 0.80/0.69 # ...number of literals in the above : 18452
% 0.80/0.69 # Current number of archived formulas : 0
% 0.80/0.69 # Current number of archived clauses : 15
% 0.80/0.69 # Clause-clause subsumption calls (NU) : 80696
% 0.80/0.69 # Rec. Clause-clause subsumption calls : 5647
% 0.80/0.69 # Non-unit clause-clause subsumptions : 43
% 0.80/0.69 # Unit Clause-clause subsumption calls : 2194
% 0.80/0.69 # Rewrite failures with RHS unbound : 0
% 0.80/0.69 # BW rewrite match attempts : 26
% 0.80/0.69 # BW rewrite match successes : 4
% 0.80/0.69 # Condensation attempts : 0
% 0.80/0.69 # Condensation successes : 0
% 0.80/0.69 # Termbank termtop insertions : 108696
% 0.80/0.69
% 0.80/0.69 # -------------------------------------------------
% 0.80/0.69 # User time : 0.173 s
% 0.80/0.69 # System time : 0.010 s
% 0.80/0.69 # Total time : 0.183 s
% 0.80/0.69 # Maximum resident set size: 3888 pages
% 0.80/0.69
% 0.80/0.69 # -------------------------------------------------
% 0.80/0.69 # User time : 0.350 s
% 0.80/0.69 # System time : 0.014 s
% 0.80/0.69 # Total time : 0.364 s
% 0.80/0.69 # Maximum resident set size: 2584 pages
% 0.80/0.69 % E---3.1 exiting
%------------------------------------------------------------------------------