TSTP Solution File: SEU135+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU135+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:24:52 EDT 2023
% Result : Theorem 17.97s 2.75s
% Output : CNFRefutation 17.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 12 unt; 0 def)
% Number of atoms : 128 ( 32 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 153 ( 62 ~; 69 |; 15 &)
% ( 7 <=>; 0 =>; 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 : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 91 ( 7 sgn; 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t39_xboole_1,conjecture,
! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.kIi0oIHCRX/E---3.1_30703.p',t39_xboole_1) ).
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/sandbox2/tmp/tmp.kIi0oIHCRX/E---3.1_30703.p',d2_xboole_0) ).
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/sandbox2/tmp/tmp.kIi0oIHCRX/E---3.1_30703.p',d4_xboole_0) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kIi0oIHCRX/E---3.1_30703.p',d10_xboole_0) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.kIi0oIHCRX/E---3.1_30703.p',reflexivity_r1_tarski) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
inference(assume_negation,[status(cth)],[t39_xboole_1]) ).
fof(c_0_6,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(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_7,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_8,negated_conjecture,
set_union2(esk6_0,set_difference(esk7_0,esk6_0)) != set_union2(esk6_0,esk7_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,plain,
! [X9,X10] :
( ( subset(X9,X10)
| X9 != X10 )
& ( subset(X10,X9)
| X9 != X10 )
& ( ~ subset(X9,X10)
| ~ subset(X10,X9)
| X9 = X10 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).
cnf(c_0_10,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,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(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_7])])])])])]) ).
cnf(c_0_12,negated_conjecture,
set_union2(esk6_0,set_difference(esk7_0,esk6_0)) != set_union2(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_15,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_6]) ).
cnf(c_0_16,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( ~ subset(set_union2(esk6_0,set_difference(esk7_0,esk6_0)),set_union2(esk6_0,esk7_0))
| ~ subset(set_union2(esk6_0,esk7_0),set_union2(esk6_0,set_difference(esk7_0,esk6_0))) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_19,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_6]) ).
cnf(c_0_20,plain,
( in(X1,X2)
| ~ subset(X2,set_union2(X3,X4))
| ~ subset(set_union2(X3,X4),X2)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
fof(c_0_21,plain,
! [X42] : subset(X42,X42),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_22,negated_conjecture,
( ~ in(esk1_3(esk6_0,set_difference(esk7_0,esk6_0),set_union2(esk6_0,esk7_0)),set_union2(esk6_0,esk7_0))
| ~ in(esk1_3(esk6_0,set_difference(esk7_0,esk6_0),set_union2(esk6_0,esk7_0)),set_difference(esk7_0,esk6_0)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_15])]) ).
cnf(c_0_23,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X4 != set_difference(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,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_6]) ).
cnf(c_0_27,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X2 != set_union2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
( in(esk1_3(esk6_0,set_difference(esk7_0,esk6_0),X1),set_difference(esk7_0,esk6_0))
| in(esk1_3(esk6_0,set_difference(esk7_0,esk6_0),X1),X1)
| ~ subset(X1,set_union2(esk6_0,esk7_0))
| ~ subset(set_union2(esk6_0,esk7_0),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_29,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
~ in(esk1_3(esk6_0,set_difference(esk7_0,esk6_0),set_union2(esk6_0,esk7_0)),set_difference(esk7_0,esk6_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_31,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
~ in(esk1_3(esk6_0,set_difference(esk7_0,esk6_0),set_union2(esk6_0,esk7_0)),esk6_0),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_26])]),c_0_14]) ).
cnf(c_0_33,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X3,X2)) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
in(esk1_3(esk6_0,set_difference(esk7_0,esk6_0),set_union2(esk6_0,esk7_0)),set_union2(esk6_0,esk7_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_29])]),c_0_30]) ).
cnf(c_0_35,negated_conjecture,
~ in(esk1_3(esk6_0,set_difference(esk7_0,esk6_0),set_union2(esk6_0,esk7_0)),esk7_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_32]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SEU135+1 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n005.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 09:25:16 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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.kIi0oIHCRX/E---3.1_30703.p
% 17.97/2.75 # Version: 3.1pre001
% 17.97/2.75 # Preprocessing class: FSMSSMSSSSSNFFN.
% 17.97/2.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.97/2.75 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.97/2.75 # Starting new_bool_3 with 300s (1) cores
% 17.97/2.75 # Starting new_bool_1 with 300s (1) cores
% 17.97/2.75 # Starting sh5l with 300s (1) cores
% 17.97/2.75 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30781 completed with status 0
% 17.97/2.75 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 17.97/2.75 # Preprocessing class: FSMSSMSSSSSNFFN.
% 17.97/2.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.97/2.75 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.97/2.75 # No SInE strategy applied
% 17.97/2.75 # Search class: FGHSM-FFMF32-SFFFFFNN
% 17.97/2.75 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 17.97/2.75 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 17.97/2.75 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 17.97/2.75 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 17.97/2.75 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 17.97/2.75 # Starting H----_011_C18_F1_PI_SE_SP_S2S with 136s (1) cores
% 17.97/2.75 # G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with pid 30791 completed with status 0
% 17.97/2.75 # Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A
% 17.97/2.75 # Preprocessing class: FSMSSMSSSSSNFFN.
% 17.97/2.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.97/2.75 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.97/2.75 # No SInE strategy applied
% 17.97/2.75 # Search class: FGHSM-FFMF32-SFFFFFNN
% 17.97/2.75 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 17.97/2.75 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 17.97/2.75 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 17.97/2.75 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 17.97/2.75 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 17.97/2.75 # Preprocessing time : 0.001 s
% 17.97/2.75 # Presaturation interreduction done
% 17.97/2.75
% 17.97/2.75 # Proof found!
% 17.97/2.75 # SZS status Theorem
% 17.97/2.75 # SZS output start CNFRefutation
% See solution above
% 17.97/2.75 # Parsed axioms : 23
% 17.97/2.75 # Removed by relevancy pruning/SinE : 0
% 17.97/2.75 # Initial clauses : 37
% 17.97/2.75 # Removed in clause preprocessing : 3
% 17.97/2.75 # Initial clauses in saturation : 34
% 17.97/2.75 # Processed clauses : 6041
% 17.97/2.75 # ...of these trivial : 82
% 17.97/2.75 # ...subsumed : 5239
% 17.97/2.75 # ...remaining for further processing : 720
% 17.97/2.75 # Other redundant clauses eliminated : 5386
% 17.97/2.75 # Clauses deleted for lack of memory : 0
% 17.97/2.75 # Backward-subsumed : 40
% 17.97/2.75 # Backward-rewritten : 2
% 17.97/2.75 # Generated clauses : 155303
% 17.97/2.75 # ...of the previous two non-redundant : 147512
% 17.97/2.75 # ...aggressively subsumed : 0
% 17.97/2.75 # Contextual simplify-reflections : 22
% 17.97/2.75 # Paramodulations : 149837
% 17.97/2.75 # Factorizations : 58
% 17.97/2.75 # NegExts : 0
% 17.97/2.75 # Equation resolutions : 5408
% 17.97/2.75 # Total rewrite steps : 21186
% 17.97/2.75 # Propositional unsat checks : 0
% 17.97/2.75 # Propositional check models : 0
% 17.97/2.75 # Propositional check unsatisfiable : 0
% 17.97/2.75 # Propositional clauses : 0
% 17.97/2.75 # Propositional clauses after purity: 0
% 17.97/2.75 # Propositional unsat core size : 0
% 17.97/2.75 # Propositional preprocessing time : 0.000
% 17.97/2.75 # Propositional encoding time : 0.000
% 17.97/2.75 # Propositional solver time : 0.000
% 17.97/2.75 # Success case prop preproc time : 0.000
% 17.97/2.75 # Success case prop encoding time : 0.000
% 17.97/2.75 # Success case prop solver time : 0.000
% 17.97/2.75 # Current number of processed clauses : 638
% 17.97/2.75 # Positive orientable unit clauses : 34
% 17.97/2.75 # Positive unorientable unit clauses: 1
% 17.97/2.75 # Negative unit clauses : 116
% 17.97/2.75 # Non-unit-clauses : 487
% 17.97/2.75 # Current number of unprocessed clauses: 141377
% 17.97/2.75 # ...number of literals in the above : 706100
% 17.97/2.75 # Current number of archived formulas : 0
% 17.97/2.75 # Current number of archived clauses : 74
% 17.97/2.75 # Clause-clause subsumption calls (NU) : 41755
% 17.97/2.75 # Rec. Clause-clause subsumption calls : 19936
% 17.97/2.75 # Non-unit clause-clause subsumptions : 1814
% 17.97/2.75 # Unit Clause-clause subsumption calls : 2160
% 17.97/2.75 # Rewrite failures with RHS unbound : 0
% 17.97/2.75 # BW rewrite match attempts : 32
% 17.97/2.75 # BW rewrite match successes : 18
% 17.97/2.75 # Condensation attempts : 0
% 17.97/2.75 # Condensation successes : 0
% 17.97/2.75 # Termbank termtop insertions : 2582233
% 17.97/2.75
% 17.97/2.75 # -------------------------------------------------
% 17.97/2.75 # User time : 2.185 s
% 17.97/2.75 # System time : 0.073 s
% 17.97/2.75 # Total time : 2.258 s
% 17.97/2.75 # Maximum resident set size: 1780 pages
% 17.97/2.75
% 17.97/2.75 # -------------------------------------------------
% 17.97/2.75 # User time : 10.939 s
% 17.97/2.75 # System time : 0.313 s
% 17.97/2.75 # Total time : 11.252 s
% 17.97/2.75 # Maximum resident set size: 1692 pages
% 17.97/2.75 % E---3.1 exiting
% 17.97/2.75 % E---3.1 exiting
%------------------------------------------------------------------------------