TSTP Solution File: NUM020-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : NUM020-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 : n004.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:17 EDT 2023
% Result : Unsatisfiable 0.20s 0.63s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : NUM020-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.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 25 17:14:08 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.57 start to proof:theBenchmark
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % File :CSE---1.6
% 0.20/0.63 % Problem :theBenchmark
% 0.20/0.63 % Transform :cnf
% 0.20/0.63 % Format :tptp:raw
% 0.20/0.63 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.63
% 0.20/0.63 % Result :Theorem 0.000000s
% 0.20/0.63 % Output :CNFRefutation 0.000000s
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 % File : NUM020-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.20/0.63 % Domain : Number Theory
% 0.20/0.63 % Problem : a + 1 = successor(a)
% 0.20/0.63 % Version : [LS74] axioms :
% 0.20/0.63 % Incomplete > Reduced > Incomplete.
% 0.20/0.63 % English :
% 0.20/0.63
% 0.20/0.63 % Refs : [LS74] Lawrence & Starkey (1974), Experimental Tests of Resol
% 0.20/0.63 % : [WM76] Wilson & Minker (1976), Resolution, Refinements, and S
% 0.20/0.63 % Source : [SPRFN]
% 0.20/0.63 % Names : ls55 [LS74]
% 0.20/0.63 % : ls55 [WM76]
% 0.20/0.63
% 0.20/0.63 % Status : Unsatisfiable
% 0.20/0.63 % 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.20/0.63 % Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 7 RR)
% 0.20/0.63 % Number of literals : 17 ( 0 equ; 7 neg)
% 0.20/0.63 % Maximal clause size : 3 ( 1 avg)
% 0.20/0.63 % Maximal term depth : 3 ( 1 avg)
% 0.20/0.63 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty)
% 0.20/0.63 % Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% 0.20/0.63 % Number of variables : 17 ( 2 sgn)
% 0.20/0.63 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.63
% 0.20/0.63 % Comments : Surplus transitivity axiom removed.
% 0.20/0.63 % : This is dumb, because there is no need for the clause
% 0.20/0.63 % prove_a_contradiction.
% 0.20/0.63 % Bugfixes : v4.0.0 - Bugfix in NUM001-0.ax
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 %----Include recursive function + and * axioms
% 0.20/0.63 include('Axioms/NUM001-0.ax').
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 cnf(reflexivity,axiom,
% 0.20/0.63 equalish(X,X) ).
% 0.20/0.63
% 0.20/0.63 cnf(symmetry,axiom,
% 0.20/0.63 ( ~ equalish(X,Y)
% 0.20/0.63 | equalish(Y,X) ) ).
% 0.20/0.63
% 0.20/0.63 cnf(transitivity,axiom,
% 0.20/0.63 ( ~ equalish(X,Y)
% 0.20/0.63 | ~ equalish(Y,Z)
% 0.20/0.63 | equalish(X,Z) ) ).
% 0.20/0.63
% 0.20/0.63 cnf(one_succeeds_zero,axiom,
% 0.20/0.63 equalish(n1,successor(n0)) ).
% 0.20/0.63
% 0.20/0.63 cnf(deny_addition_lemma,negated_conjecture,
% 0.20/0.63 ~ equalish(add(a,successor(n0)),successor(a)) ).
% 0.20/0.63
% 0.20/0.63 cnf(prove_a_contradiction,negated_conjecture,
% 0.20/0.63 ~ equalish(successor(A),n0) ).
% 0.20/0.63
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % Proof found
% 0.20/0.63 % SZS status Theorem for theBenchmark
% 0.20/0.63 % SZS output start Proof
% 0.20/0.63 %ClaNum:12(EqnAxiom:0)
% 0.20/0.63 %VarNum:33(SingletonVarNum:17)
% 0.20/0.63 %MaxLitNum:3
% 0.20/0.63 %MaxfuncDepth:2
% 0.20/0.63 %SharedTerms:8
% 0.20/0.63 %goalClause: 7 8
% 0.20/0.63 %singleGoalClaCount:2
% 0.20/0.63 [2]P1(a1,f6(a2))
% 0.20/0.63 [8]~P1(f4(a5,f6(a2)),f6(a5))
% 0.20/0.63 [1]P1(x11,x11)
% 0.20/0.63 [3]P1(f3(x31,a2),a2)
% 0.20/0.63 [4]P1(f4(x41,a2),x41)
% 0.20/0.63 [7]~P1(f6(x71),a2)
% 0.20/0.63 [5]P1(f4(x51,f6(x52)),f6(f4(x51,x52)))
% 0.20/0.63 [6]P1(f3(x61,f6(x62)),f4(f3(x61,x62),x61))
% 0.20/0.63 [9]~P1(x92,x91)+P1(x91,x92)
% 0.20/0.63 [10]~P1(x101,x102)+P1(f6(x101),f6(x102))
% 0.20/0.63 [11]P1(x111,x112)+~P1(f6(x111),f6(x112))
% 0.20/0.63 [12]~P1(x121,x123)+P1(x121,x122)+~P1(x123,x122)
% 0.20/0.63 %EqnAxiom
% 0.20/0.63
% 0.20/0.63 %-------------------------------------------
% 0.20/0.64 cnf(17,plain,
% 0.20/0.64 (~P1(f6(f4(a5,a2)),f6(a5))),
% 0.20/0.64 inference(scs_inference,[],[7,2,8,5,9,11,10,12])).
% 0.20/0.64 cnf(22,plain,
% 0.20/0.64 ($false),
% 0.20/0.64 inference(scs_inference,[],[4,17,9,10]),
% 0.20/0.64 ['proof']).
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time :0.000000s
%------------------------------------------------------------------------------