%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET199-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 : n026.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:35 PM UTC 2026
% Result : Unsatisfiable 1.56s 1.81s
% Output : CNFRefutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 38 ( 12 unt; 7 nHn; 26 RR)
% Number of literals : 71 ( 3 equ; 28 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 59 ( 7 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(prove_greatest_lower_bound_2,negated_conjecture,
subclass(z,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_greatest_lower_bound_2) ).
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(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
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(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(prove_greatest_lower_bound_1,negated_conjecture,
subclass(z,x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_greatest_lower_bound_1) ).
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_greatest_lower_bound_3,negated_conjecture,
~ subclass(z,intersection(x,y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_greatest_lower_bound_3) ).
cnf(c_0_9,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_10,negated_conjecture,
subclass(z,y),
prove_greatest_lower_bound_2 ).
cnf(c_0_11,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_12,negated_conjecture,
( member(X1,y)
| ~ member(X1,z) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_14,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_15,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_16,negated_conjecture,
subclass(z,x),
prove_greatest_lower_bound_1 ).
cnf(c_0_17,negated_conjecture,
( subclass(X1,y)
| ~ member(not_subclass_element(X1,y),z) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,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_15]) ).
cnf(c_0_20,negated_conjecture,
( member(X1,x)
| ~ member(X1,z) ),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
subclass(intersection(z,X1),y),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( subclass(X1,intersection(X2,X1))
| ~ member(not_subclass_element(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_23,negated_conjecture,
( subclass(X1,x)
| ~ member(not_subclass_element(X1,x),z) ),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( member(X1,y)
| ~ member(X1,intersection(z,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_21]) ).
cnf(c_0_25,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_26,plain,
subclass(X1,intersection(X1,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_27,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_28,negated_conjecture,
subclass(intersection(z,X1),x),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_29,negated_conjecture,
( member(not_subclass_element(intersection(z,X1),X2),y)
| subclass(intersection(z,X1),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_14]) ).
cnf(c_0_30,plain,
intersection(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_31,negated_conjecture,
( member(X1,x)
| ~ member(X1,intersection(z,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( member(not_subclass_element(z,X1),y)
| subclass(z,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( member(not_subclass_element(intersection(z,X1),X2),x)
| subclass(intersection(z,X1),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_14]) ).
cnf(c_0_34,negated_conjecture,
( subclass(z,intersection(X1,y))
| ~ member(not_subclass_element(z,intersection(X1,y)),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( member(not_subclass_element(z,X1),x)
| subclass(z,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
~ subclass(z,intersection(x,y)),
prove_greatest_lower_bound_3 ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET199-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.13/0.32 % Computer : n026.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue May 5 02:15:23 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.56/1.81 % Version : CSE_E---1.7
% 1.56/1.81 % Problem : theBenchmark.p
% 1.56/1.81 % SZS status Unsatisfiable for theBenchmark.p
% 1.56/1.81 % SZS output start CNFRefutation
% See solution above
% 1.56/1.81 % Total time : 1.374s
%------------------------------------------------------------------------------