TSTP Solution File: SET944+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET944+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:21:23 EDT 2023
% Result : Theorem 8.15s 1.56s
% Output : CNFRefutation 8.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 9 unt; 0 def)
% Number of atoms : 118 ( 22 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 137 ( 54 ~; 63 |; 14 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 104 ( 4 sgn; 39 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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.jzWS2VCKkR/E---3.1_30776.p',d3_xboole_0) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.jzWS2VCKkR/E---3.1_30776.p',d4_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.jzWS2VCKkR/E---3.1_30776.p',d3_tarski) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.jzWS2VCKkR/E---3.1_30776.p',commutativity_k3_xboole_0) ).
fof(t97_zfmisc_1,conjecture,
! [X1,X2] : subset(union(set_intersection2(X1,X2)),set_intersection2(union(X1),union(X2))),
file('/export/starexec/sandbox/tmp/tmp.jzWS2VCKkR/E---3.1_30776.p',t97_zfmisc_1) ).
fof(c_0_5,plain,
! [X15,X16,X17,X18,X19,X20,X21,X22] :
( ( in(X18,X15)
| ~ in(X18,X17)
| X17 != set_intersection2(X15,X16) )
& ( in(X18,X16)
| ~ in(X18,X17)
| X17 != set_intersection2(X15,X16) )
& ( ~ in(X19,X15)
| ~ in(X19,X16)
| in(X19,X17)
| X17 != set_intersection2(X15,X16) )
& ( ~ in(esk2_3(X20,X21,X22),X22)
| ~ in(esk2_3(X20,X21,X22),X20)
| ~ in(esk2_3(X20,X21,X22),X21)
| X22 = set_intersection2(X20,X21) )
& ( in(esk2_3(X20,X21,X22),X20)
| in(esk2_3(X20,X21,X22),X22)
| X22 = set_intersection2(X20,X21) )
& ( in(esk2_3(X20,X21,X22),X21)
| in(esk2_3(X20,X21,X22),X22)
| X22 = set_intersection2(X20,X21) ) ),
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,
! [X24,X25,X26,X28,X29,X30,X31,X33] :
( ( in(X26,esk3_3(X24,X25,X26))
| ~ in(X26,X25)
| X25 != union(X24) )
& ( in(esk3_3(X24,X25,X26),X24)
| ~ in(X26,X25)
| X25 != union(X24) )
& ( ~ in(X28,X29)
| ~ in(X29,X24)
| in(X28,X25)
| X25 != union(X24) )
& ( ~ in(esk4_2(X30,X31),X31)
| ~ in(esk4_2(X30,X31),X33)
| ~ in(X33,X30)
| X31 = union(X30) )
& ( in(esk4_2(X30,X31),esk5_2(X30,X31))
| in(esk4_2(X30,X31),X31)
| X31 = union(X30) )
& ( in(esk5_2(X30,X31),X30)
| in(esk4_2(X30,X31),X31)
| X31 = union(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)],[d4_tarski])])])])])]) ).
cnf(c_0_7,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( in(esk3_3(X1,X2,X3),X1)
| ~ in(X3,X2)
| X2 != union(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X2,X3)
| X4 != union(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( in(esk3_3(X1,union(X1),X2),X1)
| ~ in(X2,union(X1)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( in(X1,union(X2))
| ~ in(X3,X2)
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( in(esk3_3(set_intersection2(X1,X2),union(set_intersection2(X1,X2)),X3),X2)
| ~ in(X3,union(set_intersection2(X1,X2))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( in(X1,esk3_3(X2,X3,X1))
| ~ in(X1,X3)
| X3 != union(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_15,plain,
! [X9,X10,X11,X12,X13] :
( ( ~ subset(X9,X10)
| ~ in(X11,X9)
| in(X11,X10) )
& ( in(esk1_2(X12,X13),X12)
| subset(X12,X13) )
& ( ~ in(esk1_2(X12,X13),X13)
| subset(X12,X13) ) ),
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])])])])])]) ).
cnf(c_0_16,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_17,plain,
( in(X1,union(X2))
| ~ in(X1,esk3_3(set_intersection2(X3,X2),union(set_intersection2(X3,X2)),X4))
| ~ in(X4,union(set_intersection2(X3,X2))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( in(X1,esk3_3(X2,union(X2),X1))
| ~ in(X1,union(X2)) ),
inference(er,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X7,X8] : set_intersection2(X7,X8) = set_intersection2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_20,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( in(X1,union(X2))
| ~ in(X1,union(set_intersection2(X3,X2))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( in(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_25,negated_conjecture,
~ ! [X1,X2] : subset(union(set_intersection2(X1,X2)),set_intersection2(union(X1),union(X2))),
inference(assume_negation,[status(cth)],[t97_zfmisc_1]) ).
cnf(c_0_26,plain,
( subset(X1,set_intersection2(X2,X3))
| ~ in(esk1_2(X1,set_intersection2(X2,X3)),X3)
| ~ in(esk1_2(X1,set_intersection2(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( subset(union(set_intersection2(X1,X2)),X3)
| in(esk1_2(union(set_intersection2(X1,X2)),X3),union(X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( in(X1,union(X2))
| ~ in(X1,union(set_intersection2(X2,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_24]) ).
fof(c_0_29,negated_conjecture,
~ subset(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])]) ).
cnf(c_0_30,plain,
( subset(union(set_intersection2(X1,X2)),set_intersection2(X3,union(X2)))
| ~ in(esk1_2(union(set_intersection2(X1,X2)),set_intersection2(X3,union(X2))),X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( subset(union(set_intersection2(X1,X2)),X3)
| in(esk1_2(union(set_intersection2(X1,X2)),X3),union(X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_32,negated_conjecture,
~ subset(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0))),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
subset(union(set_intersection2(X1,X2)),set_intersection2(union(X1),union(X2))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET944+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n015.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 17:05:46 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.jzWS2VCKkR/E---3.1_30776.p
% 8.15/1.56 # Version: 3.1pre001
% 8.15/1.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.15/1.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.15/1.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.15/1.56 # Starting new_bool_3 with 300s (1) cores
% 8.15/1.56 # Starting new_bool_1 with 300s (1) cores
% 8.15/1.56 # Starting sh5l with 300s (1) cores
% 8.15/1.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30854 completed with status 0
% 8.15/1.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 8.15/1.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.15/1.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.15/1.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.15/1.56 # No SInE strategy applied
% 8.15/1.56 # Search class: FGHSS-FFMF32-SFFFFFNN
% 8.15/1.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.15/1.56 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 511s (1) cores
% 8.15/1.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.15/1.56 # Starting new_bool_3 with 248s (1) cores
% 8.15/1.56 # Starting new_bool_1 with 241s (1) cores
% 8.15/1.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 8.15/1.56 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with pid 30865 completed with status 0
% 8.15/1.56 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 8.15/1.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.15/1.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.15/1.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.15/1.56 # No SInE strategy applied
% 8.15/1.56 # Search class: FGHSS-FFMF32-SFFFFFNN
% 8.15/1.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.15/1.56 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 511s (1) cores
% 8.15/1.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.15/1.56 # Starting new_bool_3 with 248s (1) cores
% 8.15/1.56 # Starting new_bool_1 with 241s (1) cores
% 8.15/1.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 8.15/1.56 # Preprocessing time : 0.001 s
% 8.15/1.56 # Presaturation interreduction done
% 8.15/1.56
% 8.15/1.56 # Proof found!
% 8.15/1.56 # SZS status Theorem
% 8.15/1.56 # SZS output start CNFRefutation
% See solution above
% 8.15/1.56 # Parsed axioms : 10
% 8.15/1.56 # Removed by relevancy pruning/SinE : 0
% 8.15/1.56 # Initial clauses : 22
% 8.15/1.56 # Removed in clause preprocessing : 0
% 8.15/1.56 # Initial clauses in saturation : 22
% 8.15/1.56 # Processed clauses : 5078
% 8.15/1.56 # ...of these trivial : 125
% 8.15/1.56 # ...subsumed : 4030
% 8.15/1.56 # ...remaining for further processing : 923
% 8.15/1.56 # Other redundant clauses eliminated : 6
% 8.15/1.56 # Clauses deleted for lack of memory : 0
% 8.15/1.56 # Backward-subsumed : 6
% 8.15/1.56 # Backward-rewritten : 68
% 8.15/1.56 # Generated clauses : 65248
% 8.15/1.56 # ...of the previous two non-redundant : 64322
% 8.15/1.56 # ...aggressively subsumed : 0
% 8.15/1.56 # Contextual simplify-reflections : 10
% 8.15/1.56 # Paramodulations : 65142
% 8.15/1.56 # Factorizations : 100
% 8.15/1.56 # NegExts : 0
% 8.15/1.56 # Equation resolutions : 6
% 8.15/1.56 # Total rewrite steps : 5424
% 8.15/1.56 # Propositional unsat checks : 0
% 8.15/1.56 # Propositional check models : 0
% 8.15/1.56 # Propositional check unsatisfiable : 0
% 8.15/1.56 # Propositional clauses : 0
% 8.15/1.56 # Propositional clauses after purity: 0
% 8.15/1.56 # Propositional unsat core size : 0
% 8.15/1.56 # Propositional preprocessing time : 0.000
% 8.15/1.56 # Propositional encoding time : 0.000
% 8.15/1.56 # Propositional solver time : 0.000
% 8.15/1.56 # Success case prop preproc time : 0.000
% 8.15/1.56 # Success case prop encoding time : 0.000
% 8.15/1.56 # Success case prop solver time : 0.000
% 8.15/1.56 # Current number of processed clauses : 821
% 8.15/1.56 # Positive orientable unit clauses : 41
% 8.15/1.56 # Positive unorientable unit clauses: 1
% 8.15/1.56 # Negative unit clauses : 36
% 8.15/1.56 # Non-unit-clauses : 743
% 8.15/1.56 # Current number of unprocessed clauses: 59117
% 8.15/1.56 # ...number of literals in the above : 299583
% 8.15/1.56 # Current number of archived formulas : 0
% 8.15/1.56 # Current number of archived clauses : 96
% 8.15/1.56 # Clause-clause subsumption calls (NU) : 129729
% 8.15/1.56 # Rec. Clause-clause subsumption calls : 68683
% 8.15/1.56 # Non-unit clause-clause subsumptions : 3171
% 8.15/1.56 # Unit Clause-clause subsumption calls : 1606
% 8.15/1.56 # Rewrite failures with RHS unbound : 0
% 8.15/1.56 # BW rewrite match attempts : 111
% 8.15/1.56 # BW rewrite match successes : 30
% 8.15/1.56 # Condensation attempts : 0
% 8.15/1.56 # Condensation successes : 0
% 8.15/1.56 # Termbank termtop insertions : 1731066
% 8.15/1.56
% 8.15/1.56 # -------------------------------------------------
% 8.15/1.56 # User time : 0.933 s
% 8.15/1.56 # System time : 0.035 s
% 8.15/1.56 # Total time : 0.968 s
% 8.15/1.56 # Maximum resident set size: 1744 pages
% 8.15/1.56
% 8.15/1.56 # -------------------------------------------------
% 8.15/1.56 # User time : 4.935 s
% 8.15/1.56 # System time : 0.112 s
% 8.15/1.56 # Total time : 5.047 s
% 8.15/1.56 # Maximum resident set size: 1676 pages
% 8.15/1.56 % E---3.1 exiting
% 8.15/1.56 % E---3.1 exiting
%------------------------------------------------------------------------------