TSTP Solution File: NUM015-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM015-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n015.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 : Thu Aug 31 10:26:09 EDT 2023
% Result : Unsatisfiable 0.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of formulae : 28 ( 4 unt; 7 typ; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 47 ( 21 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% 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; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
divides: ( $i * $i ) > $o ).
tff(decl_23,type,
prime: $i > $o ).
tff(decl_24,type,
divisor: $i > $i ).
tff(decl_25,type,
n1: $i ).
tff(decl_26,type,
less: ( $i * $i ) > $o ).
tff(decl_27,type,
a: $i ).
tff(decl_28,type,
factor_of: $i > $i ).
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(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(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(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,negated_conjecture,
( ~ prime(X1)
| ~ divides(X1,a) ),
prove_a_has_prime_divisor ).
cnf(c_0_11,axiom,
( prime(factor_of(X1))
| ~ less(n1,X1)
| ~ less(X1,a) ),
factor1 ).
cnf(c_0_12,plain,
( prime(X1)
| divides(X2,X1)
| ~ divides(X2,divisor(X1)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,axiom,
( divides(factor_of(X1),X1)
| ~ less(n1,X1)
| ~ less(X1,a) ),
factor2 ).
cnf(c_0_14,axiom,
( prime(X1)
| less(n1,divisor(X1)) ),
divisor1 ).
cnf(c_0_15,negated_conjecture,
( ~ less(X1,a)
| ~ less(n1,X1)
| ~ divides(factor_of(X1),a) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( prime(X1)
| divides(factor_of(divisor(X1)),X1)
| ~ less(divisor(X1),a) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,axiom,
( prime(X1)
| less(divisor(X1),X1) ),
divisor2 ).
cnf(c_0_18,negated_conjecture,
prime(a),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14]),c_0_17]) ).
cnf(c_0_19,axiom,
divides(X1,X1),
divide_self ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM015-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 25 13:07:36 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.19/0.56 % Version : CSE_E---1.5
% 0.19/0.56 % Problem : theBenchmark.p
% 0.19/0.56 % Proof found
% 0.19/0.56 % SZS status Theorem for theBenchmark.p
% 0.19/0.56 % SZS output start Proof
% See solution above
% 0.19/0.56 % Total time : 0.004000 s
% 0.19/0.56 % SZS output end Proof
% 0.19/0.56 % Total time : 0.007000 s
%------------------------------------------------------------------------------