%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET442-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 : n029.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:51 PM UTC 2026
% Result : Unsatisfiable 2.54s 2.13s
% Output : CNFRefutation 2.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 34 ( 12 unt; 4 nHn; 24 RR)
% Number of literals : 65 ( 12 equ; 30 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 64 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
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(function1,axiom,
( subclass(X1,cross_product(universal_class,universal_class))
| ~ function(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',function1) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction2) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(prove_restrict_a_function_2,negated_conjecture,
restrict(xf,universal_class,universal_class) != xf,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_restrict_a_function_2) ).
cnf(prove_restrict_a_function_1,negated_conjecture,
function(xf),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_restrict_a_function_1) ).
cnf(c_0_11,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_12,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_13,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_14,axiom,
( subclass(X1,cross_product(universal_class,universal_class))
| ~ function(X1) ),
function1 ).
cnf(c_0_15,plain,
( subclass(X1,intersection(X2,X3))
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_17,plain,
( member(X1,cross_product(universal_class,universal_class))
| ~ function(X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_19,plain,
( subclass(X1,intersection(X2,X1))
| ~ member(not_subclass_element(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( member(not_subclass_element(X1,X2),cross_product(universal_class,universal_class))
| subclass(X1,X2)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_22,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_23,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_24,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_25,plain,
( subclass(X1,intersection(cross_product(universal_class,universal_class),X1))
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
restrict(xf,universal_class,universal_class) != xf,
prove_restrict_a_function_2 ).
cnf(c_0_28,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( intersection(cross_product(universal_class,universal_class),X1) = X1
| ~ function(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_30,negated_conjecture,
intersection(xf,cross_product(universal_class,universal_class)) != xf,
inference(rw,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_31,plain,
( intersection(X1,cross_product(universal_class,universal_class)) = X1
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
function(xf),
prove_restrict_a_function_1 ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET442-6 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.12 % 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.16/0.33 % Computer : n029.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:22:59 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 2.54/2.13 % Version : CSE_E---1.7
% 2.54/2.13 % Problem : theBenchmark.p
% 2.54/2.13 % SZS status Unsatisfiable for theBenchmark.p
% 2.54/2.13 % SZS output start CNFRefutation
% See solution above
% 2.54/2.13 % Total time : 1.372s
%------------------------------------------------------------------------------