%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN285-1 : TPTP v9.2.1. Released v1.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 : n002.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:36:40 PM UTC 2026
% Result : Unsatisfiable 1.37s 1.74s
% Output : CNFRefutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 12 unt; 0 nHn; 16 RR)
% Number of literals : 30 ( 0 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 14 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_105,axiom,
( q1(X1,X1,X2)
| ~ s0(X1)
| ~ p0(X2,d) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_105) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(rule_099,axiom,
( q1(X1,X2,X2)
| ~ k0(X3)
| ~ l0(X1)
| ~ q1(X2,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_099) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
cnf(prove_this,negated_conjecture,
~ q1(a,d,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_7,axiom,
( q1(X1,X1,X2)
| ~ s0(X1)
| ~ p0(X2,d) ),
rule_105 ).
cnf(c_0_8,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_9,plain,
( q1(X1,X1,b)
| ~ s0(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
s0(d),
axiom_1 ).
cnf(c_0_11,axiom,
( q1(X1,X2,X2)
| ~ k0(X3)
| ~ l0(X1)
| ~ q1(X2,X2,X3) ),
rule_099 ).
cnf(c_0_12,plain,
q1(d,d,b),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
k0(b),
axiom_32 ).
cnf(c_0_14,plain,
( q1(X1,d,d)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_15,axiom,
l0(a),
axiom_20 ).
cnf(c_0_16,negated_conjecture,
~ q1(a,d,d),
prove_this ).
cnf(c_0_17,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN285-1 : TPTP v9.2.1. Released v1.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.15/0.33 % Computer : n002.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:25:47 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 1.37/1.74 % Version : CSE_E---1.7
% 1.37/1.74 % Problem : theBenchmark.p
% 1.37/1.74 % SZS status Unsatisfiable for theBenchmark.p
% 1.37/1.74 % SZS output start CNFRefutation
% See solution above
% 1.37/1.74 % Total time : 1.374s
%------------------------------------------------------------------------------