TSTP Solution File: NUM021-1 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : NUM021-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/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:18 EDT 2023

% Result   : Unsatisfiable 0.19s 0.61s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM021-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.13/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34  % Computer : n007.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 10:05:25 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.19/0.54  start to proof:theBenchmark
% 0.19/0.60  %-------------------------------------------
% 0.19/0.60  % File        :CSE---1.6
% 0.19/0.60  % Problem     :theBenchmark
% 0.19/0.60  % Transform   :cnf
% 0.19/0.60  % Format      :tptp:raw
% 0.19/0.60  % Command     :java -jar mcs_scs.jar %d %s
% 0.19/0.60  
% 0.19/0.60  % Result      :Theorem 0.010000s
% 0.19/0.60  % Output      :CNFRefutation 0.010000s
% 0.19/0.60  %-------------------------------------------
% 0.19/0.60  %--------------------------------------------------------------------------
% 0.19/0.60  % File     : NUM021-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.19/0.60  % Domain   : Number Theory
% 0.19/0.60  % Problem  : If a <= b < c, then c cannot divide a
% 0.19/0.60  % Version  : [LS74] axioms : Incomplete.
% 0.19/0.60  % English  :
% 0.19/0.60  
% 0.19/0.60  % Refs     : [LS74]  Lawrence & Starkey (1974), Experimental Tests of Resol
% 0.19/0.60  %          : [WM76]  Wilson & Minker (1976), Resolution, Refinements, and S
% 0.19/0.60  % Source   : [SPRFN]
% 0.19/0.60  % Names    : ls65 [LS74]
% 0.19/0.60  %          : ls65 [WM76]
% 0.19/0.60  
% 0.19/0.60  % Status   : Unsatisfiable
% 0.19/0.60  % Rating   : 0.00 v7.5.0, 0.17 v7.4.0, 0.00 v7.0.0, 0.12 v6.3.0, 0.14 v6.2.0, 0.00 v5.0.0, 0.07 v4.1.0, 0.00 v4.0.0
% 0.19/0.60  % Syntax   : Number of clauses     :   19 (   9 unt;   1 nHn;  14 RR)
% 0.19/0.60  %            Number of literals    :   32 (   0 equ;  14 neg)
% 0.19/0.60  %            Maximal clause size   :    3 (   1 avg)
% 0.19/0.60  %            Maximal term depth    :    4 (   1 avg)
% 0.19/0.60  %            Number of predicates  :    3 (   3 usr;   0 prp; 2-2 aty)
% 0.19/0.60  %            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
% 0.19/0.60  %            Number of variables   :   31 (   3 sgn)
% 0.19/0.60  % SPC      : CNF_UNS_RFO_NEQ_NHN
% 0.19/0.60  
% 0.19/0.60  % Comments : Surplus transitivity axiom removed.
% 0.19/0.60  %          : This is dumb, because there is no need for the clause
% 0.19/0.60  %            prove_a_contradiction.
% 0.19/0.60  % Bugfixes : v4.0.0 - Bugfix in NUM001-0.ax
% 0.19/0.60  %--------------------------------------------------------------------------
% 0.19/0.61  %----Include recursive function + and * axioms
% 0.19/0.61  include('Axioms/NUM001-0.ax').
% 0.19/0.61  %----Include recursive function less axioms
% 0.19/0.61  include('Axioms/NUM001-1.ax').
% 0.19/0.61  %----Include recursive function divides axioms
% 0.19/0.61  include('Axioms/NUM001-2.ax').
% 0.19/0.61  %--------------------------------------------------------------------------
% 0.19/0.61  cnf(reflexivity,axiom,
% 0.19/0.61      equalish(X,X) ).
% 0.19/0.61  
% 0.19/0.61  cnf(symmetry,axiom,
% 0.19/0.61      ( ~ equalish(X,Y)
% 0.19/0.61      | equalish(Y,X) ) ).
% 0.19/0.61  
% 0.19/0.61  cnf(transitivity,axiom,
% 0.19/0.61      ( ~ equalish(X,Y)
% 0.19/0.61      | ~ equalish(Y,Z)
% 0.19/0.61      | equalish(X,Z) ) ).
% 0.19/0.61  
% 0.19/0.61  cnf(b_less_than_c,hypothesis,
% 0.19/0.61      less(b,c) ).
% 0.19/0.61  
% 0.19/0.61  cnf(b_greater_equal_a,hypothesis,
% 0.19/0.61      ~ less(b,a) ).
% 0.19/0.61  
% 0.19/0.61  cnf(impossible_c_divides_a,negated_conjecture,
% 0.19/0.61      divides(c,a) ).
% 0.19/0.61  
% 0.19/0.61  cnf(prove_a_contradiction,negated_conjecture,
% 0.19/0.61      ~ equalish(successor(A),n0) ).
% 0.19/0.61  
% 0.19/0.61  %--------------------------------------------------------------------------
% 0.19/0.61  %-------------------------------------------
% 0.19/0.61  % Proof found
% 0.19/0.61  % SZS status Theorem for theBenchmark
% 0.19/0.61  % SZS output start Proof
% 0.19/0.61  %ClaNum:19(EqnAxiom:0)
% 0.19/0.61  %VarNum:64(SingletonVarNum:31)
% 0.19/0.61  %MaxLitNum:3
% 0.19/0.61  %MaxfuncDepth:3
% 0.19/0.61  %SharedTerms:7
% 0.19/0.61  %goalClause: 2 9
% 0.19/0.61  %singleGoalClaCount:2
% 0.19/0.61  [1]P1(a1,a4)
% 0.19/0.61  [2]P2(a4,a2)
% 0.19/0.61  [8]~P1(a1,a2)
% 0.19/0.61  [3]P3(x31,x31)
% 0.19/0.61  [4]P3(f6(x41,a5),a5)
% 0.19/0.61  [5]P3(f3(x51,a5),x51)
% 0.19/0.61  [9]~P3(f7(x91),a5)
% 0.19/0.61  [6]P3(f3(x61,f7(x62)),f7(f3(x61,x62)))
% 0.19/0.61  [7]P3(f6(x71,f7(x72)),f3(f6(x71,x72),x71))
% 0.19/0.61  [10]~P3(x102,x101)+P3(x101,x102)
% 0.19/0.61  [11]~P3(x111,x112)+P2(x111,x112)
% 0.19/0.61  [12]~P1(x121,x122)+P2(x121,x122)
% 0.19/0.61  [13]~P3(x131,x132)+P3(f7(x131),f7(x132))
% 0.19/0.61  [15]P3(x151,x152)+~P3(f7(x151),f7(x152))
% 0.19/0.61  [19]~P1(x192,x191)+P3(f3(f7(f8(x191,x192)),x192),x191)
% 0.19/0.61  [18]P1(x181,x182)+~P3(f3(f7(x183),x181),x182)
% 0.19/0.61  [14]P1(x141,x142)+~P2(x141,x142)+P3(x141,x142)
% 0.19/0.61  [16]~P3(x161,x163)+P3(x161,x162)+~P3(x163,x162)
% 0.19/0.61  [17]~P1(x173,x172)+P1(x171,x172)+~P1(x171,x173)
% 0.19/0.61  %EqnAxiom
% 0.19/0.61  
% 0.19/0.61  %-------------------------------------------
% 0.19/0.61  cnf(21,plain,
% 0.19/0.61     (P1(x211,f3(f7(x212),x211))),
% 0.19/0.61     inference(scs_inference,[],[3,9,10,18])).
% 0.19/0.61  cnf(22,plain,
% 0.19/0.61     (P3(x221,x221)),
% 0.19/0.61     inference(rename_variables,[],[3])).
% 0.19/0.61  cnf(24,plain,
% 0.19/0.61     (P1(a1,f3(f7(x241),a4))),
% 0.19/0.61     inference(scs_inference,[],[3,1,9,10,18,17])).
% 0.19/0.61  cnf(34,plain,
% 0.19/0.61     (P3(f3(f7(f8(a4,a1)),a1),a4)),
% 0.19/0.61     inference(scs_inference,[],[3,22,1,5,9,10,18,17,12,11,15,13,19])).
% 0.19/0.61  cnf(44,plain,
% 0.19/0.61     (~P3(f3(f7(x441),a1),a2)),
% 0.19/0.61     inference(scs_inference,[],[8,4,7,5,16,10,18])).
% 0.19/0.61  cnf(48,plain,
% 0.19/0.61     (P3(a4,a2)),
% 0.19/0.61     inference(scs_inference,[],[2,8,4,7,5,1,16,10,18,17,14])).
% 0.19/0.61  cnf(62,plain,
% 0.19/0.61     (~P1(f3(f7(x621),a4),a2)),
% 0.19/0.61     inference(scs_inference,[],[8,24,17])).
% 0.19/0.61  cnf(64,plain,
% 0.19/0.61     (~P3(f7(x641),f6(x642,a5))),
% 0.19/0.61     inference(scs_inference,[],[9,4,8,24,17,16])).
% 0.19/0.61  cnf(91,plain,
% 0.19/0.61     ($false),
% 0.19/0.61     inference(scs_inference,[],[21,4,5,64,48,34,62,44,12,17,18,10,11,13,15,16]),
% 0.19/0.61     ['proof']).
% 0.19/0.61  % SZS output end Proof
% 0.19/0.61  % Total time :0.010000s
%------------------------------------------------------------------------------