%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : NUM015-1 : TPTP v8.2.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n026.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 : Mon Jun 24 12:22:58 EDT 2024 % Result : Unsatisfiable 1.56s 1.67s % Output : CNFRefutation 1.56s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM015-1 : TPTP v8.2.0. Released v1.0.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n026.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Sat Jun 22 23:32:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.20/0.57 start to proof:theBenchmark % 1.56/1.66 %------------------------------------------- % 1.56/1.66 % File :CSE---1.7 % 1.56/1.66 % Problem :theBenchmark % 1.56/1.66 % Transform :cnf % 1.56/1.66 % Format :tptp:raw % 1.56/1.66 % Command :java -jar mcs_scs.jar %d %s % 1.56/1.66 % 1.56/1.66 % Result :Theorem 1.050000s % 1.56/1.66 % Output :CNFRefutation 1.050000s % 1.56/1.66 %------------------------------------------- % 1.56/1.67 %-------------------------------------------------------------------------- % 1.56/1.67 % File : NUM015-1 : TPTP v8.2.0. Released v1.0.0. % 1.56/1.67 % Domain : Number Theory % 1.56/1.67 % Problem : Any number greater than 1 has a prime divisor % 1.56/1.67 % Version : [Cha70] axioms : Incomplete. % 1.56/1.67 % English : % 1.56/1.67 % 1.56/1.67 % Refs : [Luc68] Luckham (1968), Some Tree-paring Strategies for Theore % 1.56/1.67 % : [Lov69] Loveland (1969), Theorem-provers Combining Model Elimi % 1.56/1.67 % : [Cha70] Chang (1970), The Unit Proof and the Input Proof in Th % 1.56/1.67 % : [RR+72] Reboh et al. (1972), Study of automatic theorem provin % 1.56/1.67 % : [CL73] Chang & Lee (1973), Symbolic Logic and Mechanical Theo % 1.56/1.67 % : [FL+74] Fleisig et al. (1974), An Implementation of the Model % 1.56/1.67 % Source : [Cha70] % 1.56/1.67 % Names : Example 7 [Luc68] % 1.56/1.67 % : Example 2 [Lov69] % 1.56/1.67 % : Example 8 [Cha70] % 1.56/1.67 % : Example 8 [Cl73] % 1.56/1.67 % : PRIM [RR+72] % 1.56/1.67 % : Example 3 [FL+74] % 1.56/1.67 % 1.56/1.67 % Status : Unsatisfiable % 1.56/1.67 % Rating : 0.00 v6.3.0, 0.14 v6.2.0, 0.00 v2.0.0 % 1.56/1.67 % Syntax : Number of clauses : 9 ( 2 unt; 3 nHn; 5 RR) % 1.56/1.67 % Number of literals : 19 ( 0 equ; 8 neg) % 1.56/1.67 % Maximal clause size : 3 ( 2 avg) % 1.56/1.67 % Maximal term depth : 2 ( 1 avg) % 1.56/1.67 % Number of predicates : 3 ( 3 usr; 0 prp; 1-2 aty) % 1.56/1.67 % Number of functors : 4 ( 4 usr; 2 con; 0-1 aty) % 1.56/1.67 % Number of variables : 10 ( 0 sgn) % 1.56/1.67 % SPC : CNF_UNS_RFO_NEQ_NHN % 1.56/1.67 % 1.56/1.67 % Comments : % 1.56/1.67 %-------------------------------------------------------------------------- % 1.56/1.67 cnf(divide_self,axiom, % 1.56/1.67 divides(X,X) ). % 1.56/1.67 % 1.56/1.67 cnf(transitive_divide,axiom, % 1.56/1.67 ( ~ divides(X,Y) % 1.56/1.67 | ~ divides(Y,Z) % 1.56/1.67 | divides(X,Z) ) ). % 1.56/1.67 % 1.56/1.67 cnf(prime,axiom, % 1.56/1.67 ( prime(X) % 1.56/1.67 | divides(divisor(X),X) ) ). % 1.56/1.67 % 1.56/1.67 cnf(divisor1,axiom, % 1.56/1.67 ( prime(X) % 1.56/1.67 | less(n1,divisor(X)) ) ). % 1.56/1.67 % 1.56/1.67 cnf(divisor2,axiom, % 1.56/1.67 ( prime(X) % 1.56/1.67 | less(divisor(X),X) ) ). % 1.56/1.67 % 1.56/1.67 cnf(factor1,axiom, % 1.56/1.67 ( ~ less(n1,X) % 1.56/1.67 | ~ less(X,a) % 1.56/1.67 | prime(factor_of(X)) ) ). % 1.56/1.67 % 1.56/1.67 cnf(factor2,axiom, % 1.56/1.67 ( ~ less(n1,X) % 1.56/1.67 | ~ less(X,a) % 1.56/1.67 | divides(factor_of(X),X) ) ). % 1.56/1.67 % 1.56/1.67 cnf(a_is_greater_than_1,hypothesis, % 1.56/1.67 less(n1,a) ). % 1.56/1.67 % 1.56/1.67 cnf(prove_a_has_prime_divisor,negated_conjecture, % 1.56/1.67 ( ~ prime(X) % 1.56/1.67 | ~ divides(X,a) ) ). % 1.56/1.67 % 1.56/1.67 %-------------------------------------------------------------------------- % 1.56/1.67 %------------------------------------------- % 1.56/1.67 % Proof found % 1.56/1.67 % SZS status Theorem for theBenchmark % 1.56/1.67 % SZS output start Proof % 1.56/1.67 %ClaNum:9(EqnAxiom:0) % 1.56/1.67 %VarNum:25(SingletonVarNum:10) % 1.56/1.67 %MaxLitNum:3 % 1.56/1.67 %MaxfuncDepth:1 % 1.56/1.67 %SharedTerms:3 % 1.56/1.67 %goalClause: 6 % 1.56/1.67 [1]P1(a1,a2) % 1.56/1.67 [2]P2(x21,x21) % 1.56/1.67 [6]~P3(x61)+~P2(x61,a2) % 1.56/1.67 [3]P3(x31)+P1(a1,f3(x31)) % 1.56/1.67 [4]P3(x41)+P2(f3(x41),x41) % 1.56/1.67 [5]P3(x51)+P1(f3(x51),x51) % 1.56/1.67 [7]~P1(x71,a2)+~P1(a1,x71)+P3(f4(x71)) % 1.56/1.67 [9]~P1(x91,a2)+~P1(a1,x91)+P2(f4(x91),x91) % 1.56/1.67 [8]~P2(x81,x83)+P2(x81,x82)+~P2(x83,x82) % 1.56/1.67 %EqnAxiom % 1.56/1.67 % 1.56/1.67 %------------------------------------------- % 1.56/1.68 cnf(10,plain, % 1.56/1.68 (~P3(a2)), % 1.56/1.68 inference(scs_inference,[],[2,6])). % 1.56/1.68 cnf(105,plain, % 1.56/1.68 (P1(a1,f3(a2))), % 1.56/1.68 inference(scs_inference,[],[2,3,6])). % 1.56/1.68 cnf(196,plain, % 1.56/1.68 (P2(f3(a2),a2)), % 1.56/1.68 inference(scs_inference,[],[2,4,6])). % 1.56/1.68 cnf(684,plain, % 1.56/1.68 (P2(f4(f3(a2)),f3(a2))+~P1(f3(a2),a2)), % 1.56/1.68 inference(scs_inference,[],[105,9])). % 1.56/1.68 cnf(734,plain, % 1.56/1.68 (P2(f4(f3(a2)),f3(a2))), % 1.56/1.68 inference(scs_inference,[],[10,684,5])). % 1.56/1.68 cnf(1098,plain, % 1.56/1.68 (P1(f3(a2),a2)), % 1.56/1.68 inference(scs_inference,[],[2,6,5])). % 1.56/1.68 cnf(1280,plain, % 1.56/1.68 (~P2(f4(f3(a2)),a2)), % 1.56/1.68 inference(scs_inference,[],[105,1098,6,7])). % 1.56/1.68 cnf(5517,plain, % 1.56/1.68 ($false), % 1.56/1.68 inference(scs_inference,[],[734,1280,196,8]), % 1.56/1.68 ['proof']). % 1.56/1.68 % SZS output end Proof % 1.56/1.68 % Total time :1.050000s %------------------------------------------------------------------------------