%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : NUM022-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n032.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:23:00 EDT 2024
% Result : Unsatisfiable 0.52s 0.85s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM022-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.11 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.10/0.32 % Computer : n032.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Sat Jun 22 21:46:23 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.51/0.57 start to proof:theBenchmark
% 0.52/0.85 %-------------------------------------------
% 0.52/0.85 % File :CSE---1.7
% 0.52/0.85 % Problem :theBenchmark
% 0.52/0.85 % Transform :cnf
% 0.52/0.85 % Format :tptp:raw
% 0.52/0.85 % Command :java -jar mcs_scs.jar %d %s
% 0.52/0.85
% 0.52/0.85 % Result :Theorem 0.240000s
% 0.52/0.85 % Output :CNFRefutation 0.240000s
% 0.52/0.85 %-------------------------------------------
% 0.52/0.85 %--------------------------------------------------------------------------
% 0.52/0.85 % File : NUM022-1 : TPTP v8.2.0. Released v1.0.0.
% 0.52/0.85 % Domain : Number Theory
% 0.52/0.85 % Problem : Numerator divisble by smaller denominators
% 0.52/0.85 % Version : [LS74] axioms : Incomplete.
% 0.52/0.85 % English : If a numerator is divisible by a denominator, then the numerator
% 0.52/0.85 % is divisible by numbers smaller than the denominator.
% 0.52/0.85
% 0.52/0.85 % Refs : [LS74] Lawrence & Starkey (1974), Experimental Tests of Resol
% 0.52/0.85 % : [WM76] Wilson & Minker (1976), Resolution, Refinements, and S
% 0.52/0.85 % Source : [SPRFN]
% 0.52/0.85 % Names : ls651 [LS74]
% 0.52/0.85
% 0.52/0.85 % Status : Unsatisfiable
% 0.52/0.85 % Rating : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.14 v6.2.0, 0.00 v2.0.0
% 0.52/0.85 % Syntax : Number of clauses : 10 ( 3 unt; 1 nHn; 10 RR)
% 0.52/0.85 % Number of literals : 20 ( 0 equ; 10 neg)
% 0.52/0.85 % Maximal clause size : 3 ( 2 avg)
% 0.52/0.85 % Maximal term depth : 4 ( 1 avg)
% 0.52/0.85 % Number of predicates : 3 ( 3 usr; 0 prp; 2-2 aty)
% 0.52/0.85 % Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% 0.52/0.85 % Number of variables : 17 ( 1 sgn)
% 0.52/0.85 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.52/0.85
% 0.52/0.85 % Comments :
% 0.52/0.85 %--------------------------------------------------------------------------
% 0.52/0.85 %----Include the recursive function less axioms
% 0.52/0.85 include('Axioms/NUM001-1.ax').
% 0.52/0.85 %----Include the recursive function divides axioms
% 0.52/0.85 include('Axioms/NUM001-2.ax').
% 0.52/0.85 %--------------------------------------------------------------------------
% 0.52/0.85 cnf(transitivity,axiom,
% 0.52/0.85 ( ~ equalish(A,B)
% 0.52/0.85 | ~ equalish(C,A)
% 0.52/0.85 | equalish(C,B) ) ).
% 0.52/0.85
% 0.52/0.85 cnf(a_less_than_b,hypothesis,
% 0.52/0.85 less(a,b) ).
% 0.52/0.85
% 0.52/0.85 cnf(b_divides_d,hypothesis,
% 0.52/0.85 divides(b,d) ).
% 0.52/0.85
% 0.52/0.85 cnf(prove_a_less_than_d,negated_conjecture,
% 0.52/0.85 ~ less(a,d) ).
% 0.52/0.85
% 0.52/0.85 %--------------------------------------------------------------------------
% 0.52/0.85 %-------------------------------------------
% 0.52/0.85 % Proof found
% 0.52/0.85 % SZS status Theorem for theBenchmark
% 0.52/0.85 % SZS output start Proof
% 0.52/0.86 %ClaNum:10(EqnAxiom:0)
% 0.52/0.86 %VarNum:37(SingletonVarNum:17)
% 0.52/0.86 %MaxLitNum:3
% 0.52/0.86 %MaxfuncDepth:3
% 0.52/0.86 %SharedTerms:6
% 0.52/0.86 %goalClause: 3
% 0.52/0.86 %singleGoalClaCount:1
% 0.52/0.86 [1]P1(a1,a2)
% 0.52/0.86 [2]P2(a2,a4)
% 0.52/0.86 [3]~P1(a1,a4)
% 0.52/0.86 [4]~P1(x41,x42)+P2(x41,x42)
% 0.52/0.86 [5]~P3(x51,x52)+P2(x51,x52)
% 0.52/0.86 [10]~P1(x102,x101)+P3(f3(f5(f6(x101,x102)),x102),x101)
% 0.52/0.86 [9]P1(x91,x92)+~P3(f3(f5(x93),x91),x92)
% 0.52/0.86 [6]P3(x61,x62)+~P2(x61,x62)+P1(x61,x62)
% 0.52/0.86 [7]~P1(x73,x72)+P1(x71,x72)+~P1(x71,x73)
% 0.52/0.86 [8]~P3(x83,x82)+P3(x81,x82)+~P3(x81,x83)
% 0.52/0.86 %EqnAxiom
% 0.52/0.86
% 0.52/0.86 %-------------------------------------------
% 0.52/0.86 cnf(13,plain,
% 0.52/0.86 (P3(a2,a4)),
% 0.52/0.86 inference(scs_inference,[],[3,1,2,7,6])).
% 0.52/0.86 cnf(64,plain,
% 0.52/0.86 (~P3(f3(f5(x641),a1),a2)),
% 0.52/0.86 inference(scs_inference,[],[3,13,9,8])).
% 0.52/0.86 cnf(66,plain,
% 0.52/0.86 ($false),
% 0.52/0.86 inference(scs_inference,[],[1,64,10]),
% 0.52/0.86 ['proof']).
% 0.52/0.86 % SZS output end Proof
% 0.52/0.86 % Total time :0.240000s
%------------------------------------------------------------------------------