%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET027-4 : 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 : n022.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:57 PM UTC 2026
% Result : Unsatisfiable 1.38s 1.75s
% Output : CNFRefutation 1.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 7 unt; 2 nHn; 15 RR)
% Number of literals : 29 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subset1,axiom,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',subset1) ).
cnf(b_subset_c,hypothesis,
subset(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_subset_c) ).
cnf(subset3,axiom,
( subset(X1,X2)
| ~ member(f17(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',subset3) ).
cnf(a_subset_b,hypothesis,
subset(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_subset_b) ).
cnf(subset2,axiom,
( subset(X1,X2)
| member(f17(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',subset2) ).
cnf(prove_a_subset_c,negated_conjecture,
~ subset(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_subset_c) ).
cnf(c_0_6,axiom,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
subset1 ).
cnf(c_0_7,hypothesis,
subset(b,c),
b_subset_c ).
cnf(c_0_8,axiom,
( subset(X1,X2)
| ~ member(f17(X1,X2),X2) ),
subset3 ).
cnf(c_0_9,hypothesis,
( member(X1,c)
| ~ member(X1,b) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,hypothesis,
subset(a,b),
a_subset_b ).
cnf(c_0_11,hypothesis,
( subset(X1,c)
| ~ member(f17(X1,c),b) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,hypothesis,
( member(X1,b)
| ~ member(X1,a) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_13,hypothesis,
( subset(X1,c)
| ~ member(f17(X1,c),a) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
( subset(X1,X2)
| member(f17(X1,X2),X1) ),
subset2 ).
cnf(c_0_15,negated_conjecture,
~ subset(a,c),
prove_a_subset_c ).
cnf(c_0_16,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET027-4 : 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.16/0.32 % Computer : n022.cluster.edu
% 0.16/0.32 % Model : x86_64 x86_64
% 0.16/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32 % Memory : 8042.1875MB
% 0.16/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32 % CPULimit : 300
% 0.16/0.32 % WCLimit : 300
% 0.16/0.32 % DateTime : Tue May 5 02:04:51 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.38/1.75 % Version : CSE_E---1.7
% 1.38/1.75 % Problem : theBenchmark.p
% 1.38/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 1.38/1.75 % SZS output start CNFRefutation
% See solution above
% 1.38/1.75 % Total time : 1.372s
%------------------------------------------------------------------------------