TSTP Solution File: SEU361+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU361+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:49 EDT 2023
% Result : Theorem 2.17s 0.99s
% Output : CNFRefutation 2.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 11 unt; 0 def)
% Number of atoms : 131 ( 11 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 162 ( 62 ~; 57 |; 27 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 38 ( 1 sgn; 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t44_yellow_0,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> related(X1,bottom_of_relstr(X1),X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.WrpSySwrT2/E---3.1_18137.p',t44_yellow_0) ).
fof(t42_yellow_0,lemma,
! [X1] :
( ( ~ empty_carrier(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ( ex_sup_of_relstr_set(X1,empty_set)
& ex_inf_of_relstr_set(X1,the_carrier(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.WrpSySwrT2/E---3.1_18137.p',t42_yellow_0) ).
fof(d11_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> bottom_of_relstr(X1) = join_on_relstr(X1,empty_set) ),
file('/export/starexec/sandbox/tmp/tmp.WrpSySwrT2/E---3.1_18137.p',d11_yellow_0) ).
fof(d9_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2,X3] :
( element(X3,the_carrier(X1))
=> ( ex_sup_of_relstr_set(X1,X2)
=> ( X3 = join_on_relstr(X1,X2)
<=> ( relstr_set_smaller(X1,X2,X3)
& ! [X4] :
( element(X4,the_carrier(X1))
=> ( relstr_set_smaller(X1,X2,X4)
=> related(X1,X3,X4) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WrpSySwrT2/E---3.1_18137.p',d9_yellow_0) ).
fof(dt_k1_yellow_0,axiom,
! [X1,X2] :
( rel_str(X1)
=> element(join_on_relstr(X1,X2),the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.WrpSySwrT2/E---3.1_18137.p',dt_k1_yellow_0) ).
fof(t6_yellow_0,lemma,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ( relstr_set_smaller(X1,empty_set,X2)
& relstr_element_smaller(X1,empty_set,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WrpSySwrT2/E---3.1_18137.p',t6_yellow_0) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> related(X1,bottom_of_relstr(X1),X2) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t44_yellow_0])]) ).
fof(c_0_7,lemma,
! [X1] :
( ( ~ empty_carrier(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ( ex_sup_of_relstr_set(X1,empty_set)
& ex_inf_of_relstr_set(X1,the_carrier(X1)) ) ),
inference(fof_simplification,[status(thm)],[t42_yellow_0]) ).
fof(c_0_8,plain,
! [X26] :
( ~ rel_str(X26)
| bottom_of_relstr(X26) = join_on_relstr(X26,empty_set) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d11_yellow_0])]) ).
fof(c_0_9,negated_conjecture,
( ~ empty_carrier(esk1_0)
& antisymmetric_relstr(esk1_0)
& lower_bounded_relstr(esk1_0)
& rel_str(esk1_0)
& element(esk2_0,the_carrier(esk1_0))
& ~ related(esk1_0,bottom_of_relstr(esk1_0),esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
! [X38,X39,X40,X41] :
( ( relstr_set_smaller(X38,X39,X40)
| X40 != join_on_relstr(X38,X39)
| ~ ex_sup_of_relstr_set(X38,X39)
| ~ element(X40,the_carrier(X38))
| ~ rel_str(X38) )
& ( ~ element(X41,the_carrier(X38))
| ~ relstr_set_smaller(X38,X39,X41)
| related(X38,X40,X41)
| X40 != join_on_relstr(X38,X39)
| ~ ex_sup_of_relstr_set(X38,X39)
| ~ element(X40,the_carrier(X38))
| ~ rel_str(X38) )
& ( element(esk6_3(X38,X39,X40),the_carrier(X38))
| ~ relstr_set_smaller(X38,X39,X40)
| X40 = join_on_relstr(X38,X39)
| ~ ex_sup_of_relstr_set(X38,X39)
| ~ element(X40,the_carrier(X38))
| ~ rel_str(X38) )
& ( relstr_set_smaller(X38,X39,esk6_3(X38,X39,X40))
| ~ relstr_set_smaller(X38,X39,X40)
| X40 = join_on_relstr(X38,X39)
| ~ ex_sup_of_relstr_set(X38,X39)
| ~ element(X40,the_carrier(X38))
| ~ rel_str(X38) )
& ( ~ related(X38,X40,esk6_3(X38,X39,X40))
| ~ relstr_set_smaller(X38,X39,X40)
| X40 = join_on_relstr(X38,X39)
| ~ ex_sup_of_relstr_set(X38,X39)
| ~ element(X40,the_carrier(X38))
| ~ rel_str(X38) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_yellow_0])])])])]) ).
fof(c_0_11,plain,
! [X43,X44] :
( ~ rel_str(X43)
| element(join_on_relstr(X43,X44),the_carrier(X43)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_yellow_0])]) ).
fof(c_0_12,lemma,
! [X173,X174] :
( ( relstr_set_smaller(X173,empty_set,X174)
| ~ element(X174,the_carrier(X173))
| ~ rel_str(X173) )
& ( relstr_element_smaller(X173,empty_set,X174)
| ~ element(X174,the_carrier(X173))
| ~ rel_str(X173) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_yellow_0])])])]) ).
fof(c_0_13,lemma,
! [X37] :
( ( ex_sup_of_relstr_set(X37,empty_set)
| empty_carrier(X37)
| ~ antisymmetric_relstr(X37)
| ~ lower_bounded_relstr(X37)
| ~ rel_str(X37) )
& ( ex_inf_of_relstr_set(X37,the_carrier(X37))
| empty_carrier(X37)
| ~ antisymmetric_relstr(X37)
| ~ lower_bounded_relstr(X37)
| ~ rel_str(X37) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_14,plain,
( bottom_of_relstr(X1) = join_on_relstr(X1,empty_set)
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
rel_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( related(X2,X4,X1)
| ~ element(X1,the_carrier(X2))
| ~ relstr_set_smaller(X2,X3,X1)
| X4 != join_on_relstr(X2,X3)
| ~ ex_sup_of_relstr_set(X2,X3)
| ~ element(X4,the_carrier(X2))
| ~ rel_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( element(join_on_relstr(X1,X2),the_carrier(X1))
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,lemma,
( relstr_set_smaller(X1,empty_set,X2)
| ~ element(X2,the_carrier(X1))
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,lemma,
( ex_sup_of_relstr_set(X1,empty_set)
| empty_carrier(X1)
| ~ antisymmetric_relstr(X1)
| ~ lower_bounded_relstr(X1)
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
lower_bounded_relstr(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
antisymmetric_relstr(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
~ related(esk1_0,bottom_of_relstr(esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
bottom_of_relstr(esk1_0) = join_on_relstr(esk1_0,empty_set),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_26,plain,
( related(X1,join_on_relstr(X1,X2),X3)
| ~ relstr_set_smaller(X1,X2,X3)
| ~ ex_sup_of_relstr_set(X1,X2)
| ~ element(X3,the_carrier(X1))
| ~ rel_str(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_16]),c_0_17]) ).
cnf(c_0_27,negated_conjecture,
relstr_set_smaller(esk1_0,empty_set,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15])]) ).
cnf(c_0_28,negated_conjecture,
ex_sup_of_relstr_set(esk1_0,empty_set),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_15])]),c_0_23]) ).
cnf(c_0_29,negated_conjecture,
~ related(esk1_0,join_on_relstr(esk1_0,empty_set),esk2_0),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
$false,
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_19]),c_0_15])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU361+2 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 09:56:36 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.WrpSySwrT2/E---3.1_18137.p
% 2.17/0.99 # Version: 3.1pre001
% 2.17/0.99 # Preprocessing class: FSLMSMSSSSSNFFN.
% 2.17/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.99 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 2.17/0.99 # Starting new_bool_3 with 600s (2) cores
% 2.17/0.99 # Starting new_bool_1 with 600s (2) cores
% 2.17/0.99 # Starting sh5l with 300s (1) cores
% 2.17/0.99 # new_bool_1 with pid 18242 completed with status 0
% 2.17/0.99 # Result found by new_bool_1
% 2.17/0.99 # Preprocessing class: FSLMSMSSSSSNFFN.
% 2.17/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.99 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 2.17/0.99 # Starting new_bool_3 with 600s (2) cores
% 2.17/0.99 # Starting new_bool_1 with 600s (2) cores
% 2.17/0.99 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.17/0.99 # Search class: FGHSM-FMLM32-MFFFFFNN
% 2.17/0.99 # partial match(1): FGHSM-SMLM32-MFFFFFNN
% 2.17/0.99 # Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 2.17/0.99 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 45s (1) cores
% 2.17/0.99 # Starting new_bool_1 with 61s (1) cores
% 2.17/0.99 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 18274 completed with status 0
% 2.17/0.99 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 2.17/0.99 # Preprocessing class: FSLMSMSSSSSNFFN.
% 2.17/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.99 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 2.17/0.99 # Starting new_bool_3 with 600s (2) cores
% 2.17/0.99 # Starting new_bool_1 with 600s (2) cores
% 2.17/0.99 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.17/0.99 # Search class: FGHSM-FMLM32-MFFFFFNN
% 2.17/0.99 # partial match(1): FGHSM-SMLM32-MFFFFFNN
% 2.17/0.99 # Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 2.17/0.99 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 45s (1) cores
% 2.17/0.99 # Preprocessing time : 0.020 s
% 2.17/0.99 # Presaturation interreduction done
% 2.17/0.99
% 2.17/0.99 # Proof found!
% 2.17/0.99 # SZS status Theorem
% 2.17/0.99 # SZS output start CNFRefutation
% See solution above
% 2.17/0.99 # Parsed axioms : 687
% 2.17/0.99 # Removed by relevancy pruning/SinE : 571
% 2.17/0.99 # Initial clauses : 988
% 2.17/0.99 # Removed in clause preprocessing : 2
% 2.17/0.99 # Initial clauses in saturation : 986
% 2.17/0.99 # Processed clauses : 2987
% 2.17/0.99 # ...of these trivial : 12
% 2.17/0.99 # ...subsumed : 494
% 2.17/0.99 # ...remaining for further processing : 2481
% 2.17/0.99 # Other redundant clauses eliminated : 467
% 2.17/0.99 # Clauses deleted for lack of memory : 0
% 2.17/0.99 # Backward-subsumed : 28
% 2.17/0.99 # Backward-rewritten : 158
% 2.17/0.99 # Generated clauses : 5814
% 2.17/0.99 # ...of the previous two non-redundant : 5514
% 2.17/0.99 # ...aggressively subsumed : 0
% 2.17/0.99 # Contextual simplify-reflections : 230
% 2.17/0.99 # Paramodulations : 5474
% 2.17/0.99 # Factorizations : 0
% 2.17/0.99 # NegExts : 0
% 2.17/0.99 # Equation resolutions : 469
% 2.17/0.99 # Total rewrite steps : 1971
% 2.17/0.99 # Propositional unsat checks : 0
% 2.17/0.99 # Propositional check models : 0
% 2.17/0.99 # Propositional check unsatisfiable : 0
% 2.17/0.99 # Propositional clauses : 0
% 2.17/0.99 # Propositional clauses after purity: 0
% 2.17/0.99 # Propositional unsat core size : 0
% 2.17/0.99 # Propositional preprocessing time : 0.000
% 2.17/0.99 # Propositional encoding time : 0.000
% 2.17/0.99 # Propositional solver time : 0.000
% 2.17/0.99 # Success case prop preproc time : 0.000
% 2.17/0.99 # Success case prop encoding time : 0.000
% 2.17/0.99 # Success case prop solver time : 0.000
% 2.17/0.99 # Current number of processed clauses : 1034
% 2.17/0.99 # Positive orientable unit clauses : 166
% 2.17/0.99 # Positive unorientable unit clauses: 0
% 2.17/0.99 # Negative unit clauses : 281
% 2.17/0.99 # Non-unit-clauses : 587
% 2.17/0.99 # Current number of unprocessed clauses: 4324
% 2.17/0.99 # ...number of literals in the above : 13603
% 2.17/0.99 # Current number of archived formulas : 0
% 2.17/0.99 # Current number of archived clauses : 1111
% 2.17/0.99 # Clause-clause subsumption calls (NU) : 382514
% 2.17/0.99 # Rec. Clause-clause subsumption calls : 46191
% 2.17/0.99 # Non-unit clause-clause subsumptions : 438
% 2.17/0.99 # Unit Clause-clause subsumption calls : 12494
% 2.17/0.99 # Rewrite failures with RHS unbound : 0
% 2.17/0.99 # BW rewrite match attempts : 283
% 2.17/0.99 # BW rewrite match successes : 19
% 2.17/0.99 # Condensation attempts : 0
% 2.17/0.99 # Condensation successes : 0
% 2.17/0.99 # Termbank termtop insertions : 166215
% 2.17/0.99
% 2.17/0.99 # -------------------------------------------------
% 2.17/0.99 # User time : 0.458 s
% 2.17/0.99 # System time : 0.012 s
% 2.17/0.99 # Total time : 0.470 s
% 2.17/0.99 # Maximum resident set size: 4816 pages
% 2.17/0.99
% 2.17/0.99 # -------------------------------------------------
% 2.17/0.99 # User time : 0.887 s
% 2.17/0.99 # System time : 0.014 s
% 2.17/0.99 # Total time : 0.901 s
% 2.17/0.99 # Maximum resident set size: 2644 pages
% 2.17/0.99 % E---3.1 exiting
%------------------------------------------------------------------------------