%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM015-1 : 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 : n029.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:52:43 PM UTC 2026
% Result : Unsatisfiable 1.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 4 unt; 9 nHn; 14 RR)
% Number of literals : 49 ( 0 equ; 21 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitive_divide,axiom,
( divides(X1,X3)
| ~ divides(X1,X2)
| ~ divides(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive_divide) ).
cnf(prime,axiom,
( prime(X1)
| divides(divisor(X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prime) ).
cnf(factor2,axiom,
( divides(factor_of(X1),X1)
| ~ less(n1,X1)
| ~ less(X1,a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',factor2) ).
cnf(divisor1,axiom,
( prime(X1)
| less(n1,divisor(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor1) ).
cnf(prove_a_has_prime_divisor,negated_conjecture,
( ~ prime(X1)
| ~ divides(X1,a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_has_prime_divisor) ).
cnf(factor1,axiom,
( prime(factor_of(X1))
| ~ less(n1,X1)
| ~ less(X1,a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',factor1) ).
cnf(divisor2,axiom,
( prime(X1)
| less(divisor(X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor2) ).
cnf(divide_self,axiom,
divides(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divide_self) ).
cnf(c_0_8,axiom,
( divides(X1,X3)
| ~ divides(X1,X2)
| ~ divides(X2,X3) ),
transitive_divide ).
cnf(c_0_9,axiom,
( prime(X1)
| divides(divisor(X1),X1) ),
prime ).
cnf(c_0_10,plain,
( prime(X1)
| divides(X2,X1)
| ~ divides(X2,divisor(X1)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
( divides(factor_of(X1),X1)
| ~ less(n1,X1)
| ~ less(X1,a) ),
factor2 ).
cnf(c_0_12,axiom,
( prime(X1)
| less(n1,divisor(X1)) ),
divisor1 ).
cnf(c_0_13,negated_conjecture,
( ~ prime(X1)
| ~ divides(X1,a) ),
prove_a_has_prime_divisor ).
cnf(c_0_14,axiom,
( prime(factor_of(X1))
| ~ less(n1,X1)
| ~ less(X1,a) ),
factor1 ).
cnf(c_0_15,plain,
( prime(X1)
| divides(factor_of(divisor(X1)),X1)
| ~ less(divisor(X1),a) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_16,axiom,
( prime(X1)
| less(divisor(X1),X1) ),
divisor2 ).
cnf(c_0_17,negated_conjecture,
( ~ less(X1,a)
| ~ less(n1,X1)
| ~ divides(factor_of(X1),a) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( prime(a)
| divides(factor_of(divisor(a)),a) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
prime(a),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_12]),c_0_16]) ).
cnf(c_0_20,axiom,
divides(X1,X1),
divide_self ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM015-1 : 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.14/0.33 % Computer : n029.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 00:06:29 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.72 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.375s
%------------------------------------------------------------------------------