TSTP Solution File: SEU138+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU138+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:31 EDT 2023
% Result : Theorem 18.83s 2.82s
% Output : CNFRefutation 18.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 8 unt; 0 def)
% Number of atoms : 106 ( 28 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 128 ( 50 ~; 59 |; 13 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 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 : 81 ( 6 sgn; 32 !; 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.dmvE3cPXRx/E---3.1_25768.p',d4_xboole_0) ).
fof(t48_xboole_1,conjecture,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.dmvE3cPXRx/E---3.1_25768.p',t48_xboole_1) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dmvE3cPXRx/E---3.1_25768.p',d3_xboole_0) ).
fof(c_0_3,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_4,negated_conjecture,
~ ! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(assume_negation,[status(cth)],[t48_xboole_1]) ).
fof(c_0_5,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( in(X20,X17)
| ~ in(X20,X19)
| X19 != set_intersection2(X17,X18) )
& ( in(X20,X18)
| ~ in(X20,X19)
| X19 != set_intersection2(X17,X18) )
& ( ~ in(X21,X17)
| ~ in(X21,X18)
| in(X21,X19)
| X19 != set_intersection2(X17,X18) )
& ( ~ in(esk2_3(X22,X23,X24),X24)
| ~ in(esk2_3(X22,X23,X24),X22)
| ~ in(esk2_3(X22,X23,X24),X23)
| X24 = set_intersection2(X22,X23) )
& ( in(esk2_3(X22,X23,X24),X22)
| in(esk2_3(X22,X23,X24),X24)
| X24 = set_intersection2(X22,X23) )
& ( in(esk2_3(X22,X23,X24),X23)
| in(esk2_3(X22,X23,X24),X24)
| X24 = set_intersection2(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)],[d3_xboole_0])])])])])]) ).
fof(c_0_6,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_3])])])])])]) ).
fof(c_0_7,negated_conjecture,
set_difference(esk6_0,set_difference(esk6_0,esk7_0)) != set_intersection2(esk6_0,esk7_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_8,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X4 != set_difference(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
set_difference(esk6_0,set_difference(esk6_0,esk7_0)) != set_intersection2(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,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_6]) ).
cnf(c_0_12,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),esk6_0),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11])]),c_0_12]) ).
cnf(c_0_16,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,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_6]) ).
cnf(c_0_18,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_19,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_6]) ).
cnf(c_0_20,negated_conjecture,
( in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_difference(esk6_0,X1))
| in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,plain,
( set_intersection2(X1,X2) = set_difference(X3,X4)
| in(esk3_3(X3,X4,set_intersection2(X1,X2)),X4)
| ~ in(esk3_3(X3,X4,set_intersection2(X1,X2)),X3)
| ~ in(esk3_3(X3,X4,set_intersection2(X1,X2)),X2)
| ~ in(esk3_3(X3,X4,set_intersection2(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),esk7_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_10]),c_0_21]) ).
cnf(c_0_25,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_difference(esk6_0,esk7_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_24]),c_0_15])]),c_0_10]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU138+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 2400
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Mon Oct 2 08:33:19 EDT 2023
% 0.11/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.dmvE3cPXRx/E---3.1_25768.p
% 18.83/2.82 # Version: 3.1pre001
% 18.83/2.82 # Preprocessing class: FSMSSMSSSSSNFFN.
% 18.83/2.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.83/2.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.83/2.82 # Starting new_bool_3 with 300s (1) cores
% 18.83/2.82 # Starting new_bool_1 with 300s (1) cores
% 18.83/2.82 # Starting sh5l with 300s (1) cores
% 18.83/2.82 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25847 completed with status 0
% 18.83/2.82 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 18.83/2.82 # Preprocessing class: FSMSSMSSSSSNFFN.
% 18.83/2.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.83/2.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.83/2.82 # No SInE strategy applied
% 18.83/2.82 # Search class: FGHSM-FFMF32-SFFFFFNN
% 18.83/2.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 18.83/2.82 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 18.83/2.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 18.83/2.82 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 18.83/2.82 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 18.83/2.82 # Starting H----_011_C18_F1_PI_SE_SP_S2S with 136s (1) cores
% 18.83/2.82 # G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 25872 completed with status 0
% 18.83/2.82 # Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 18.83/2.82 # Preprocessing class: FSMSSMSSSSSNFFN.
% 18.83/2.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.83/2.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.83/2.82 # No SInE strategy applied
% 18.83/2.82 # Search class: FGHSM-FFMF32-SFFFFFNN
% 18.83/2.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 18.83/2.82 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 18.83/2.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 18.83/2.82 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 18.83/2.82 # Preprocessing time : 0.001 s
% 18.83/2.82 # Presaturation interreduction done
% 18.83/2.82
% 18.83/2.82 # Proof found!
% 18.83/2.82 # SZS status Theorem
% 18.83/2.82 # SZS output start CNFRefutation
% See solution above
% 18.83/2.82 # Parsed axioms : 21
% 18.83/2.82 # Removed by relevancy pruning/SinE : 0
% 18.83/2.82 # Initial clauses : 35
% 18.83/2.82 # Removed in clause preprocessing : 3
% 18.83/2.82 # Initial clauses in saturation : 32
% 18.83/2.82 # Processed clauses : 3857
% 18.83/2.82 # ...of these trivial : 33
% 18.83/2.82 # ...subsumed : 3132
% 18.83/2.82 # ...remaining for further processing : 692
% 18.83/2.82 # Other redundant clauses eliminated : 1957
% 18.83/2.82 # Clauses deleted for lack of memory : 0
% 18.83/2.82 # Backward-subsumed : 40
% 18.83/2.82 # Backward-rewritten : 32
% 18.83/2.82 # Generated clauses : 148143
% 18.83/2.82 # ...of the previous two non-redundant : 142863
% 18.83/2.82 # ...aggressively subsumed : 0
% 18.83/2.82 # Contextual simplify-reflections : 11
% 18.83/2.82 # Paramodulations : 146026
% 18.83/2.82 # Factorizations : 158
% 18.83/2.82 # NegExts : 0
% 18.83/2.82 # Equation resolutions : 1959
% 18.83/2.82 # Total rewrite steps : 9569
% 18.83/2.82 # Propositional unsat checks : 0
% 18.83/2.82 # Propositional check models : 0
% 18.83/2.82 # Propositional check unsatisfiable : 0
% 18.83/2.82 # Propositional clauses : 0
% 18.83/2.82 # Propositional clauses after purity: 0
% 18.83/2.82 # Propositional unsat core size : 0
% 18.83/2.82 # Propositional preprocessing time : 0.000
% 18.83/2.82 # Propositional encoding time : 0.000
% 18.83/2.82 # Propositional solver time : 0.000
% 18.83/2.82 # Success case prop preproc time : 0.000
% 18.83/2.82 # Success case prop encoding time : 0.000
% 18.83/2.82 # Success case prop solver time : 0.000
% 18.83/2.82 # Current number of processed clauses : 582
% 18.83/2.82 # Positive orientable unit clauses : 29
% 18.83/2.82 # Positive unorientable unit clauses: 1
% 18.83/2.82 # Negative unit clauses : 21
% 18.83/2.82 # Non-unit-clauses : 531
% 18.83/2.82 # Current number of unprocessed clauses: 138896
% 18.83/2.82 # ...number of literals in the above : 786353
% 18.83/2.82 # Current number of archived formulas : 0
% 18.83/2.82 # Current number of archived clauses : 102
% 18.83/2.82 # Clause-clause subsumption calls (NU) : 54612
% 18.83/2.82 # Rec. Clause-clause subsumption calls : 30953
% 18.83/2.82 # Non-unit clause-clause subsumptions : 2131
% 18.83/2.82 # Unit Clause-clause subsumption calls : 1182
% 18.83/2.82 # Rewrite failures with RHS unbound : 0
% 18.83/2.82 # BW rewrite match attempts : 44
% 18.83/2.82 # BW rewrite match successes : 20
% 18.83/2.82 # Condensation attempts : 0
% 18.83/2.82 # Condensation successes : 0
% 18.83/2.82 # Termbank termtop insertions : 3203160
% 18.83/2.82
% 18.83/2.82 # -------------------------------------------------
% 18.83/2.82 # User time : 2.217 s
% 18.83/2.82 # System time : 0.055 s
% 18.83/2.82 # Total time : 2.272 s
% 18.83/2.82 # Maximum resident set size: 1768 pages
% 18.83/2.82
% 18.83/2.82 # -------------------------------------------------
% 18.83/2.82 # User time : 11.143 s
% 18.83/2.82 # System time : 0.378 s
% 18.83/2.82 # Total time : 11.521 s
% 18.83/2.82 # Maximum resident set size: 1688 pages
% 18.83/2.82 % E---3.1 exiting
%------------------------------------------------------------------------------