%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET942+1 : TPTP v9.2.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n007.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 5 05:09:01 PM UTC 2026
% Result : Theorem 1.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 3 unt; 0 def)
% Number of atoms : 80 ( 10 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 87 ( 32 ~; 40 |; 9 &)
% ( 3 <=>; 3 =>; 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 : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 57 ( 0 sgn 23 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t95_zfmisc_1,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> subset(union(X1),union(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t95_zfmisc_1) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> subset(union(X1),union(X2)) ),
inference(assume_negation,[status(cth)],[t95_zfmisc_1]) ).
fof(c_0_4,plain,
! [X28,X29,X30,X32,X33,X34,X35,X37] :
( ( in(X30,esk2_3(X28,X29,X30))
| ~ in(X30,X29)
| X29 != union(X28) )
& ( in(esk2_3(X28,X29,X30),X28)
| ~ in(X30,X29)
| X29 != union(X28) )
& ( ~ in(X32,X33)
| ~ in(X33,X28)
| in(X32,X29)
| X29 != union(X28) )
& ( ~ in(esk3_2(X34,X35),X35)
| ~ in(esk3_2(X34,X35),X37)
| ~ in(X37,X34)
| X35 = union(X34) )
& ( in(esk3_2(X34,X35),esk4_2(X34,X35))
| in(esk3_2(X34,X35),X35)
| X35 = union(X34) )
& ( in(esk4_2(X34,X35),X34)
| in(esk3_2(X34,X35),X35)
| X35 = union(X34) ) ),
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])])])])])]) ).
fof(c_0_5,plain,
! [X22,X23,X24,X25,X26] :
( ( ~ subset(X22,X23)
| ~ in(X24,X22)
| in(X24,X23) )
& ( in(esk1_2(X25,X26),X25)
| subset(X25,X26) )
& ( ~ in(esk1_2(X25,X26),X26)
| subset(X25,X26) ) ),
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])])])])])]) ).
fof(c_0_6,negated_conjecture,
( subset(esk7_0,esk8_0)
& ~ subset(union(esk7_0),union(esk8_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_7,plain,
( in(esk2_3(X1,X2,X3),X1)
| ~ in(X3,X2)
| X2 != union(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
subset(esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(esk2_3(X1,union(X1),X2),X1)
| ~ in(X2,union(X1)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( in(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X2,X3)
| X4 != union(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( in(X1,esk8_0)
| ~ in(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
( subset(union(X1),X2)
| in(esk2_3(X1,union(X1),esk1_2(union(X1),X2)),X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( in(X1,esk2_3(X2,X3,X1))
| ~ in(X1,X3)
| X3 != union(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
( in(X1,union(X2))
| ~ in(X3,X2)
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( subset(union(esk7_0),X1)
| in(esk2_3(esk7_0,union(esk7_0),esk1_2(union(esk7_0),X1)),esk8_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( in(X1,esk2_3(X2,union(X2),X1))
| ~ in(X1,union(X2)) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( subset(union(esk7_0),X1)
| in(X2,union(esk8_0))
| ~ in(X2,esk2_3(esk7_0,union(esk7_0),esk1_2(union(esk7_0),X1))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( subset(union(X1),X2)
| in(esk1_2(union(X1),X2),esk2_3(X1,union(X1),esk1_2(union(X1),X2))) ),
inference(spm,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_21,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,negated_conjecture,
( subset(union(esk7_0),X1)
| in(esk1_2(union(esk7_0),X1),union(esk8_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
~ subset(union(esk7_0),union(esk8_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET942+1 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n007.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 02:39:24 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status Theorem for theBenchmark.p
% 1.26/1.72 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------