%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : COL099-2 : TPTP v9.2.1. Released v2.7.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 : 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 04:12:20 PM UTC 2026
% Result : Unsatisfiable 3.51s 2.98s
% Output : CNFRefutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 33 ( 11 unt; 0 nHn; 30 RR)
% Number of literals : 68 ( 5 equ; 40 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 59 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause102_2,axiom,
( subset(X2,X3)
| ~ subset(cons(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause102_2) ).
cnf(clause133,axiom,
subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause133) ).
cnf(clause148,axiom,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause148) ).
cnf(diamond_trancl_1c2,negated_conjecture,
( ~ member(pair(ya,X1),trancl(r))
| ~ member(pair(yp,X1),trancl(r)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_trancl_1c2) ).
cnf(r_into_trancl,axiom,
( member(pair(X1,X2),trancl(X3))
| ~ member(pair(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r_into_trancl) ).
cnf(clause9_1,axiom,
( subset(cons(X1,X3),X2)
| ~ member(X1,X2)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause9_1) ).
cnf(diamond_strip_lemmaD1,axiom,
( member(pair(X4,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),trancl(X1))
| ~ diamond(X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ member(pair(X2,X4),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_strip_lemmaD1) ).
cnf(diamond_trancl_1h1,hypothesis,
diamond(r),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_trancl_1h1) ).
cnf(diamond_trancl_1c1,negated_conjecture,
member(pair(y,yp),trancl(r)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_trancl_1c1) ).
cnf(diamond_strip_lemmaD2,axiom,
( member(pair(X3,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),X1)
| ~ diamond(X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ member(pair(X2,X4),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_strip_lemmaD2) ).
cnf(clause102_1,axiom,
( member(X1,X3)
| ~ subset(cons(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause102_1) ).
cnf(diamond_trancl_1h2,hypothesis,
member(pair(y,ya),r),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_trancl_1h2) ).
cnf(c_0_12,axiom,
( subset(X2,X3)
| ~ subset(cons(X1,X2),X3) ),
clause102_2 ).
cnf(c_0_13,axiom,
subset(X1,X1),
clause133 ).
cnf(c_0_14,axiom,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
clause148 ).
cnf(c_0_15,plain,
subset(X1,cons(X2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( ~ member(pair(ya,X1),trancl(r))
| ~ member(pair(yp,X1),trancl(r)) ),
diamond_trancl_1c2 ).
cnf(c_0_17,axiom,
( member(pair(X1,X2),trancl(X3))
| ~ member(pair(X1,X2),X3) ),
r_into_trancl ).
cnf(c_0_18,plain,
( cons(X1,X2) = X2
| ~ subset(cons(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
( subset(cons(X1,X3),X2)
| ~ member(X1,X2)
| ~ subset(X3,X2) ),
clause9_1 ).
cnf(c_0_20,negated_conjecture,
( ~ member(pair(ya,X1),trancl(r))
| ~ member(pair(yp,X1),r) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,axiom,
( member(pair(X4,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),trancl(X1))
| ~ diamond(X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ member(pair(X2,X4),X1) ),
diamond_strip_lemmaD1 ).
cnf(c_0_22,hypothesis,
diamond(r),
diamond_trancl_1h1 ).
cnf(c_0_23,plain,
( cons(X1,X2) = X2
| ~ member(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13])]) ).
cnf(c_0_24,negated_conjecture,
member(pair(y,yp),trancl(r)),
diamond_trancl_1c1 ).
cnf(c_0_25,negated_conjecture,
( ~ member(pair(yp,diamond_strip_lemmaD_sk1(X1,X2,ya,r)),r)
| ~ member(pair(X1,X2),trancl(r))
| ~ member(pair(X1,ya),r) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_26,axiom,
( member(pair(X3,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),X1)
| ~ diamond(X1)
| ~ member(pair(X2,X3),trancl(X1))
| ~ member(pair(X2,X4),X1) ),
diamond_strip_lemmaD2 ).
cnf(c_0_27,axiom,
( member(X1,X3)
| ~ subset(cons(X1,X2),X3) ),
clause102_1 ).
cnf(c_0_28,negated_conjecture,
cons(pair(y,yp),trancl(r)) = trancl(r),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( ~ member(pair(X1,yp),trancl(r))
| ~ member(pair(X1,ya),r) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_22])]) ).
cnf(c_0_30,negated_conjecture,
( member(pair(y,yp),X1)
| ~ subset(trancl(r),X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,hypothesis,
member(pair(y,ya),r),
diamond_trancl_1h2 ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : COL099-2 : TPTP v9.2.1. Released v2.7.0.
% 0.00/0.06 % 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.06/0.24 % Computer : n012.cluster.edu
% 0.06/0.24 % Model : x86_64 x86_64
% 0.06/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24 % Memory : 8042.1875MB
% 0.06/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24 % CPULimit : 300
% 0.06/0.24 % WCLimit : 300
% 0.06/0.24 % DateTime : Mon May 4 16:21:46 EDT 2026
% 0.06/0.24 % CPUTime :
% 0.06/0.25 % start to proof: theBenchmark
% 3.51/2.98 % Version : CSE_E---1.7
% 3.51/2.98 % Problem : theBenchmark.p
% 3.51/2.98 % SZS status Unsatisfiable for theBenchmark.p
% 3.51/2.98 % SZS output start CNFRefutation
% See solution above
% 3.51/2.99 % Total time : 2.363s
%------------------------------------------------------------------------------