TSTP Solution File: SEU137+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU137+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:30:30 EDT 2023
% Result : Theorem 1705.28s 258.20s
% Output : CNFRefutation 1705.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 6 unt; 0 def)
% Number of atoms : 135 ( 33 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 150 ( 49 ~; 76 |; 15 &)
% ( 7 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 98 ( 5 sgn; 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cDJBtW2aXq/E---3.1_2282.p',d4_xboole_0) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cDJBtW2aXq/E---3.1_2282.p',d2_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.cDJBtW2aXq/E---3.1_2282.p',d3_tarski) ).
fof(t45_xboole_1,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> X2 = set_union2(X1,set_difference(X2,X1)) ),
file('/export/starexec/sandbox/tmp/tmp.cDJBtW2aXq/E---3.1_2282.p',t45_xboole_1) ).
fof(c_0_4,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_5,plain,
! [X24,X25,X26,X27,X28,X29,X30,X31] :
( ( in(X27,X24)
| ~ in(X27,X26)
| X26 != set_difference(X24,X25) )
& ( ~ in(X27,X25)
| ~ in(X27,X26)
| X26 != set_difference(X24,X25) )
& ( ~ in(X28,X24)
| in(X28,X25)
| in(X28,X26)
| X26 != set_difference(X24,X25) )
& ( ~ in(esk3_3(X29,X30,X31),X31)
| ~ in(esk3_3(X29,X30,X31),X29)
| in(esk3_3(X29,X30,X31),X30)
| X31 = set_difference(X29,X30) )
& ( in(esk3_3(X29,X30,X31),X29)
| in(esk3_3(X29,X30,X31),X31)
| X31 = set_difference(X29,X30) )
& ( ~ in(esk3_3(X29,X30,X31),X30)
| in(esk3_3(X29,X30,X31),X31)
| X31 = set_difference(X29,X30) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
cnf(c_0_6,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( ~ in(X12,X11)
| in(X12,X9)
| in(X12,X10)
| X11 != set_union2(X9,X10) )
& ( ~ in(X13,X9)
| in(X13,X11)
| X11 != set_union2(X9,X10) )
& ( ~ in(X13,X10)
| in(X13,X11)
| X11 != set_union2(X9,X10) )
& ( ~ in(esk1_3(X14,X15,X16),X14)
| ~ in(esk1_3(X14,X15,X16),X16)
| X16 = set_union2(X14,X15) )
& ( ~ in(esk1_3(X14,X15,X16),X15)
| ~ in(esk1_3(X14,X15,X16),X16)
| X16 = set_union2(X14,X15) )
& ( in(esk1_3(X14,X15,X16),X16)
| in(esk1_3(X14,X15,X16),X14)
| in(esk1_3(X14,X15,X16),X15)
| X16 = set_union2(X14,X15) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_xboole_0])])])])])]) ).
fof(c_0_8,plain,
! [X18,X19,X20,X21,X22] :
( ( ~ subset(X18,X19)
| ~ in(X20,X18)
| in(X20,X19) )
& ( in(esk2_2(X21,X22),X21)
| subset(X21,X22) )
& ( ~ in(esk2_2(X21,X22),X22)
| subset(X21,X22) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> X2 = set_union2(X1,set_difference(X2,X1)) ),
inference(assume_negation,[status(cth)],[t45_xboole_1]) ).
cnf(c_0_10,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( in(esk1_3(X1,X2,X3),X3)
| in(esk1_3(X1,X2,X3),X1)
| in(esk1_3(X1,X2,X3),X2)
| X3 = set_union2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,negated_conjecture,
( subset(esk7_0,esk8_0)
& esk8_0 != set_union2(esk7_0,set_difference(esk8_0,esk7_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_14,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( X1 = set_union2(X2,set_difference(X3,X4))
| in(esk1_3(X2,set_difference(X3,X4),X1),X2)
| in(esk1_3(X2,set_difference(X3,X4),X1),X1)
| in(esk1_3(X2,set_difference(X3,X4),X1),X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( X1 = set_union2(X2,X3)
| in(esk1_3(X2,X3,X1),X3)
| in(esk1_3(X2,X3,X1),X1)
| in(esk1_3(X2,X3,X1),X4)
| ~ subset(X2,X4) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
subset(esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( set_union2(X1,set_difference(X2,X3)) = X2
| in(esk1_3(X1,set_difference(X2,X3),X2),X2)
| in(esk1_3(X1,set_difference(X2,X3),X2),X1) ),
inference(ef,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( X1 = set_union2(esk7_0,X2)
| in(esk1_3(esk7_0,X2,X1),esk8_0)
| in(esk1_3(esk7_0,X2,X1),X1)
| in(esk1_3(esk7_0,X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X4 != set_difference(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,plain,
( set_union2(X1,set_difference(X2,X3)) = X2
| in(esk1_3(X1,set_difference(X2,X3),X2),X2)
| ~ in(esk1_3(X1,set_difference(X2,X3),X2),set_difference(X4,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( set_union2(esk7_0,X1) = esk8_0
| in(esk1_3(esk7_0,X1,esk8_0),esk8_0)
| in(esk1_3(esk7_0,X1,esk8_0),X1) ),
inference(ef,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
esk8_0 != set_union2(esk7_0,set_difference(esk8_0,esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( X3 = set_union2(X1,X2)
| ~ in(esk1_3(X1,X2,X3),X2)
| ~ in(esk1_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
in(esk1_3(esk7_0,set_difference(esk8_0,esk7_0),esk8_0),esk8_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_28,plain,
( X1 = set_union2(X2,X3)
| in(esk1_3(X2,X3,X1),set_difference(X1,X4))
| in(esk1_3(X2,X3,X1),X2)
| in(esk1_3(X2,X3,X1),X3)
| in(esk1_3(X2,X3,X1),X4) ),
inference(spm,[status(thm)],[c_0_25,c_0_11]) ).
cnf(c_0_29,plain,
( X3 = set_union2(X1,X2)
| ~ in(esk1_3(X1,X2,X3),X1)
| ~ in(esk1_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_30,negated_conjecture,
~ in(esk1_3(esk7_0,set_difference(esk8_0,esk7_0),esk8_0),set_difference(esk8_0,esk7_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24]) ).
cnf(c_0_31,plain,
( set_union2(X1,set_difference(X2,X3)) = X2
| in(esk1_3(X1,set_difference(X2,X3),X2),set_difference(X2,X3))
| in(esk1_3(X1,set_difference(X2,X3),X2),X3)
| in(esk1_3(X1,set_difference(X2,X3),X2),X1) ),
inference(ef,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
~ in(esk1_3(esk7_0,set_difference(esk8_0,esk7_0),esk8_0),esk7_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_27]),c_0_24]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_24]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU137+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n027.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:26:30 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.cDJBtW2aXq/E---3.1_2282.p
% 1705.28/258.20 # Version: 3.1pre001
% 1705.28/258.20 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1705.28/258.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1705.28/258.20 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1705.28/258.20 # Starting new_bool_3 with 300s (1) cores
% 1705.28/258.20 # Starting new_bool_1 with 300s (1) cores
% 1705.28/258.20 # Starting sh5l with 300s (1) cores
% 1705.28/258.20 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2384 completed with status 0
% 1705.28/258.20 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1705.28/258.20 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1705.28/258.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1705.28/258.20 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1705.28/258.20 # No SInE strategy applied
% 1705.28/258.20 # Search class: FGHSM-FFMS32-SFFFFFNN
% 1705.28/258.20 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1705.28/258.20 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 1705.28/258.20 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1705.28/258.20 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 1705.28/258.20 # Starting new_bool_3 with 136s (1) cores
% 1705.28/258.20 # Starting new_bool_1 with 136s (1) cores
% 1705.28/258.20 # new_bool_1 with pid 2393 completed with status 7
% 1705.28/258.20 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 130s (1) cores
% 1705.28/258.20 # new_bool_3 with pid 2392 completed with status 7
% 1705.28/258.20 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 2391 completed with status 7
% 1705.28/258.20 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2390 completed with status 7
% 1705.28/258.20 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 2389 completed with status 0
% 1705.28/258.20 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 1705.28/258.20 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1705.28/258.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1705.28/258.20 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1705.28/258.20 # No SInE strategy applied
% 1705.28/258.20 # Search class: FGHSM-FFMS32-SFFFFFNN
% 1705.28/258.20 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1705.28/258.20 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 1705.28/258.20 # Preprocessing time : 0.002 s
% 1705.28/258.20 # Presaturation interreduction done
% 1705.28/258.20
% 1705.28/258.20 # Proof found!
% 1705.28/258.20 # SZS status Theorem
% 1705.28/258.20 # SZS output start CNFRefutation
% See solution above
% 1705.28/258.20 # Parsed axioms : 23
% 1705.28/258.20 # Removed by relevancy pruning/SinE : 0
% 1705.28/258.20 # Initial clauses : 37
% 1705.28/258.20 # Removed in clause preprocessing : 3
% 1705.28/258.20 # Initial clauses in saturation : 34
% 1705.28/258.20 # Processed clauses : 578503
% 1705.28/258.20 # ...of these trivial : 1281
% 1705.28/258.20 # ...subsumed : 558867
% 1705.28/258.20 # ...remaining for further processing : 18355
% 1705.28/258.20 # Other redundant clauses eliminated : 6
% 1705.28/258.20 # Clauses deleted for lack of memory : 139213
% 1705.28/258.20 # Backward-subsumed : 536
% 1705.28/258.20 # Backward-rewritten : 34
% 1705.28/258.20 # Generated clauses : 9360911
% 1705.28/258.20 # ...of the previous two non-redundant : 8940541
% 1705.28/258.20 # ...aggressively subsumed : 0
% 1705.28/258.20 # Contextual simplify-reflections : 633
% 1705.28/258.20 # Paramodulations : 9335829
% 1705.28/258.20 # Factorizations : 25076
% 1705.28/258.20 # NegExts : 0
% 1705.28/258.20 # Equation resolutions : 6
% 1705.28/258.20 # Total rewrite steps : 8353780
% 1705.28/258.20 # Propositional unsat checks : 3
% 1705.28/258.20 # Propositional check models : 3
% 1705.28/258.20 # Propositional check unsatisfiable : 0
% 1705.28/258.20 # Propositional clauses : 0
% 1705.28/258.20 # Propositional clauses after purity: 0
% 1705.28/258.20 # Propositional unsat core size : 0
% 1705.28/258.20 # Propositional preprocessing time : 0.000
% 1705.28/258.20 # Propositional encoding time : 9.724
% 1705.28/258.20 # Propositional solver time : 0.238
% 1705.28/258.20 # Success case prop preproc time : 0.000
% 1705.28/258.20 # Success case prop encoding time : 0.000
% 1705.28/258.20 # Success case prop solver time : 0.000
% 1705.28/258.20 # Current number of processed clauses : 17745
% 1705.28/258.20 # Positive orientable unit clauses : 439
% 1705.28/258.20 # Positive unorientable unit clauses: 1
% 1705.28/258.20 # Negative unit clauses : 6
% 1705.28/258.20 # Non-unit-clauses : 17299
% 1705.28/258.20 # Current number of unprocessed clauses: 1983777
% 1705.28/258.20 # ...number of literals in the above : 7602887
% 1705.28/258.20 # Current number of archived formulas : 0
% 1705.28/258.20 # Current number of archived clauses : 604
% 1705.28/258.20 # Clause-clause subsumption calls (NU) : 115906937
% 1705.28/258.20 # Rec. Clause-clause subsumption calls : 45174983
% 1705.28/258.20 # Non-unit clause-clause subsumptions : 559990
% 1705.28/258.20 # Unit Clause-clause subsumption calls : 1391176
% 1705.28/258.20 # Rewrite failures with RHS unbound : 0
% 1705.28/258.20 # BW rewrite match attempts : 4326
% 1705.28/258.20 # BW rewrite match successes : 42
% 1705.28/258.20 # Condensation attempts : 0
% 1705.28/258.20 # Condensation successes : 0
% 1705.28/258.20 # Termbank termtop insertions : 346824905
% 1705.28/258.20
% 1705.28/258.20 # -------------------------------------------------
% 1705.28/258.20 # User time : 809.855 s
% 1705.28/258.20 # System time : 6.519 s
% 1705.28/258.20 # Total time : 816.373 s
% 1705.28/258.20 # Maximum resident set size: 1824 pages
% 1705.28/258.20
% 1705.28/258.20 # -------------------------------------------------
% 1705.28/258.20 # User time : 929.484 s
% 1705.28/258.20 # System time : 8.344 s
% 1705.28/258.20 # Total time : 937.828 s
% 1705.28/258.20 # Maximum resident set size: 1688 pages
% 1705.28/258.20 % E---3.1 exiting
%------------------------------------------------------------------------------