TSTP Solution File: SET938+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET938+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : Tue May 21 02:56:36 EDT 2024
% Result : Theorem 1.94s 0.76s
% Output : CNFRefutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 45 ( 18 unt; 0 def)
% Number of atoms : 119 ( 22 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 121 ( 47 ~; 58 |; 10 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 5 ( 2 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 : 105 ( 7 sgn 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
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/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(t86_zfmisc_1,conjecture,
! [X1,X2] : subset(set_union2(powerset(set_difference(X1,X2)),powerset(set_difference(X2,X1))),powerset(symmetric_difference(X1,X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t86_zfmisc_1) ).
fof(d6_xboole_0,axiom,
! [X1,X2] : symmetric_difference(X1,X2) = set_union2(set_difference(X1,X2),set_difference(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d6_xboole_0) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(c_0_6,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( ~ in(X13,X12)
| subset(X13,X11)
| X12 != powerset(X11) )
& ( ~ subset(X14,X11)
| in(X14,X12)
| X12 != powerset(X11) )
& ( ~ in(esk1_2(X15,X16),X16)
| ~ subset(esk1_2(X15,X16),X15)
| X16 = powerset(X15) )
& ( in(esk1_2(X15,X16),X16)
| subset(esk1_2(X15,X16),X15)
| X16 = powerset(X15) ) ),
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)],[d1_zfmisc_1])])])])])])]) ).
fof(c_0_7,plain,
! [X27,X28,X29,X30,X31] :
( ( ~ subset(X27,X28)
| ~ in(X29,X27)
| in(X29,X28) )
& ( in(esk3_2(X30,X31),X30)
| subset(X30,X31) )
& ( ~ in(esk3_2(X30,X31),X31)
| subset(X30,X31) ) ),
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)],[d3_tarski])])])])])])]) ).
cnf(c_0_8,plain,
( subset(X1,X3)
| ~ in(X1,X2)
| X2 != powerset(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( in(X1,X3)
| ~ subset(X1,X2)
| X3 != powerset(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X18,X19,X20,X21,X22,X23,X24,X25] :
( ( ~ in(X21,X20)
| in(X21,X18)
| in(X21,X19)
| X20 != set_union2(X18,X19) )
& ( ~ in(X22,X18)
| in(X22,X20)
| X20 != set_union2(X18,X19) )
& ( ~ in(X22,X19)
| in(X22,X20)
| X20 != set_union2(X18,X19) )
& ( ~ in(esk2_3(X23,X24,X25),X23)
| ~ in(esk2_3(X23,X24,X25),X25)
| X25 = set_union2(X23,X24) )
& ( ~ in(esk2_3(X23,X24,X25),X24)
| ~ in(esk2_3(X23,X24,X25),X25)
| X25 = set_union2(X23,X24) )
& ( in(esk2_3(X23,X24,X25),X25)
| in(esk2_3(X23,X24,X25),X23)
| in(esk2_3(X23,X24,X25),X24)
| X25 = set_union2(X23,X24) ) ),
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_11,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( in(X1,X2)
| ~ in(X3,powerset(X2))
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( in(esk3_2(X1,X2),X1)
| in(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_19,negated_conjecture,
~ ! [X1,X2] : subset(set_union2(powerset(set_difference(X1,X2)),powerset(set_difference(X2,X1))),powerset(symmetric_difference(X1,X2))),
inference(assume_negation,[status(cth)],[t86_zfmisc_1]) ).
cnf(c_0_20,plain,
( in(X1,powerset(X2))
| ~ in(esk3_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_21,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( in(powerset(X1),powerset(X2))
| in(X3,X1)
| ~ in(X3,esk3_2(powerset(X1),X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_23,negated_conjecture,
~ subset(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(symmetric_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_19])])])]) ).
fof(c_0_24,plain,
! [X33,X34] : symmetric_difference(X33,X34) = set_union2(set_difference(X33,X34),set_difference(X34,X33)),
inference(variable_rename,[status(thm)],[d6_xboole_0]) ).
cnf(c_0_25,plain,
( in(X1,powerset(set_union2(X2,X3)))
| ~ in(esk3_2(X1,set_union2(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( in(esk3_2(esk3_2(powerset(X1),X2),X3),X1)
| in(esk3_2(powerset(X1),X2),powerset(X3))
| in(powerset(X1),powerset(X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
~ subset(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(symmetric_difference(esk6_0,esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
symmetric_difference(X1,X2) = set_union2(set_difference(X1,X2),set_difference(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
( in(esk3_2(powerset(X1),X2),powerset(set_union2(X3,X1)))
| in(powerset(X1),powerset(X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_30,plain,
! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_31,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X2 != set_union2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_32,negated_conjecture,
~ subset(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
in(powerset(X1),powerset(powerset(set_union2(X2,X1)))),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_34,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X3,X2)) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
in(esk3_2(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0)))),
inference(spm,[status(thm)],[c_0_32,c_0_14]) ).
cnf(c_0_37,negated_conjecture,
~ in(esk3_2(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),
inference(spm,[status(thm)],[c_0_32,c_0_15]) ).
cnf(c_0_38,plain,
( in(X1,powerset(set_union2(X2,X3)))
| ~ in(X1,powerset(X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
cnf(c_0_39,plain,
in(powerset(X1),powerset(powerset(set_union2(X1,X2)))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( in(esk3_2(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),powerset(set_difference(esk7_0,esk6_0)))
| in(esk3_2(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),powerset(set_difference(esk6_0,esk7_0))) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
~ in(esk3_2(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),powerset(set_difference(esk7_0,esk6_0))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( in(X1,powerset(set_union2(X2,X3)))
| ~ in(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
in(esk3_2(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),powerset(set_difference(esk6_0,esk7_0))),
inference(sr,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_42]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET938+1 : TPTP v8.2.0. Released v3.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 11:10:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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/benchmark/theBenchmark.p
% 1.94/0.76 # Version: 3.1.0
% 1.94/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.94/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.94/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.94/0.76 # Starting new_bool_3 with 300s (1) cores
% 1.94/0.76 # Starting new_bool_1 with 300s (1) cores
% 1.94/0.76 # Starting sh5l with 300s (1) cores
% 1.94/0.76 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31892 completed with status 0
% 1.94/0.76 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.94/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.94/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.94/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.94/0.76 # No SInE strategy applied
% 1.94/0.76 # Search class: FGHSM-FFMF32-MFFFFFNN
% 1.94/0.76 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.94/0.76 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S038I with 811s (1) cores
% 1.94/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.94/0.76 # Starting new_bool_3 with 136s (1) cores
% 1.94/0.76 # Starting new_bool_1 with 136s (1) cores
% 1.94/0.76 # Starting sh5l with 136s (1) cores
% 1.94/0.76 # G-E--_208_C18_F1_SE_CS_SP_PS_S038I with pid 31898 completed with status 0
% 1.94/0.76 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S038I
% 1.94/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.94/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.94/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.94/0.76 # No SInE strategy applied
% 1.94/0.76 # Search class: FGHSM-FFMF32-MFFFFFNN
% 1.94/0.76 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.94/0.76 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S038I with 811s (1) cores
% 1.94/0.76 # Preprocessing time : 0.002 s
% 1.94/0.76 # Presaturation interreduction done
% 1.94/0.76
% 1.94/0.76 # Proof found!
% 1.94/0.76 # SZS status Theorem
% 1.94/0.76 # SZS output start CNFRefutation
% See solution above
% 1.94/0.76 # Parsed axioms : 14
% 1.94/0.76 # Removed by relevancy pruning/SinE : 0
% 1.94/0.76 # Initial clauses : 24
% 1.94/0.76 # Removed in clause preprocessing : 1
% 1.94/0.76 # Initial clauses in saturation : 23
% 1.94/0.76 # Processed clauses : 1998
% 1.94/0.76 # ...of these trivial : 25
% 1.94/0.76 # ...subsumed : 1594
% 1.94/0.76 # ...remaining for further processing : 379
% 1.94/0.76 # Other redundant clauses eliminated : 5
% 1.94/0.76 # Clauses deleted for lack of memory : 0
% 1.94/0.76 # Backward-subsumed : 15
% 1.94/0.76 # Backward-rewritten : 0
% 1.94/0.76 # Generated clauses : 9946
% 1.94/0.76 # ...of the previous two non-redundant : 9399
% 1.94/0.76 # ...aggressively subsumed : 0
% 1.94/0.76 # Contextual simplify-reflections : 2
% 1.94/0.76 # Paramodulations : 9578
% 1.94/0.76 # Factorizations : 362
% 1.94/0.76 # NegExts : 0
% 1.94/0.76 # Equation resolutions : 5
% 1.94/0.76 # Disequality decompositions : 0
% 1.94/0.76 # Total rewrite steps : 710
% 1.94/0.76 # ...of those cached : 535
% 1.94/0.76 # Propositional unsat checks : 0
% 1.94/0.76 # Propositional check models : 0
% 1.94/0.76 # Propositional check unsatisfiable : 0
% 1.94/0.76 # Propositional clauses : 0
% 1.94/0.76 # Propositional clauses after purity: 0
% 1.94/0.76 # Propositional unsat core size : 0
% 1.94/0.76 # Propositional preprocessing time : 0.000
% 1.94/0.76 # Propositional encoding time : 0.000
% 1.94/0.76 # Propositional solver time : 0.000
% 1.94/0.76 # Success case prop preproc time : 0.000
% 1.94/0.76 # Success case prop encoding time : 0.000
% 1.94/0.76 # Success case prop solver time : 0.000
% 1.94/0.76 # Current number of processed clauses : 336
% 1.94/0.76 # Positive orientable unit clauses : 23
% 1.94/0.76 # Positive unorientable unit clauses: 1
% 1.94/0.76 # Negative unit clauses : 106
% 1.94/0.76 # Non-unit-clauses : 206
% 1.94/0.76 # Current number of unprocessed clauses: 7417
% 1.94/0.76 # ...number of literals in the above : 37690
% 1.94/0.76 # Current number of archived formulas : 0
% 1.94/0.76 # Current number of archived clauses : 39
% 1.94/0.76 # Clause-clause subsumption calls (NU) : 23078
% 1.94/0.76 # Rec. Clause-clause subsumption calls : 9451
% 1.94/0.76 # Non-unit clause-clause subsumptions : 409
% 1.94/0.76 # Unit Clause-clause subsumption calls : 2311
% 1.94/0.76 # Rewrite failures with RHS unbound : 0
% 1.94/0.76 # BW rewrite match attempts : 79
% 1.94/0.76 # BW rewrite match successes : 12
% 1.94/0.76 # Condensation attempts : 0
% 1.94/0.76 # Condensation successes : 0
% 1.94/0.76 # Termbank termtop insertions : 209543
% 1.94/0.76 # Search garbage collected termcells : 410
% 1.94/0.76
% 1.94/0.76 # -------------------------------------------------
% 1.94/0.76 # User time : 0.229 s
% 1.94/0.76 # System time : 0.009 s
% 1.94/0.76 # Total time : 0.238 s
% 1.94/0.76 # Maximum resident set size: 1748 pages
% 1.94/0.76
% 1.94/0.76 # -------------------------------------------------
% 1.94/0.76 # User time : 1.127 s
% 1.94/0.76 # System time : 0.020 s
% 1.94/0.76 # Total time : 1.147 s
% 1.94/0.76 # Maximum resident set size: 1696 pages
% 1.94/0.76 % E---3.1 exiting
% 1.94/0.76 % E exiting
%------------------------------------------------------------------------------