TSTP Solution File: SEU362+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU362+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:10 EDT 2023
% Result : Theorem 68.55s 9.87s
% Output : CNFRefutation 68.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 42 ( 20 unt; 0 def)
% Number of atoms : 131 ( 8 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 139 ( 50 ~; 45 |; 18 &)
% ( 3 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn; 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d13_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( rel_str(X2)
=> ( subrelstr(X2,X1)
<=> ( subset(the_carrier(X2),the_carrier(X1))
& subset(the_InternalRel(X2),the_InternalRel(X1)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZlQhjTgCPu/E---3.1_10045.p',d13_yellow_0) ).
fof(dt_m1_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( subrelstr(X2,X1)
=> rel_str(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZlQhjTgCPu/E---3.1_10045.p',dt_m1_yellow_0) ).
fof(t60_yellow_0,conjecture,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( subrelstr(X2,X1)
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ! [X4] :
( element(X4,the_carrier(X1))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X2))
=> ( ( X5 = X3
& X6 = X4
& related(X2,X5,X6) )
=> related(X1,X3,X4) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZlQhjTgCPu/E---3.1_10045.p',t60_yellow_0) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ZlQhjTgCPu/E---3.1_10045.p',t3_subset) ).
fof(d9_orders_2,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( related(X1,X2,X3)
<=> in(ordered_pair(X2,X3),the_InternalRel(X1)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZlQhjTgCPu/E---3.1_10045.p',d9_orders_2) ).
fof(l3_subset_1,lemma,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZlQhjTgCPu/E---3.1_10045.p',l3_subset_1) ).
fof(c_0_6,plain,
! [X34,X35] :
( ( subset(the_carrier(X35),the_carrier(X34))
| ~ subrelstr(X35,X34)
| ~ rel_str(X35)
| ~ rel_str(X34) )
& ( subset(the_InternalRel(X35),the_InternalRel(X34))
| ~ subrelstr(X35,X34)
| ~ rel_str(X35)
| ~ rel_str(X34) )
& ( ~ subset(the_carrier(X35),the_carrier(X34))
| ~ subset(the_InternalRel(X35),the_InternalRel(X34))
| subrelstr(X35,X34)
| ~ rel_str(X35)
| ~ rel_str(X34) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d13_yellow_0])])])]) ).
fof(c_0_7,plain,
! [X36,X37] :
( ~ rel_str(X36)
| ~ subrelstr(X37,X36)
| rel_str(X37) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_yellow_0])])]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( rel_str(X1)
=> ! [X2] :
( subrelstr(X2,X1)
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ! [X4] :
( element(X4,the_carrier(X1))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X2))
=> ( ( X5 = X3
& X6 = X4
& related(X2,X5,X6) )
=> related(X1,X3,X4) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t60_yellow_0]) ).
cnf(c_0_9,plain,
( subset(the_InternalRel(X1),the_InternalRel(X2))
| ~ subrelstr(X1,X2)
| ~ rel_str(X1)
| ~ rel_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( rel_str(X2)
| ~ rel_str(X1)
| ~ subrelstr(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,negated_conjecture,
( rel_str(esk1_0)
& subrelstr(esk2_0,esk1_0)
& element(esk3_0,the_carrier(esk1_0))
& element(esk4_0,the_carrier(esk1_0))
& element(esk5_0,the_carrier(esk2_0))
& element(esk6_0,the_carrier(esk2_0))
& esk5_0 = esk3_0
& esk6_0 = esk4_0
& related(esk2_0,esk5_0,esk6_0)
& ~ related(esk1_0,esk3_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_12,plain,
! [X88,X89] :
( ( ~ element(X88,powerset(X89))
| subset(X88,X89) )
& ( ~ subset(X88,X89)
| element(X88,powerset(X89)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
cnf(c_0_13,plain,
( subset(the_InternalRel(X1),the_InternalRel(X2))
| ~ subrelstr(X1,X2)
| ~ rel_str(X2) ),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
subrelstr(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
rel_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X91,X92,X93] :
( ( ~ related(X91,X92,X93)
| in(ordered_pair(X92,X93),the_InternalRel(X91))
| ~ element(X93,the_carrier(X91))
| ~ element(X92,the_carrier(X91))
| ~ rel_str(X91) )
& ( ~ in(ordered_pair(X92,X93),the_InternalRel(X91))
| related(X91,X92,X93)
| ~ element(X93,the_carrier(X91))
| ~ element(X92,the_carrier(X91))
| ~ rel_str(X91) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_orders_2])])])]) ).
cnf(c_0_17,negated_conjecture,
element(esk4_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
esk6_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,lemma,
! [X44,X45,X46] :
( ~ element(X45,powerset(X44))
| ~ in(X46,X45)
| in(X46,X44) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l3_subset_1])])]) ).
cnf(c_0_20,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
subset(the_InternalRel(esk2_0),the_InternalRel(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_22,negated_conjecture,
related(esk2_0,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
esk5_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,negated_conjecture,
element(esk5_0,the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,plain,
( related(X3,X1,X2)
| ~ in(ordered_pair(X1,X2),the_InternalRel(X3))
| ~ element(X2,the_carrier(X3))
| ~ element(X1,the_carrier(X3))
| ~ rel_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,negated_conjecture,
element(esk6_0,the_carrier(esk1_0)),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
~ related(esk1_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,lemma,
( in(X3,X2)
| ~ element(X1,powerset(X2))
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
element(the_InternalRel(esk2_0),powerset(the_InternalRel(esk1_0))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
( in(ordered_pair(X2,X3),the_InternalRel(X1))
| ~ related(X1,X2,X3)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_31,negated_conjecture,
related(esk2_0,esk3_0,esk6_0),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,negated_conjecture,
element(esk6_0,the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,negated_conjecture,
element(esk3_0,the_carrier(esk2_0)),
inference(rw,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_34,negated_conjecture,
rel_str(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_14]),c_0_15])]) ).
cnf(c_0_35,negated_conjecture,
( related(esk1_0,X1,esk6_0)
| ~ element(X1,the_carrier(esk1_0))
| ~ in(ordered_pair(X1,esk6_0),the_InternalRel(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_15])]) ).
cnf(c_0_36,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_37,negated_conjecture,
~ related(esk1_0,esk3_0,esk6_0),
inference(rw,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_38,lemma,
( in(X1,the_InternalRel(esk1_0))
| ~ in(X1,the_InternalRel(esk2_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_39,negated_conjecture,
in(ordered_pair(esk3_0,esk6_0),the_InternalRel(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33]),c_0_34])]) ).
cnf(c_0_40,negated_conjecture,
~ in(ordered_pair(esk3_0,esk6_0),the_InternalRel(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.15 % Problem : SEU362+2 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.16 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n007.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 08:07:24 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.37/0.56 Running first-order theorem proving
% 0.37/0.56 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.ZlQhjTgCPu/E---3.1_10045.p
% 68.55/9.87 # Version: 3.1pre001
% 68.55/9.87 # Preprocessing class: FSLMSMSSSSSNFFN.
% 68.55/9.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 68.55/9.87 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 68.55/9.87 # Starting new_bool_3 with 600s (2) cores
% 68.55/9.87 # Starting new_bool_1 with 600s (2) cores
% 68.55/9.87 # Starting sh5l with 300s (1) cores
% 68.55/9.87 # new_bool_3 with pid 10124 completed with status 0
% 68.55/9.87 # Result found by new_bool_3
% 68.55/9.87 # Preprocessing class: FSLMSMSSSSSNFFN.
% 68.55/9.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 68.55/9.87 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 68.55/9.87 # Starting new_bool_3 with 600s (2) cores
% 68.55/9.87 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 68.55/9.87 # Search class: FGHSM-FMLM32-MFFFFFNN
% 68.55/9.87 # partial match(1): FGHSM-SMLM32-MFFFFFNN
% 68.55/9.87 # Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 68.55/9.87 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 45s (1) cores
% 68.55/9.87 # Starting new_bool_3 with 61s (1) cores
% 68.55/9.87 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 10130 completed with status 0
% 68.55/9.87 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 68.55/9.87 # Preprocessing class: FSLMSMSSSSSNFFN.
% 68.55/9.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 68.55/9.87 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 68.55/9.87 # Starting new_bool_3 with 600s (2) cores
% 68.55/9.87 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 68.55/9.87 # Search class: FGHSM-FMLM32-MFFFFFNN
% 68.55/9.87 # partial match(1): FGHSM-SMLM32-MFFFFFNN
% 68.55/9.87 # Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 68.55/9.87 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 45s (1) cores
% 68.55/9.87 # Preprocessing time : 0.019 s
% 68.55/9.87 # Presaturation interreduction done
% 68.55/9.87
% 68.55/9.87 # Proof found!
% 68.55/9.87 # SZS status Theorem
% 68.55/9.87 # SZS output start CNFRefutation
% See solution above
% 68.55/9.87 # Parsed axioms : 691
% 68.55/9.87 # Removed by relevancy pruning/SinE : 559
% 68.55/9.87 # Initial clauses : 985
% 68.55/9.87 # Removed in clause preprocessing : 9
% 68.55/9.87 # Initial clauses in saturation : 976
% 68.55/9.87 # Processed clauses : 20312
% 68.55/9.87 # ...of these trivial : 39
% 68.55/9.87 # ...subsumed : 9335
% 68.55/9.87 # ...remaining for further processing : 10938
% 68.55/9.87 # Other redundant clauses eliminated : 469
% 68.55/9.87 # Clauses deleted for lack of memory : 0
% 68.55/9.87 # Backward-subsumed : 46
% 68.55/9.87 # Backward-rewritten : 196
% 68.55/9.87 # Generated clauses : 461643
% 68.55/9.87 # ...of the previous two non-redundant : 458815
% 68.55/9.87 # ...aggressively subsumed : 0
% 68.55/9.87 # Contextual simplify-reflections : 263
% 68.55/9.87 # Paramodulations : 461275
% 68.55/9.87 # Factorizations : 24
% 68.55/9.87 # NegExts : 0
% 68.55/9.87 # Equation resolutions : 473
% 68.55/9.87 # Total rewrite steps : 7425
% 68.55/9.87 # Propositional unsat checks : 2
% 68.55/9.87 # Propositional check models : 1
% 68.55/9.87 # Propositional check unsatisfiable : 0
% 68.55/9.87 # Propositional clauses : 0
% 68.55/9.87 # Propositional clauses after purity: 0
% 68.55/9.87 # Propositional unsat core size : 0
% 68.55/9.87 # Propositional preprocessing time : 0.000
% 68.55/9.87 # Propositional encoding time : 0.440
% 68.55/9.87 # Propositional solver time : 0.043
% 68.55/9.87 # Success case prop preproc time : 0.000
% 68.55/9.87 # Success case prop encoding time : 0.000
% 68.55/9.87 # Success case prop solver time : 0.000
% 68.55/9.87 # Current number of processed clauses : 9458
% 68.55/9.87 # Positive orientable unit clauses : 341
% 68.55/9.87 # Positive unorientable unit clauses: 0
% 68.55/9.87 # Negative unit clauses : 513
% 68.55/9.87 # Non-unit-clauses : 8604
% 68.55/9.87 # Current number of unprocessed clauses: 439944
% 68.55/9.87 # ...number of literals in the above : 1831043
% 68.55/9.87 # Current number of archived formulas : 0
% 68.55/9.87 # Current number of archived clauses : 1150
% 68.55/9.87 # Clause-clause subsumption calls (NU) : 9791537
% 68.55/9.87 # Rec. Clause-clause subsumption calls : 7105601
% 68.55/9.87 # Non-unit clause-clause subsumptions : 9102
% 68.55/9.87 # Unit Clause-clause subsumption calls : 193089
% 68.55/9.87 # Rewrite failures with RHS unbound : 0
% 68.55/9.87 # BW rewrite match attempts : 217
% 68.55/9.87 # BW rewrite match successes : 39
% 68.55/9.87 # Condensation attempts : 0
% 68.55/9.87 # Condensation successes : 0
% 68.55/9.87 # Termbank termtop insertions : 12928096
% 68.55/9.87
% 68.55/9.87 # -------------------------------------------------
% 68.55/9.87 # User time : 8.613 s
% 68.55/9.87 # System time : 0.304 s
% 68.55/9.87 # Total time : 8.917 s
% 68.55/9.87 # Maximum resident set size: 4796 pages
% 68.55/9.87
% 68.55/9.87 # -------------------------------------------------
% 68.55/9.87 # User time : 16.811 s
% 68.55/9.87 # System time : 0.306 s
% 68.55/9.87 # Total time : 17.118 s
% 68.55/9.87 # Maximum resident set size: 2668 pages
% 68.55/9.87 % E---3.1 exiting
% 68.55/9.87 % E---3.1 exiting
%------------------------------------------------------------------------------