%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : NUM025-2 : TPTP v8.2.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n001.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:01 EDT 2024
% Result : Unsatisfiable 0.64s 0.71s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : NUM025-2 : TPTP v8.2.0. Bugfixed v4.0.0.
% 0.04/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.36 % Computer : n001.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun Jun 23 01:06:39 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.60/0.67 start to proof:theBenchmark
% 0.64/0.71 %-------------------------------------------
% 0.64/0.71 % File :CSE---1.7
% 0.64/0.71 % Problem :theBenchmark
% 0.64/0.71 % Transform :cnf
% 0.64/0.71 % Format :tptp:raw
% 0.64/0.71 % Command :java -jar mcs_scs.jar %d %s
% 0.64/0.71
% 0.64/0.71 % Result :Theorem 0.000000s
% 0.64/0.71 % Output :CNFRefutation 0.000000s
% 0.64/0.71 %-------------------------------------------
% 0.64/0.71 %--------------------------------------------------------------------------
% 0.64/0.71 % File : NUM025-2 : TPTP v8.2.0. Bugfixed v4.0.0.
% 0.64/0.71 % Domain : Number Theory
% 0.64/0.71 % Problem : If a<b then not b<a
% 0.64/0.71 % Version : [LS74] axioms : Incomplete > Reduced > Incomplete.
% 0.64/0.71 % English :
% 0.64/0.71
% 0.64/0.71 % Refs : [LS74] Lawrence & Starkey (1974), Experimental Tests of Resol
% 0.64/0.71 % Source : [TPTP]
% 0.64/0.71 % Names : Problem 76t1 [LS74]
% 0.64/0.71
% 0.64/0.71 % Status : Unsatisfiable
% 0.64/0.71 % Rating : 0.00 v5.0.0, 0.07 v4.1.0, 0.00 v4.0.0
% 0.64/0.71 % Syntax : Number of clauses : 16 ( 9 unt; 2 nHn; 8 RR)
% 0.64/0.71 % Number of literals : 25 ( 0 equ; 11 neg)
% 0.64/0.71 % Maximal clause size : 3 ( 1 avg)
% 0.64/0.71 % Maximal term depth : 4 ( 1 avg)
% 0.64/0.71 % Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty)
% 0.64/0.71 % Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% 0.64/0.71 % Number of variables : 26 ( 3 sgn)
% 0.64/0.71 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.64/0.71
% 0.64/0.71 % Comments : ++less transformed to --greater_or_equal
% 0.64/0.71 % : The surplus transitivity axiom is removed.
% 0.64/0.71 % Bugfixes : v4.0.0 - Bugfix in NUM001-0.ax
% 0.64/0.71 %--------------------------------------------------------------------------
% 0.64/0.71 %----Include recursive function axioms
% 0.64/0.71 include('Axioms/NUM001-0.ax').
% 0.64/0.71 %--------------------------------------------------------------------------
% 0.64/0.71 cnf(reflexivity,axiom,
% 0.64/0.71 equalish(X,X) ).
% 0.64/0.71
% 0.64/0.71 cnf(symmetry,axiom,
% 0.64/0.71 ( ~ equalish(X,Y)
% 0.64/0.71 | equalish(Y,X) ) ).
% 0.64/0.71
% 0.64/0.71 cnf(transitivity,axiom,
% 0.64/0.71 ( ~ equalish(X,Y)
% 0.64/0.71 | ~ equalish(Y,Z)
% 0.64/0.71 | equalish(X,Z) ) ).
% 0.64/0.71
% 0.64/0.71 %----Include recursive function less axioms
% 0.64/0.71 cnf(transitivity_of_less,axiom,
% 0.64/0.71 ( greater_or_equalish(A,B)
% 0.64/0.71 | greater_or_equalish(C,A)
% 0.64/0.71 | ~ greater_or_equalish(C,B) ) ).
% 0.64/0.71
% 0.64/0.71 cnf(smaller_number,axiom,
% 0.64/0.71 ( ~ equalish(add(successor(A),B),C)
% 0.64/0.71 | ~ greater_or_equalish(B,C) ) ).
% 0.64/0.71
% 0.64/0.71 cnf(less_lemma,axiom,
% 0.64/0.71 ( greater_or_equalish(A,B)
% 0.64/0.71 | equalish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B) ) ).
% 0.64/0.71
% 0.64/0.71 cnf(zero_is_the_first_number,axiom,
% 0.64/0.71 ~ equalish(successor(A),n0) ).
% 0.64/0.71
% 0.64/0.71 cnf(no_number_less_than_itself,axiom,
% 0.64/0.71 greater_or_equalish(A,A) ).
% 0.64/0.71
% 0.64/0.71 cnf(a_less_than_b,hypothesis,
% 0.64/0.71 ~ greater_or_equalish(a,b) ).
% 0.64/0.71
% 0.64/0.71 cnf(prove_b_not_less_than_a,negated_conjecture,
% 0.64/0.71 ~ greater_or_equalish(b,a) ).
% 0.64/0.71
% 0.64/0.71 %--------------------------------------------------------------------------
% 0.64/0.71 %-------------------------------------------
% 0.64/0.71 % Proof found
% 0.64/0.71 % SZS status Theorem for theBenchmark
% 0.64/0.71 % SZS output start Proof
% 0.64/0.71 %ClaNum:16(EqnAxiom:0)
% 0.64/0.71 %VarNum:52(SingletonVarNum:26)
% 0.64/0.71 %MaxLitNum:3
% 0.64/0.71 %MaxfuncDepth:3
% 0.64/0.71 %SharedTerms:5
% 0.64/0.71 %goalClause: 8
% 0.64/0.71 %singleGoalClaCount:1
% 0.64/0.71 [7]~P2(a4,a5)
% 0.64/0.71 [8]~P2(a5,a4)
% 0.64/0.71 [1]P1(x11,x11)
% 0.64/0.71 [2]P2(x21,x21)
% 0.64/0.71 [3]P1(f2(x31,a1),a1)
% 0.64/0.71 [4]P1(f3(x41,a1),x41)
% 0.64/0.71 [9]~P1(f6(x91),a1)
% 0.64/0.71 [5]P1(f3(x51,f6(x52)),f6(f3(x51,x52)))
% 0.64/0.71 [6]P1(f2(x61,f6(x62)),f3(f2(x61,x62),x61))
% 0.64/0.71 [10]~P1(x102,x101)+P1(x101,x102)
% 0.64/0.71 [11]~P1(x111,x112)+P1(f6(x111),f6(x112))
% 0.64/0.71 [13]P1(x131,x132)+~P1(f6(x131),f6(x132))
% 0.64/0.71 [16]P2(x161,x162)+P1(f3(f6(f7(x162,x161)),x161),x162)
% 0.64/0.71 [15]~P2(x151,x152)+~P1(f3(f6(x153),x151),x152)
% 0.64/0.71 [12]~P2(x121,x123)+P2(x121,x122)+P2(x122,x123)
% 0.64/0.71 [14]~P1(x141,x143)+P1(x141,x142)+~P1(x143,x142)
% 0.64/0.71 %EqnAxiom
% 0.64/0.71
% 0.64/0.71 %-------------------------------------------
% 0.64/0.72 cnf(17,plain,
% 0.64/0.72 ($false),
% 0.64/0.72 inference(scs_inference,[],[2,8,7,12]),
% 0.64/0.72 ['proof']).
% 0.64/0.72 % SZS output end Proof
% 0.64/0.72 % Total time :0.000000s
%------------------------------------------------------------------------------