%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET071-6 : TPTP v9.2.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 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 5 05:07:09 PM UTC 2026
% Result : Unsatisfiable 1.26s 1.74s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 9 unt; 8 nHn; 12 RR)
% Number of literals : 38 ( 15 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(prove_null_unordered_pair_1,negated_conjecture,
unordered_pair(x,y) != null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_null_unordered_pair_1) ).
cnf(prove_null_unordered_pair_2,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_null_unordered_pair_2) ).
cnf(prove_null_unordered_pair_3,negated_conjecture,
~ member(y,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_null_unordered_pair_3) ).
cnf(c_0_7,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_8,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_9,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_11,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_12,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( regular(unordered_pair(X1,X2)) = X1
| regular(unordered_pair(X1,X2)) = X2
| unordered_pair(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_14,plain,
( regular(unordered_pair(X1,X2)) = X2
| unordered_pair(X1,X2) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
unordered_pair(x,y) != null_class,
prove_null_unordered_pair_1 ).
cnf(c_0_16,plain,
( unordered_pair(X1,X2) = null_class
| member(X1,universal_class)
| member(X2,universal_class) ),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
~ member(x,universal_class),
prove_null_unordered_pair_2 ).
cnf(c_0_18,negated_conjecture,
~ member(y,universal_class),
prove_null_unordered_pair_3 ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET071-6 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.08/0.33 % Computer : n012.cluster.edu
% 0.08/0.33 % Model : x86_64 x86_64
% 0.08/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.33 % Memory : 8042.1875MB
% 0.08/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.33 % CPULimit : 300
% 0.08/0.33 % WCLimit : 300
% 0.08/0.33 % DateTime : Tue May 5 02:08:46 EDT 2026
% 0.11/0.33 % CPUTime :
% 0.11/0.34 % start to proof: theBenchmark
% 1.26/1.74 % Version : CSE_E---1.7
% 1.26/1.74 % Problem : theBenchmark.p
% 1.26/1.74 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.74 % SZS output start CNFRefutation
% See solution above
% 1.26/1.74 % Total time : 1.366s
%------------------------------------------------------------------------------