%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET912+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:08:57 PM UTC 2026
% Result : Theorem 0.27s 1.60s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 34
% Syntax : Number of formulae : 73 ( 32 unt; 0 def)
% Number of atoms : 136 ( 56 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 127 ( 64 ~; 50 |; 7 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 139 ( 8 sgn 36 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t53_zfmisc_1,conjecture,
! [X1,X2,X3] :
( ( in(X1,X2)
& in(X3,X2) )
=> set_intersection2(unordered_pair(X1,X3),X2) = unordered_pair(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t53_zfmisc_1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(rc2_xboole_0,axiom,
? [X1] : ~ empty(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
fof(t38_zfmisc_1,axiom,
! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),X3)
<=> ( in(X1,X3)
& in(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(t28_xboole_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(idempotence_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
fof(i_0_10,negated_conjecture,
~ ! [X1,X2,X3] :
( ( in(X1,X2)
& in(X3,X2) )
=> set_intersection2(unordered_pair(X1,X3),X2) = unordered_pair(X1,X3) ),
inference(assume_negation,[status(cth)],[t53_zfmisc_1]) ).
fof(i_0_11,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(i_0_12,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[rc2_xboole_0]) ).
fof(i_0_13,plain,
! [X36,X37,X38] :
( ( in(X36,X38)
| ~ subset(unordered_pair(X36,X37),X38) )
& ( in(X37,X38)
| ~ subset(unordered_pair(X36,X37),X38) )
& ( ~ in(X36,X38)
| ~ in(X37,X38)
| subset(unordered_pair(X36,X37),X38) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t38_zfmisc_1])])]) ).
fof(i_0_14,negated_conjecture,
( in(esk3_0,esk4_0)
& in(esk5_0,esk4_0)
& set_intersection2(unordered_pair(esk3_0,esk5_0),esk4_0) != unordered_pair(esk3_0,esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_10])])]) ).
fof(i_0_15,plain,
! [X24,X25] :
( ~ in(X24,X25)
| ~ in(X25,X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_11])]) ).
fof(i_0_16,plain,
! [X34,X35] :
( ~ subset(X34,X35)
| set_intersection2(X34,X35) = X34 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])]) ).
fof(i_0_17,plain,
! [X28,X29] : set_intersection2(X28,X29) = set_intersection2(X29,X28),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(i_0_18,plain,
! [X26,X27] : unordered_pair(X26,X27) = unordered_pair(X27,X26),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(i_0_19,plain,
! [X30] : set_intersection2(X30,X30) = X30,
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[idempotence_k3_xboole_0])]) ).
fof(i_0_20,plain,
! [X33] : subset(X33,X33),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(i_0_21,plain,
~ empty(esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[i_0_12])]) ).
fof(i_0_22,plain,
empty(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(i_0_23,plain,
( subset(unordered_pair(X1,X3),X2)
| ~ in(X1,X2)
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[i_0_13]),
[final] ).
cnf(i_0_24,plain,
( in(X1,X2)
| ~ subset(unordered_pair(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[i_0_13]),
[final] ).
cnf(i_0_25,plain,
( in(X1,X2)
| ~ subset(unordered_pair(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[i_0_13]),
[final] ).
cnf(i_0_26,negated_conjecture,
set_intersection2(unordered_pair(esk3_0,esk5_0),esk4_0) != unordered_pair(esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[i_0_14]),
[final] ).
cnf(i_0_27,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_15]),
[final] ).
cnf(i_0_28,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_16]),
[final] ).
cnf(i_0_29,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[i_0_17]),
[final] ).
cnf(i_0_30,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[i_0_18]),
[final] ).
cnf(i_0_31,plain,
set_intersection2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[i_0_19]),
[final] ).
cnf(i_0_32,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[i_0_20]),
[final] ).
cnf(i_0_33,negated_conjecture,
in(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[i_0_14]),
[final] ).
cnf(i_0_34,negated_conjecture,
in(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[i_0_14]),
[final] ).
cnf(i_0_35,plain,
~ empty(esk2_0),
inference(split_conjunct,[status(thm)],[i_0_21]),
[final] ).
cnf(i_0_36,plain,
empty(esk1_0),
inference(split_conjunct,[status(thm)],[i_0_22]),
[final] ).
cnf(i_0_37,axiom,
X1 = X1 ).
cnf(i_0_38,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_39,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_40,axiom,
( X1 != X2
| unordered_pair(X1,X3) = unordered_pair(X2,X3) ) ).
cnf(i_0_41,axiom,
( X1 != X2
| unordered_pair(X3,X1) = unordered_pair(X3,X2) ) ).
cnf(i_0_42,axiom,
( X1 != X2
| set_intersection2(X1,X3) = set_intersection2(X2,X3) ) ).
cnf(i_0_43,axiom,
( X1 != X2
| set_intersection2(X3,X1) = set_intersection2(X3,X2) ) ).
cnf(i_0_44,axiom,
( X1 != X2
| ~ subset(X1,X3)
| subset(X2,X3) ) ).
cnf(i_0_45,axiom,
( X1 != X2
| ~ subset(X3,X1)
| subset(X3,X2) ) ).
cnf(i_0_46,axiom,
( X1 != X2
| ~ in(X1,X3)
| in(X2,X3) ) ).
cnf(i_0_47,axiom,
( X1 != X2
| ~ in(X3,X1)
| in(X3,X2) ) ).
cnf(i_0_48,axiom,
( X1 != X2
| ~ empty(X1)
| empty(X2) ) ).
cnf(i_0_37_001,axiom,
X1 = X1 ).
cnf(i_0_38_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_39_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_40_004,axiom,
( X1 != X2
| unordered_pair(X1,X3) = unordered_pair(X2,X3) ) ).
cnf(i_0_41_005,axiom,
( X1 != X2
| unordered_pair(X3,X1) = unordered_pair(X3,X2) ) ).
cnf(i_0_42_006,axiom,
( X1 != X2
| set_intersection2(X1,X3) = set_intersection2(X2,X3) ) ).
cnf(i_0_43_007,axiom,
( X1 != X2
| set_intersection2(X3,X1) = set_intersection2(X3,X2) ) ).
cnf(i_0_44_008,axiom,
( X1 != X2
| ~ subset(X1,X3)
| subset(X2,X3) ) ).
cnf(i_0_45_009,axiom,
( X1 != X2
| ~ subset(X3,X1)
| subset(X3,X2) ) ).
cnf(i_0_46_010,axiom,
( X1 != X2
| ~ in(X1,X3)
| in(X2,X3) ) ).
cnf(i_0_47_011,axiom,
( X1 != X2
| ~ in(X3,X1)
| in(X3,X2) ) ).
cnf(i_0_48_012,axiom,
( X1 != X2
| ~ empty(X1)
| empty(X2) ) ).
cnf(i_0_49,plain,
~ subset(unordered_pair(esk3_0,esk5_0),esk4_0),
inference(scs_inference,[],[i_0_26,i_0_28]) ).
cnf(i_0_50,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(rename_variables,[],[i_0_28]) ).
cnf(i_0_51,plain,
~ in(esk4_0,esk5_0),
inference(scs_inference,[],[i_0_26,i_0_33,i_0_28,i_0_27]) ).
cnf(i_0_52,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(rename_variables,[],[i_0_27]) ).
cnf(i_0_53,plain,
X1 = set_intersection2(X1,X1),
inference(scs_inference,[],[i_0_26,i_0_33,i_0_31,i_0_28,i_0_27,i_0_38]) ).
cnf(i_0_54,plain,
in(X1,unordered_pair(X1,X2)),
inference(scs_inference,[],[i_0_26,i_0_33,i_0_32,i_0_31,i_0_28,i_0_27,i_0_38,i_0_24]) ).
cnf(i_0_55,plain,
subset(X1,X1),
inference(rename_variables,[],[i_0_32]) ).
cnf(i_0_56,plain,
( ~ subset(unordered_pair(X1,X2),X3)
| in(X1,X3) ),
inference(rename_variables,[],[i_0_24]) ).
cnf(i_0_57,plain,
in(X1,unordered_pair(X2,X1)),
inference(scs_inference,[],[i_0_26,i_0_33,i_0_32,i_0_55,i_0_31,i_0_28,i_0_27,i_0_38,i_0_24,i_0_25]) ).
cnf(i_0_58,plain,
subset(X1,X1),
inference(rename_variables,[],[i_0_32]) ).
cnf(i_0_59,plain,
( ~ subset(unordered_pair(X1,X2),X3)
| in(X2,X3) ),
inference(rename_variables,[],[i_0_25]) ).
cnf(i_0_60,plain,
$false,
inference(scs_inference,[],[i_0_26,i_0_33,i_0_34,i_0_32,i_0_55,i_0_31,i_0_28,i_0_27,i_0_38,i_0_24,i_0_25,i_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET912+1 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.11 % 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.14/0.32 % Computer : n007.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 02:38:53 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 0.27/1.60 % Version : CSE_E---1.7
% 0.27/1.60 % Problem : theBenchmark.p
% 0.27/1.60 % SZS status Theorem for theBenchmark.p
% 0.27/1.60 % SZS output start CNFRefutation
% See solution above
% 0.27/1.64 % Total time : 1.270s
%------------------------------------------------------------------------------