%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : NUM014-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 0.59s 0.65s % Output : CNFRefutation 0.59s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : NUM014-1 : TPTP v8.2.0. Released v1.0.0. % 0.04/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.15/0.36 % Computer : n026.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 300 % 0.15/0.36 % DateTime : Sat Jun 22 20:16:09 EDT 2024 % 0.15/0.36 % CPUTime : % 0.45/0.60 start to proof:theBenchmark % 0.59/0.64 %------------------------------------------- % 0.59/0.64 % File :CSE---1.7 % 0.59/0.64 % Problem :theBenchmark % 0.59/0.64 % Transform :cnf % 0.59/0.64 % Format :tptp:raw % 0.59/0.64 % Command :java -jar mcs_scs.jar %d %s % 0.59/0.64 % 0.59/0.64 % Result :Theorem 0.000000s % 0.59/0.64 % Output :CNFRefutation 0.000000s % 0.59/0.64 %------------------------------------------- % 0.59/0.64 %-------------------------------------------------------------------------- % 0.59/0.65 % File : NUM014-1 : TPTP v8.2.0. Released v1.0.0. % 0.59/0.65 % Domain : Number Theory % 0.59/0.65 % Problem : If a is a prime and a = b^2/c^2 then a divides b % 0.59/0.65 % Version : [Cha70] axioms : Incomplete. % 0.59/0.65 % English : % 0.59/0.65 % 0.59/0.65 % Refs : [Luc68] Luckham (1968), Some Tree-paring Strategies for Theore % 0.59/0.65 % : [Cha70] Chang (1970), The Unit Proof and the Input Proof in Th % 0.59/0.65 % : [RR+72] Reboh et al. (1972), Study of automatic theorem provin % 0.59/0.65 % : [LS74] Lawrence & Starkey (1974), Experimental Tests of Resol % 0.59/0.65 % : [FL+74] Fleisig et al. (1974), An Implementation of the Model % 0.59/0.65 % Source : [Cha70] % 0.59/0.65 % Names : Example 6 [Luc68] % 0.59/0.65 % : Example 7 [Cha70] % 0.59/0.65 % : Example 7 [CL73] % 0.59/0.65 % : NUM1 [RR+72] % 0.59/0.65 % : Example 2 [FL+74] % 0.59/0.65 % 0.59/0.65 % Status : Unsatisfiable % 0.59/0.65 % Rating : 0.00 v2.0.0 % 0.59/0.65 % Syntax : Number of clauses : 7 ( 4 unt; 1 nHn; 6 RR) % 0.59/0.65 % Number of literals : 13 ( 0 equ; 6 neg) % 0.59/0.65 % Maximal clause size : 5 ( 1 avg) % 0.59/0.65 % Maximal term depth : 2 ( 1 avg) % 0.59/0.65 % Number of predicates : 3 ( 3 usr; 0 prp; 1-3 aty) % 0.59/0.65 % Number of functors : 4 ( 4 usr; 3 con; 0-1 aty) % 0.59/0.65 % Number of variables : 11 ( 1 sgn) % 0.59/0.65 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.59/0.65 % 0.59/0.65 % Comments : % 0.59/0.65 %-------------------------------------------------------------------------- % 0.59/0.65 cnf(square,axiom, % 0.59/0.65 product(X,X,square(X)) ). % 0.59/0.65 % 0.59/0.65 cnf(commutativity,axiom, % 0.59/0.65 ( ~ product(X,Y,Z) % 0.59/0.65 | product(Y,X,Z) ) ). % 0.59/0.65 % 0.59/0.65 cnf(divides,axiom, % 0.59/0.65 ( ~ product(X,Y,Z) % 0.59/0.65 | divides(X,Z) ) ). % 0.59/0.65 % 0.59/0.65 cnf(remainder,axiom, % 0.59/0.65 ( ~ prime(X) % 0.59/0.65 | ~ product(Y,Z,U) % 0.59/0.65 | ~ divides(X,U) % 0.59/0.65 | divides(X,Y) % 0.59/0.65 | divides(X,Z) ) ). % 0.59/0.65 % 0.59/0.65 cnf(a_is_prime,hypothesis, % 0.59/0.65 prime(a) ). % 0.59/0.65 % 0.59/0.65 cnf(a_equals_b_squared_by_c_squared,hypothesis, % 0.59/0.65 product(a,square(c),square(b)) ). % 0.59/0.65 % 0.59/0.65 cnf(prove_a_divides_b,negated_conjecture, % 0.59/0.65 ~ divides(a,b) ). % 0.59/0.65 % 0.59/0.65 %-------------------------------------------------------------------------- % 0.59/0.65 %------------------------------------------- % 0.59/0.65 % Proof found % 0.59/0.65 % SZS status Theorem for theBenchmark % 0.59/0.65 % SZS output start Proof % 0.59/0.65 %ClaNum:7(EqnAxiom:0) % 0.59/0.65 %VarNum:24(SingletonVarNum:11) % 0.59/0.65 %MaxLitNum:5 % 0.59/0.65 %MaxfuncDepth:1 % 0.59/0.65 %SharedTerms:8 % 0.59/0.65 %goalClause: 4 % 0.59/0.65 %singleGoalClaCount:1 % 0.59/0.65 [1]P1(a1) % 0.59/0.65 [4]~P2(a1,a3) % 0.59/0.65 [2]P3(a1,f4(a2),f4(a3)) % 0.59/0.65 [3]P3(x31,x31,f4(x31)) % 0.59/0.65 [5]P2(x51,x52)+~P3(x51,x53,x52) % 0.59/0.65 [6]~P3(x62,x61,x63)+P3(x61,x62,x63) % 0.59/0.65 [7]~P1(x71)+~P3(x73,x72,x74)+P2(x71,x72)+P2(x71,x73)+~P2(x71,x74) % 0.59/0.65 %EqnAxiom % 0.59/0.65 % 0.59/0.65 %------------------------------------------- % 0.59/0.66 cnf(12,plain, % 0.59/0.66 (~P2(a1,f4(a3))), % 0.59/0.66 inference(scs_inference,[],[4,3,1,5,6,7])). % 0.59/0.66 cnf(15,plain, % 0.59/0.66 ($false), % 0.59/0.66 inference(scs_inference,[],[12,2,5]), % 0.59/0.66 ['proof']). % 0.59/0.66 % SZS output end Proof % 0.59/0.66 % Total time :0.000000s %------------------------------------------------------------------------------