TSTP Solution File: NUM023-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : NUM023-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 : n014.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.59s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM023-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.17/0.34 % Computer : n014.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Fri Aug 25 11:13:48 EDT 2023
% 0.17/0.34 % CPUTime :
% 0.19/0.53 start to proof:theBenchmark
% 0.19/0.58 %-------------------------------------------
% 0.19/0.58 % File :CSE---1.6
% 0.19/0.58 % Problem :theBenchmark
% 0.19/0.58 % Transform :cnf
% 0.19/0.58 % Format :tptp:raw
% 0.19/0.58 % Command :java -jar mcs_scs.jar %d %s
% 0.19/0.58
% 0.19/0.58 % Result :Theorem 0.000000s
% 0.19/0.58 % Output :CNFRefutation 0.000000s
% 0.19/0.58 %-------------------------------------------
% 0.19/0.59 %--------------------------------------------------------------------------
% 0.19/0.59 % File : NUM023-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.19/0.59 % Domain : Number Theory
% 0.19/0.59 % Problem : Zero is less than all successor numbers
% 0.19/0.59 % Version : [LS74] axioms : Incomplete.
% 0.19/0.59 % English :
% 0.19/0.59
% 0.19/0.59 % Refs : [LS74] Lawrence & Starkey (1974), Experimental Tests of Resol
% 0.19/0.59 % : [WM76] Wilson & Minker (1976), Resolution, Refinements, and S
% 0.19/0.59 % Source : [SPRFN]
% 0.19/0.59 % Names : ls68 [LS74]
% 0.19/0.59 % : ls68 [WM76]
% 0.19/0.59
% 0.19/0.59 % Status : Unsatisfiable
% 0.19/0.59 % Rating : 0.00 v7.2.0, 0.25 v6.2.0, 0.17 v6.1.0, 0.07 v6.0.0, 0.11 v5.5.0, 0.06 v5.4.0, 0.11 v5.3.0, 0.15 v5.1.0, 0.19 v5.0.0, 0.07 v4.1.0, 0.13 v4.0.1, 0.14 v4.0.0
% 0.19/0.59 % Syntax : Number of clauses : 15 ( 8 unt; 0 nHn; 9 RR)
% 0.19/0.59 % Number of literals : 24 ( 0 equ; 11 neg)
% 0.19/0.59 % Maximal clause size : 3 ( 1 avg)
% 0.19/0.59 % Maximal term depth : 4 ( 1 avg)
% 0.19/0.59 % Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty)
% 0.19/0.59 % Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% 0.19/0.59 % Number of variables : 26 ( 3 sgn)
% 0.19/0.59 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.19/0.59
% 0.19/0.59 % Comments : Surplus transitivity axiom removed and transitivity of less
% 0.19/0.59 % included.
% 0.19/0.59 % Bugfixes : v4.0.0 - Bugfix in NUM001-0.ax
% 0.19/0.59 %--------------------------------------------------------------------------
% 0.19/0.59 %----Include recursive function + and * axioms
% 0.19/0.59 include('Axioms/NUM001-0.ax').
% 0.19/0.59 %----Include recursive function less axioms
% 0.19/0.59 include('Axioms/NUM001-1.ax').
% 0.19/0.59 %--------------------------------------------------------------------------
% 0.19/0.59 cnf(reflexivity,axiom,
% 0.19/0.59 equalish(X,X) ).
% 0.19/0.59
% 0.19/0.59 cnf(symmetry,axiom,
% 0.19/0.59 ( ~ equalish(X,Y)
% 0.19/0.59 | equalish(Y,X) ) ).
% 0.19/0.59
% 0.19/0.59 cnf(transitivity,axiom,
% 0.19/0.59 ( ~ equalish(X,Y)
% 0.19/0.59 | ~ equalish(Y,Z)
% 0.19/0.59 | equalish(X,Z) ) ).
% 0.19/0.59
% 0.19/0.59 cnf(zero_is_first_number,axiom,
% 0.19/0.59 ~ equalish(successor(A),n0) ).
% 0.19/0.59
% 0.19/0.59 cnf(numbers_less_than_its_successor,axiom,
% 0.19/0.59 less(A,successor(A)) ).
% 0.19/0.59
% 0.19/0.59 cnf(prove_zero_is_less_than_all_successors,negated_conjecture,
% 0.19/0.59 ~ less(n0,successor(a)) ).
% 0.19/0.59
% 0.19/0.59 %--------------------------------------------------------------------------
% 0.19/0.59 %-------------------------------------------
% 0.19/0.59 % Proof found
% 0.19/0.59 % SZS status Theorem for theBenchmark
% 0.19/0.59 % SZS output start Proof
% 0.19/0.59 %ClaNum:15(EqnAxiom:0)
% 0.19/0.59 %VarNum:52(SingletonVarNum:26)
% 0.19/0.59 %MaxLitNum:3
% 0.19/0.59 %MaxfuncDepth:3
% 0.19/0.59 %SharedTerms:4
% 0.19/0.59 %goalClause: 7
% 0.19/0.59 %singleGoalClaCount:1
% 0.19/0.59 [7]~P2(a2,f1(a5))
% 0.19/0.59 [1]P1(x11,x11)
% 0.19/0.59 [2]P2(x21,f1(x21))
% 0.19/0.59 [3]P1(f3(x31,a2),a2)
% 0.19/0.59 [4]P1(f4(x41,a2),x41)
% 0.19/0.59 [8]~P1(f1(x81),a2)
% 0.19/0.59 [5]P1(f4(x51,f1(x52)),f1(f4(x51,x52)))
% 0.19/0.59 [6]P1(f3(x61,f1(x62)),f4(f3(x61,x62),x61))
% 0.19/0.59 [9]~P1(x92,x91)+P1(x91,x92)
% 0.19/0.59 [10]~P1(x101,x102)+P1(f1(x101),f1(x102))
% 0.19/0.59 [11]P1(x111,x112)+~P1(f1(x111),f1(x112))
% 0.19/0.59 [15]~P2(x152,x151)+P1(f4(f1(f6(x151,x152)),x152),x151)
% 0.19/0.59 [14]P2(x141,x142)+~P1(f4(f1(x143),x141),x142)
% 0.19/0.59 [12]~P1(x121,x123)+P1(x121,x122)+~P1(x123,x122)
% 0.19/0.59 [13]~P2(x133,x132)+P2(x131,x132)+~P2(x131,x133)
% 0.19/0.59 %EqnAxiom
% 0.19/0.59
% 0.19/0.59 %-------------------------------------------
% 0.19/0.59 cnf(16,plain,
% 0.19/0.59 ($false),
% 0.19/0.59 inference(scs_inference,[],[7,4,14]),
% 0.19/0.59 ['proof']).
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time :0.000000s
%------------------------------------------------------------------------------