TSTP Solution File: SEU136+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU136+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 115.73s 15.37s
% Output : CNFRefutation 115.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 15 unt; 0 def)
% Number of atoms : 99 ( 32 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 112 ( 44 ~; 50 |; 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 : 80 ( 4 sgn; 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t40_xboole_1,conjecture,
! [X1,X2] : set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.Vi9AuXDdLJ/E---3.1_2756.p',t40_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.Vi9AuXDdLJ/E---3.1_2756.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.Vi9AuXDdLJ/E---3.1_2756.p',d4_xboole_0) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.Vi9AuXDdLJ/E---3.1_2756.p',commutativity_k2_xboole_0) ).
fof(t39_xboole_1,lemma,
! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.Vi9AuXDdLJ/E---3.1_2756.p',t39_xboole_1) ).
fof(c_0_5,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_6,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( ~ in(X20,X19)
| in(X20,X17)
| in(X20,X18)
| X19 != set_union2(X17,X18) )
& ( ~ in(X21,X17)
| in(X21,X19)
| X19 != set_union2(X17,X18) )
& ( ~ in(X21,X18)
| in(X21,X19)
| X19 != set_union2(X17,X18) )
& ( ~ in(esk2_3(X22,X23,X24),X22)
| ~ in(esk2_3(X22,X23,X24),X24)
| X24 = set_union2(X22,X23) )
& ( ~ in(esk2_3(X22,X23,X24),X23)
| ~ in(esk2_3(X22,X23,X24),X24)
| X24 = set_union2(X22,X23) )
& ( in(esk2_3(X22,X23,X24),X24)
| in(esk2_3(X22,X23,X24),X22)
| in(esk2_3(X22,X23,X24),X23)
| X24 = set_union2(X22,X23) ) ),
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_difference(set_union2(esk10_0,esk11_0),esk11_0) != set_difference(esk10_0,esk11_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,plain,
! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_10,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,lemma,
! [X93,X94] : set_union2(X93,set_difference(X94,X93)) = set_union2(X93,X94),
inference(variable_rename,[status(thm)],[t39_xboole_1]) ).
fof(c_0_12,plain,
! [X41,X42,X43,X44,X45,X46,X47,X48] :
( ( in(X44,X41)
| ~ in(X44,X43)
| X43 != set_difference(X41,X42) )
& ( ~ in(X44,X42)
| ~ in(X44,X43)
| X43 != set_difference(X41,X42) )
& ( ~ in(X45,X41)
| in(X45,X42)
| in(X45,X43)
| X43 != set_difference(X41,X42) )
& ( ~ in(esk5_3(X46,X47,X48),X48)
| ~ in(esk5_3(X46,X47,X48),X46)
| in(esk5_3(X46,X47,X48),X47)
| X48 = set_difference(X46,X47) )
& ( in(esk5_3(X46,X47,X48),X46)
| in(esk5_3(X46,X47,X48),X48)
| X48 = set_difference(X46,X47) )
& ( ~ in(esk5_3(X46,X47,X48),X47)
| in(esk5_3(X46,X47,X48),X48)
| X48 = set_difference(X46,X47) ) ),
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_13,negated_conjecture,
set_difference(set_union2(esk10_0,esk11_0),esk11_0) != set_difference(esk10_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_16,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
set_difference(set_union2(esk11_0,esk10_0),esk11_0) != set_difference(esk10_0,esk11_0),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( in(esk5_3(X1,X2,X3),X1)
| in(esk5_3(X1,X2,X3),X3)
| X3 = set_difference(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,lemma,
( in(X1,set_union2(X2,X3))
| ~ in(X1,set_difference(X3,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( in(esk5_3(X1,X2,X3),X3)
| X3 = set_difference(X1,X2)
| ~ in(esk5_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_23,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_24,plain,
( in(esk5_3(X1,X2,X3),X2)
| X3 = set_difference(X1,X2)
| ~ in(esk5_3(X1,X2,X3),X3)
| ~ in(esk5_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
in(esk5_3(set_union2(esk11_0,esk10_0),esk11_0,set_difference(esk10_0,esk11_0)),set_union2(esk11_0,esk10_0)),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19])]),c_0_20]) ).
cnf(c_0_26,negated_conjecture,
~ in(esk5_3(set_union2(esk11_0,esk10_0),esk11_0,set_difference(esk10_0,esk11_0)),esk11_0),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_21])]),c_0_22]) ).
cnf(c_0_27,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X3,X2)) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
~ in(esk5_3(set_union2(esk11_0,esk10_0),esk11_0,set_difference(esk10_0,esk11_0)),set_difference(esk10_0,esk11_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_24])]),c_0_25])]),c_0_26]) ).
cnf(c_0_29,lemma,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,set_union2(X3,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_30,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU136+2 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 08:55:29 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.Vi9AuXDdLJ/E---3.1_2756.p
% 115.73/15.37 # Version: 3.1pre001
% 115.73/15.37 # Preprocessing class: FSMSSMSSSSSNFFN.
% 115.73/15.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 115.73/15.37 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 115.73/15.37 # Starting new_bool_3 with 300s (1) cores
% 115.73/15.37 # Starting new_bool_1 with 300s (1) cores
% 115.73/15.37 # Starting sh5l with 300s (1) cores
% 115.73/15.37 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2868 completed with status 0
% 115.73/15.37 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 115.73/15.37 # Preprocessing class: FSMSSMSSSSSNFFN.
% 115.73/15.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 115.73/15.37 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 115.73/15.37 # No SInE strategy applied
% 115.73/15.37 # Search class: FGHSM-FFMF32-SFFFFFNN
% 115.73/15.37 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 115.73/15.37 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 115.73/15.37 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 115.73/15.37 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 115.73/15.37 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 115.73/15.37 # Starting H----_011_C18_F1_PI_SE_SP_S2S with 136s (1) cores
% 115.73/15.37 # G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with pid 2885 completed with status 0
% 115.73/15.37 # Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A
% 115.73/15.37 # Preprocessing class: FSMSSMSSSSSNFFN.
% 115.73/15.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 115.73/15.37 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 115.73/15.37 # No SInE strategy applied
% 115.73/15.37 # Search class: FGHSM-FFMF32-SFFFFFNN
% 115.73/15.37 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 115.73/15.37 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 115.73/15.37 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 115.73/15.37 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 115.73/15.37 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 115.73/15.37 # Preprocessing time : 0.002 s
% 115.73/15.37 # Presaturation interreduction done
% 115.73/15.37
% 115.73/15.37 # Proof found!
% 115.73/15.37 # SZS status Theorem
% 115.73/15.37 # SZS output start CNFRefutation
% See solution above
% 115.73/15.37 # Parsed axioms : 49
% 115.73/15.37 # Removed by relevancy pruning/SinE : 0
% 115.73/15.37 # Initial clauses : 76
% 115.73/15.37 # Removed in clause preprocessing : 4
% 115.73/15.37 # Initial clauses in saturation : 72
% 115.73/15.37 # Processed clauses : 25009
% 115.73/15.37 # ...of these trivial : 1067
% 115.73/15.37 # ...subsumed : 21669
% 115.73/15.37 # ...remaining for further processing : 2273
% 115.73/15.37 # Other redundant clauses eliminated : 11757
% 115.73/15.37 # Clauses deleted for lack of memory : 0
% 115.73/15.37 # Backward-subsumed : 101
% 115.73/15.37 # Backward-rewritten : 13
% 115.73/15.37 # Generated clauses : 1360356
% 115.73/15.37 # ...of the previous two non-redundant : 1279136
% 115.73/15.37 # ...aggressively subsumed : 0
% 115.73/15.37 # Contextual simplify-reflections : 47
% 115.73/15.37 # Paramodulations : 1348251
% 115.73/15.37 # Factorizations : 338
% 115.73/15.37 # NegExts : 0
% 115.73/15.37 # Equation resolutions : 11767
% 115.73/15.37 # Total rewrite steps : 225230
% 115.73/15.37 # Propositional unsat checks : 0
% 115.73/15.37 # Propositional check models : 0
% 115.73/15.37 # Propositional check unsatisfiable : 0
% 115.73/15.37 # Propositional clauses : 0
% 115.73/15.37 # Propositional clauses after purity: 0
% 115.73/15.37 # Propositional unsat core size : 0
% 115.73/15.37 # Propositional preprocessing time : 0.000
% 115.73/15.37 # Propositional encoding time : 0.000
% 115.73/15.37 # Propositional solver time : 0.000
% 115.73/15.37 # Success case prop preproc time : 0.000
% 115.73/15.37 # Success case prop encoding time : 0.000
% 115.73/15.37 # Success case prop solver time : 0.000
% 115.73/15.37 # Current number of processed clauses : 2079
% 115.73/15.37 # Positive orientable unit clauses : 130
% 115.73/15.37 # Positive unorientable unit clauses: 2
% 115.73/15.37 # Negative unit clauses : 334
% 115.73/15.37 # Non-unit-clauses : 1613
% 115.73/15.37 # Current number of unprocessed clauses: 1250785
% 115.73/15.37 # ...number of literals in the above : 6654952
% 115.73/15.37 # Current number of archived formulas : 0
% 115.73/15.37 # Current number of archived clauses : 182
% 115.73/15.37 # Clause-clause subsumption calls (NU) : 528914
% 115.73/15.37 # Rec. Clause-clause subsumption calls : 276798
% 115.73/15.37 # Non-unit clause-clause subsumptions : 6519
% 115.73/15.37 # Unit Clause-clause subsumption calls : 18280
% 115.73/15.37 # Rewrite failures with RHS unbound : 0
% 115.73/15.37 # BW rewrite match attempts : 72
% 115.73/15.37 # BW rewrite match successes : 37
% 115.73/15.37 # Condensation attempts : 0
% 115.73/15.37 # Condensation successes : 0
% 115.73/15.37 # Termbank termtop insertions : 23508751
% 115.73/15.37
% 115.73/15.37 # -------------------------------------------------
% 115.73/15.37 # User time : 13.642 s
% 115.73/15.37 # System time : 0.564 s
% 115.73/15.37 # Total time : 14.206 s
% 115.73/15.37 # Maximum resident set size: 1904 pages
% 115.73/15.37
% 115.73/15.37 # -------------------------------------------------
% 115.73/15.37 # User time : 68.889 s
% 115.73/15.37 # System time : 2.799 s
% 115.73/15.37 # Total time : 71.688 s
% 115.73/15.37 # Maximum resident set size: 1732 pages
% 115.73/15.37 % E---3.1 exiting
% 115.73/15.37 % E---3.1 exiting
%------------------------------------------------------------------------------