%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN009-3 : TPTP v9.2.1. Released v2.5.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 : n027.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:35:19 PM UTC 2026
% Result : Unsatisfiable 0.26s 1.62s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 16 unt; 5 nHn; 30 RR)
% Number of literals : 55 ( 0 equ; 33 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 51 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_10,negated_conjecture,
( t(X1,X2,X3)
| v(X1,X2,X3)
| ~ u(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_9,negated_conjecture,
( p(X1,X2,X3)
| q(X1,X2,X3)
| r(X1,X2,X3)
| ~ s(X1)
| ~ s(X2)
| ~ s(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_3,negated_conjecture,
( ~ r(X1,X2,X3)
| ~ t(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_2,negated_conjecture,
( ~ q(X1,X2,X3)
| ~ t(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_1,negated_conjecture,
( ~ p(X1,X2,X3)
| ~ t(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_7,negated_conjecture,
~ v(X1,X2,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_8,negated_conjecture,
u(c,c,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_6,negated_conjecture,
s(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_5,negated_conjecture,
s(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_4,negated_conjecture,
s(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(i_0_10,negated_conjecture,
( t(X1,X2,X3)
| v(X1,X2,X3)
| ~ u(X1,X2,X3) ),
clause_10,
[final] ).
cnf(i_0_11,negated_conjecture,
( p(X1,X2,X3)
| q(X1,X2,X3)
| r(X1,X2,X3)
| ~ s(X1)
| ~ s(X2)
| ~ s(X3) ),
clause_9,
[final] ).
cnf(i_0_12,negated_conjecture,
( ~ r(X1,X2,X3)
| ~ t(X1,X2,X3) ),
clause_3,
[final] ).
cnf(i_0_13,negated_conjecture,
( ~ q(X1,X2,X3)
| ~ t(X1,X2,X3) ),
clause_2,
[final] ).
cnf(i_0_14,negated_conjecture,
( ~ p(X1,X2,X3)
| ~ t(X1,X2,X3) ),
clause_1,
[final] ).
cnf(i_0_15,negated_conjecture,
~ v(X1,X2,X3),
clause_7,
[final] ).
cnf(i_0_16,negated_conjecture,
u(c,c,c),
clause_8,
[final] ).
cnf(i_0_17,negated_conjecture,
s(c),
clause_6,
[final] ).
cnf(i_0_18,negated_conjecture,
s(b),
clause_5,
[final] ).
cnf(i_0_19,negated_conjecture,
s(a),
clause_4,
[final] ).
cnf(i_0_20,plain,
t(c,c,c),
inference(scs_inference,[],[i_0_15,i_0_16,i_0_10]) ).
cnf(i_0_21,plain,
~ v(X1,X2,X3),
inference(rename_variables,[],[i_0_15]) ).
cnf(i_0_22,plain,
( v(X1,X2,X3)
| ~ u(X1,X2,X3)
| t(X1,X2,X3) ),
inference(rename_variables,[],[i_0_10]) ).
cnf(i_0_23,plain,
~ r(c,c,c),
inference(scs_inference,[],[i_0_15,i_0_16,i_0_10,i_0_12]) ).
cnf(i_0_24,plain,
( ~ t(X1,X2,X3)
| ~ r(X1,X2,X3) ),
inference(rename_variables,[],[i_0_12]) ).
cnf(i_0_25,plain,
~ q(c,c,c),
inference(scs_inference,[],[i_0_15,i_0_16,i_0_10,i_0_12,i_0_13]) ).
cnf(i_0_26,plain,
( ~ t(X1,X2,X3)
| ~ q(X1,X2,X3) ),
inference(rename_variables,[],[i_0_13]) ).
cnf(i_0_27,plain,
~ p(c,c,c),
inference(scs_inference,[],[i_0_15,i_0_16,i_0_10,i_0_12,i_0_13,i_0_14]) ).
cnf(i_0_28,plain,
( ~ t(X1,X2,X3)
| ~ p(X1,X2,X3) ),
inference(rename_variables,[],[i_0_14]) ).
cnf(i_0_29,plain,
$false,
inference(scs_inference,[],[i_0_15,i_0_16,i_0_17,i_0_10,i_0_12,i_0_13,i_0_14,i_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN009-3 : TPTP v9.2.1. Released v2.5.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.15/0.33 % Computer : n027.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 08:04:35 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 0.26/1.62 % Version : CSE_E---1.7
% 0.26/1.62 % Problem : theBenchmark.p
% 0.26/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 0.26/1.62 % SZS output start CNFRefutation
% See solution above
% 0.26/1.65 % Total time : 1.273s
%------------------------------------------------------------------------------