%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET001-1 : TPTP v9.2.1. Released v1.0.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 : n013.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:06:45 PM UTC 2026
% Result : Unsatisfiable 0.25s 1.61s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 9 unt; 2 nHn; 21 RR)
% Number of literals : 41 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subsets_axiom2,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',subsets_axiom2) ).
cnf(subsets_are_set_equal_sets,axiom,
( equal_sets(X2,X1)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',subsets_are_set_equal_sets) ).
cnf(membership_in_subsets,axiom,
( member(X1,X3)
| ~ member(X1,X2)
| ~ subset(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',membership_in_subsets) ).
cnf(subsets_axiom1,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',subsets_axiom1) ).
cnf(set_equal_sets_are_subsets1,axiom,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',set_equal_sets_are_subsets1) ).
cnf(set_equal_sets_are_subsets2,axiom,
( subset(X2,X1)
| ~ equal_sets(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',set_equal_sets_are_subsets2) ).
cnf(prove_element_of_bb,negated_conjecture,
~ member(element_of_b,bb),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_element_of_bb) ).
cnf(b_equals_bb,hypothesis,
equal_sets(b,bb),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_equals_bb) ).
cnf(element_of_b,hypothesis,
member(element_of_b,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_of_b) ).
cnf(i_0_9,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
subsets_axiom2,
[final] ).
cnf(i_0_10,axiom,
( equal_sets(X2,X1)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
subsets_are_set_equal_sets,
[final] ).
cnf(i_0_11,axiom,
( member(X1,X3)
| ~ member(X1,X2)
| ~ subset(X2,X3) ),
membership_in_subsets,
[final] ).
cnf(i_0_12,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
subsets_axiom1,
[final] ).
cnf(i_0_13,axiom,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
set_equal_sets_are_subsets1,
[final] ).
cnf(i_0_14,axiom,
( subset(X2,X1)
| ~ equal_sets(X1,X2) ),
set_equal_sets_are_subsets2,
[final] ).
cnf(i_0_15,negated_conjecture,
~ member(element_of_b,bb),
prove_element_of_bb,
[final] ).
cnf(i_0_16,hypothesis,
equal_sets(b,bb),
b_equals_bb,
[final] ).
cnf(i_0_17,hypothesis,
member(element_of_b,b),
element_of_b,
[final] ).
cnf(i_0_18,plain,
subset(b,bb),
inference(scs_inference,[],[i_0_16,i_0_13]) ).
cnf(i_0_19,plain,
( ~ equal_sets(X1,X2)
| subset(X1,X2) ),
inference(rename_variables,[],[i_0_13]) ).
cnf(i_0_20,plain,
subset(bb,b),
inference(scs_inference,[],[i_0_16,i_0_13,i_0_14]) ).
cnf(i_0_21,plain,
( ~ equal_sets(X1,X2)
| subset(X2,X1) ),
inference(rename_variables,[],[i_0_14]) ).
cnf(i_0_22,plain,
$false,
inference(scs_inference,[],[i_0_15,i_0_17,i_0_16,i_0_13,i_0_14,i_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET001-1 : TPTP v9.2.1. Released v1.0.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.14/0.32 % Computer : n013.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:03:11 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 0.25/1.61 % Version : CSE_E---1.7
% 0.25/1.61 % Problem : theBenchmark.p
% 0.25/1.61 % SZS status Unsatisfiable for theBenchmark.p
% 0.25/1.61 % SZS output start CNFRefutation
% See solution above
% 0.25/1.63 % Total time : 1.271s
%------------------------------------------------------------------------------