TSTP Solution File: SEU136+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU136+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:25:13 EDT 2024
% Result : Theorem 31.80s 4.51s
% Output : CNFRefutation 31.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 12 unt; 0 def)
% Number of atoms : 110 ( 31 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 123 ( 46 ~; 59 |; 12 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 83 ( 6 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t40_xboole_1,conjecture,
! [X1,X2] : set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.Q6hOSM6Zye/E---3.1_1271.p',t40_xboole_1) ).
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.Q6hOSM6Zye/E---3.1_1271.p',d4_xboole_0) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.Q6hOSM6Zye/E---3.1_1271.p',commutativity_k2_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.Q6hOSM6Zye/E---3.1_1271.p',d2_xboole_0) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] : set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
inference(assume_negation,[status(cth)],[t40_xboole_1]) ).
fof(c_0_5,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_6,negated_conjecture,
set_difference(set_union2(esk6_0,esk7_0),esk7_0) != set_difference(esk6_0,esk7_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,plain,
! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_8,plain,
! [X26,X27,X28,X29,X30,X31,X32,X33] :
( ( in(X29,X26)
| ~ in(X29,X28)
| X28 != set_difference(X26,X27) )
& ( ~ in(X29,X27)
| ~ in(X29,X28)
| X28 != set_difference(X26,X27) )
& ( ~ in(X30,X26)
| in(X30,X27)
| in(X30,X28)
| X28 != set_difference(X26,X27) )
& ( ~ in(esk3_3(X31,X32,X33),X33)
| ~ in(esk3_3(X31,X32,X33),X31)
| in(esk3_3(X31,X32,X33),X32)
| X33 = set_difference(X31,X32) )
& ( in(esk3_3(X31,X32,X33),X31)
| in(esk3_3(X31,X32,X33),X33)
| X33 = set_difference(X31,X32) )
& ( ~ in(esk3_3(X31,X32,X33),X32)
| in(esk3_3(X31,X32,X33),X33)
| X33 = set_difference(X31,X32) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_5])])])])])])]) ).
cnf(c_0_9,negated_conjecture,
set_difference(set_union2(esk6_0,esk7_0),esk7_0) != set_difference(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X11,X12,X13,X14,X15,X16,X17,X18] :
( ( ~ in(X14,X13)
| in(X14,X11)
| in(X14,X12)
| X13 != set_union2(X11,X12) )
& ( ~ in(X15,X11)
| in(X15,X13)
| X13 != set_union2(X11,X12) )
& ( ~ in(X15,X12)
| in(X15,X13)
| X13 != set_union2(X11,X12) )
& ( ~ in(esk1_3(X16,X17,X18),X16)
| ~ in(esk1_3(X16,X17,X18),X18)
| X18 = set_union2(X16,X17) )
& ( ~ in(esk1_3(X16,X17,X18),X17)
| ~ in(esk1_3(X16,X17,X18),X18)
| X18 = set_union2(X16,X17) )
& ( in(esk1_3(X16,X17,X18),X18)
| in(esk1_3(X16,X17,X18),X16)
| in(esk1_3(X16,X17,X18),X17)
| X18 = set_union2(X16,X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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])])])])])])]) ).
cnf(c_0_12,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
set_difference(set_union2(esk7_0,esk6_0),esk7_0) != set_difference(esk6_0,esk7_0),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( in(esk3_3(X1,X2,X3),X1)
| in(esk3_3(X1,X2,X3),X3)
| X3 = set_difference(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X2 != set_union2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),set_union2(esk7_0,esk6_0))
| in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),set_difference(esk6_0,esk7_0)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_19,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X4 != set_difference(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X3,X2)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),set_union2(esk7_0,esk6_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),esk6_0)
| in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),esk7_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( in(esk3_3(X1,X2,X3),X2)
| X3 = set_difference(X1,X2)
| ~ in(esk3_3(X1,X2,X3),X3)
| ~ in(esk3_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,negated_conjecture,
( in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),set_difference(esk6_0,X1))
| in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),esk7_0)
| in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,plain,
( in(esk3_3(X1,X2,X3),X3)
| X3 = set_difference(X1,X2)
| ~ in(esk3_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),esk7_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_22])]),c_0_13]) ).
cnf(c_0_30,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),set_difference(esk6_0,esk7_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_13]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU136+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 08:18:06 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.Q6hOSM6Zye/E---3.1_1271.p
% 31.80/4.51 # Version: 3.1.0
% 31.80/4.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 31.80/4.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.80/4.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 31.80/4.51 # Starting new_bool_3 with 300s (1) cores
% 31.80/4.51 # Starting new_bool_1 with 300s (1) cores
% 31.80/4.51 # Starting sh5l with 300s (1) cores
% 31.80/4.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1350 completed with status 0
% 31.80/4.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 31.80/4.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 31.80/4.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.80/4.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 31.80/4.51 # No SInE strategy applied
% 31.80/4.51 # Search class: FGHSM-FFMF32-SFFFFFNN
% 31.80/4.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 31.80/4.51 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 31.80/4.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 31.80/4.51 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 31.80/4.51 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 31.80/4.51 # Starting H----_011_C18_F1_PI_SE_SP_S2S with 136s (1) cores
% 31.80/4.51 # G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1358 completed with status 0
% 31.80/4.51 # Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 31.80/4.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 31.80/4.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.80/4.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 31.80/4.51 # No SInE strategy applied
% 31.80/4.51 # Search class: FGHSM-FFMF32-SFFFFFNN
% 31.80/4.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 31.80/4.51 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 31.80/4.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 31.80/4.51 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 31.80/4.51 # Preprocessing time : 0.002 s
% 31.80/4.51 # Presaturation interreduction done
% 31.80/4.51
% 31.80/4.51 # Proof found!
% 31.80/4.51 # SZS status Theorem
% 31.80/4.51 # SZS output start CNFRefutation
% See solution above
% 31.80/4.51 # Parsed axioms : 23
% 31.80/4.51 # Removed by relevancy pruning/SinE : 0
% 31.80/4.51 # Initial clauses : 37
% 31.80/4.51 # Removed in clause preprocessing : 3
% 31.80/4.51 # Initial clauses in saturation : 34
% 31.80/4.51 # Processed clauses : 7285
% 31.80/4.51 # ...of these trivial : 83
% 31.80/4.51 # ...subsumed : 6090
% 31.80/4.51 # ...remaining for further processing : 1112
% 31.80/4.51 # Other redundant clauses eliminated : 491
% 31.80/4.51 # Clauses deleted for lack of memory : 0
% 31.80/4.51 # Backward-subsumed : 49
% 31.80/4.51 # Backward-rewritten : 17
% 31.80/4.51 # Generated clauses : 206370
% 31.80/4.51 # ...of the previous two non-redundant : 200881
% 31.80/4.51 # ...aggressively subsumed : 0
% 31.80/4.51 # Contextual simplify-reflections : 67
% 31.80/4.51 # Paramodulations : 205571
% 31.80/4.51 # Factorizations : 306
% 31.80/4.51 # NegExts : 0
% 31.80/4.51 # Equation resolutions : 493
% 31.80/4.51 # Disequality decompositions : 0
% 31.80/4.51 # Total rewrite steps : 13711
% 31.80/4.51 # ...of those cached : 12898
% 31.80/4.51 # Propositional unsat checks : 0
% 31.80/4.51 # Propositional check models : 0
% 31.80/4.51 # Propositional check unsatisfiable : 0
% 31.80/4.51 # Propositional clauses : 0
% 31.80/4.51 # Propositional clauses after purity: 0
% 31.80/4.51 # Propositional unsat core size : 0
% 31.80/4.51 # Propositional preprocessing time : 0.000
% 31.80/4.51 # Propositional encoding time : 0.000
% 31.80/4.51 # Propositional solver time : 0.000
% 31.80/4.51 # Success case prop preproc time : 0.000
% 31.80/4.51 # Success case prop encoding time : 0.000
% 31.80/4.51 # Success case prop solver time : 0.000
% 31.80/4.51 # Current number of processed clauses : 1006
% 31.80/4.51 # Positive orientable unit clauses : 69
% 31.80/4.51 # Positive unorientable unit clauses: 1
% 31.80/4.51 # Negative unit clauses : 31
% 31.80/4.51 # Non-unit-clauses : 905
% 31.80/4.51 # Current number of unprocessed clauses: 193088
% 31.80/4.51 # ...number of literals in the above : 1224702
% 31.80/4.51 # Current number of archived formulas : 0
% 31.80/4.51 # Current number of archived clauses : 98
% 31.80/4.51 # Clause-clause subsumption calls (NU) : 260534
% 31.80/4.51 # Rec. Clause-clause subsumption calls : 108403
% 31.80/4.51 # Non-unit clause-clause subsumptions : 4588
% 31.80/4.51 # Unit Clause-clause subsumption calls : 8316
% 31.80/4.51 # Rewrite failures with RHS unbound : 0
% 31.80/4.51 # BW rewrite match attempts : 195
% 31.80/4.51 # BW rewrite match successes : 33
% 31.80/4.51 # Condensation attempts : 0
% 31.80/4.51 # Condensation successes : 0
% 31.80/4.51 # Termbank termtop insertions : 4947380
% 31.80/4.51 # Search garbage collected termcells : 523
% 31.80/4.51
% 31.80/4.51 # -------------------------------------------------
% 31.80/4.51 # User time : 3.799 s
% 31.80/4.51 # System time : 0.100 s
% 31.80/4.51 # Total time : 3.899 s
% 31.80/4.51 # Maximum resident set size: 1780 pages
% 31.80/4.51
% 31.80/4.51 # -------------------------------------------------
% 31.80/4.51 # User time : 18.837 s
% 31.80/4.51 # System time : 0.727 s
% 31.80/4.51 # Total time : 19.564 s
% 31.80/4.51 # Maximum resident set size: 1708 pages
% 31.80/4.51 % E---3.1 exiting
% 31.80/4.51 % E exiting
%------------------------------------------------------------------------------