TSTP Solution File: NUM027-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : NUM027-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n007.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:20:20 EDT 2023
% Result : Unsatisfiable 0.17s 0.61s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : NUM027-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.09/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.11/0.32 % Computer : n007.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri Aug 25 12:32:40 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.57 start to proof:theBenchmark
% 0.17/0.60 %-------------------------------------------
% 0.17/0.60 % File :CSE---1.6
% 0.17/0.60 % Problem :theBenchmark
% 0.17/0.60 % Transform :cnf
% 0.17/0.60 % Format :tptp:raw
% 0.17/0.60 % Command :java -jar mcs_scs.jar %d %s
% 0.17/0.60
% 0.17/0.60 % Result :Theorem 0.000000s
% 0.17/0.60 % Output :CNFRefutation 0.000000s
% 0.17/0.60 %-------------------------------------------
% 0.17/0.61 %--------------------------------------------------------------------------
% 0.17/0.61 % File : NUM027-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.17/0.61 % Domain : Number Theory
% 0.17/0.61 % Problem : If a >= b and b*c <= a*c, then c = 0
% 0.17/0.61 % Version : [LS74] axioms : Incomplete > Reduced > Incomplete.
% 0.17/0.61 % English :
% 0.17/0.61
% 0.17/0.61 % Refs : [LS74] Lawrence & Starkey (1974), Experimental Tests of Resol
% 0.17/0.61 % : [WM76] Wilson & Minker (1976), Resolution, Refinements, and S
% 0.17/0.61 % Source : [SPRFN]
% 0.17/0.61 % Names : ls87 [LS74]
% 0.17/0.61 % : ls87 [WM76]
% 0.17/0.61
% 0.17/0.61 % Status : Unsatisfiable
% 0.17/0.61 % Rating : 0.00 v7.0.0, 0.12 v6.3.0, 0.00 v5.0.0, 0.07 v4.1.0, 0.00 v4.0.0
% 0.17/0.61 % Syntax : Number of clauses : 21 ( 10 unt; 2 nHn; 13 RR)
% 0.17/0.61 % Number of literals : 36 ( 0 equ; 17 neg)
% 0.17/0.61 % Maximal clause size : 3 ( 1 avg)
% 0.17/0.61 % Maximal term depth : 4 ( 1 avg)
% 0.17/0.61 % Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty)
% 0.17/0.61 % Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% 0.17/0.61 % Number of variables : 36 ( 3 sgn)
% 0.17/0.61 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.17/0.61
% 0.17/0.61 % Comments : The surplus transitivity axiom is removed.
% 0.17/0.61 % Bugfixes : v4.0.0 - Bugfix in NUM001-0.ax
% 0.17/0.61 %--------------------------------------------------------------------------
% 0.17/0.61 %----Include recursive function + and * axioms
% 0.17/0.61 include('Axioms/NUM001-0.ax').
% 0.17/0.61 %----Include recursive function less axioms
% 0.17/0.61 include('Axioms/NUM001-1.ax').
% 0.17/0.61 %--------------------------------------------------------------------------
% 0.17/0.61 cnf(reflexivity,axiom,
% 0.17/0.61 equalish(X,X) ).
% 0.17/0.61
% 0.17/0.61 cnf(symmetry,axiom,
% 0.17/0.61 ( ~ equalish(X,Y)
% 0.17/0.61 | equalish(Y,X) ) ).
% 0.17/0.61
% 0.17/0.61 cnf(transitivity,axiom,
% 0.17/0.61 ( ~ equalish(X,Y)
% 0.17/0.61 | ~ equalish(Y,Z)
% 0.17/0.61 | equalish(X,Z) ) ).
% 0.17/0.61
% 0.17/0.61 cnf(equality_preserved_over_times,axiom,
% 0.17/0.61 ( ~ equalish(A,B)
% 0.17/0.61 | equalish(multiply(A,C),multiply(B,C)) ) ).
% 0.17/0.61
% 0.17/0.61 cnf(not_less_and_equal,axiom,
% 0.17/0.61 ( ~ less(A,B)
% 0.17/0.61 | ~ equalish(A,B) ) ).
% 0.17/0.61
% 0.17/0.61 cnf(numbers_either_less_or_equal,axiom,
% 0.17/0.61 ( less(A,B)
% 0.17/0.61 | equalish(B,A)
% 0.17/0.61 | less(B,A) ) ).
% 0.17/0.61
% 0.17/0.61 cnf(number_not_less_than_itself,axiom,
% 0.17/0.61 ~ less(A,A) ).
% 0.17/0.61
% 0.17/0.61 cnf(zero_is_the_first_number,axiom,
% 0.17/0.61 ~ equalish(successor(A),n0) ).
% 0.17/0.61
% 0.17/0.61 cnf(multiply_lemma,axiom,
% 0.17/0.61 ( ~ less(A,B)
% 0.17/0.61 | equalish(C,n0)
% 0.17/0.61 | less(multiply(A,C),multiply(B,C)) ) ).
% 0.17/0.61
% 0.17/0.61 cnf(b_not_less_than_a,hypothesis,
% 0.17/0.61 ~ less(b,a) ).
% 0.17/0.61
% 0.17/0.61 cnf(b_times_c_less_than_a_times_c,hypothesis,
% 0.17/0.61 less(multiply(b,c),multiply(a,c)) ).
% 0.17/0.61
% 0.17/0.61 cnf(prove_c_is_0,negated_conjecture,
% 0.17/0.61 ~ equalish(c,n0) ).
% 0.17/0.61
% 0.17/0.61 %--------------------------------------------------------------------------
% 0.17/0.61 %-------------------------------------------
% 0.17/0.61 % Proof found
% 0.17/0.61 % SZS status Theorem for theBenchmark
% 0.17/0.61 % SZS output start Proof
% 0.17/0.61 %ClaNum:21(EqnAxiom:0)
% 0.17/0.61 %VarNum:75(SingletonVarNum:36)
% 0.17/0.61 %MaxLitNum:3
% 0.17/0.61 %MaxfuncDepth:3
% 0.17/0.61 %SharedTerms:9
% 0.17/0.61 %goalClause: 7
% 0.17/0.61 %singleGoalClaCount:1
% 0.17/0.61 [7]~P1(a6,a1)
% 0.17/0.61 [8]~P2(a5,a4)
% 0.17/0.61 [4]P2(f2(a5,a6),f2(a4,a6))
% 0.17/0.61 [1]P1(x11,x11)
% 0.17/0.61 [9]~P2(x91,x91)
% 0.17/0.61 [2]P1(f2(x21,a1),a1)
% 0.17/0.61 [3]P1(f3(x31,a1),x31)
% 0.17/0.61 [10]~P1(f7(x101),a1)
% 0.17/0.61 [5]P1(f3(x51,f7(x52)),f7(f3(x51,x52)))
% 0.17/0.61 [6]P1(f2(x61,f7(x62)),f3(f2(x61,x62),x61))
% 0.17/0.61 [11]~P1(x112,x111)+P1(x111,x112)
% 0.17/0.61 [13]~P2(x131,x132)+~P1(x131,x132)
% 0.17/0.61 [14]~P1(x141,x142)+P1(f7(x141),f7(x142))
% 0.17/0.61 [15]P1(x151,x152)+~P1(f7(x151),f7(x152))
% 0.17/0.61 [21]~P2(x212,x211)+P1(f3(f7(f8(x211,x212)),x212),x211)
% 0.17/0.61 [18]~P1(x181,x183)+P1(f2(x181,x182),f2(x183,x182))
% 0.17/0.61 [19]P2(x191,x192)+~P1(f3(f7(x193),x191),x192)
% 0.17/0.61 [12]P2(x121,x122)+P2(x122,x121)+P1(x121,x122)
% 0.17/0.61 [16]~P1(x161,x163)+P1(x161,x162)+~P1(x163,x162)
% 0.17/0.61 [17]~P2(x173,x172)+P2(x171,x172)+~P2(x171,x173)
% 0.17/0.61 [20]~P2(x202,x203)+P2(f2(x202,x201),f2(x203,x201))+P1(x201,a1)
% 0.17/0.61 %EqnAxiom
% 0.17/0.61
% 0.17/0.61 %-------------------------------------------
% 0.17/0.61 cnf(58,plain,
% 0.17/0.61 ($false),
% 0.17/0.61 inference(scs_inference,[],[7,8,2,6,9,4,3,16,11,19,13,17,18,12,20]),
% 0.17/0.61 ['proof']).
% 0.17/0.62 % SZS output end Proof
% 0.17/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------