%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : NUM002-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n023.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:22:55 EDT 2024
% Result : Unsatisfiable 0.17s 0.58s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : NUM002-1 : TPTP v8.2.0. Released v1.0.0.
% 0.09/0.11 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.11/0.32 % Computer : n023.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 : Sat Jun 22 22:55:09 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.49 start to proof:theBenchmark
% 0.17/0.57 %-------------------------------------------
% 0.17/0.57 % File :CSE---1.7
% 0.17/0.57 % Problem :theBenchmark
% 0.17/0.57 % Transform :cnf
% 0.17/0.57 % Format :tptp:raw
% 0.17/0.57 % Command :java -jar mcs_scs.jar %d %s
% 0.17/0.57
% 0.17/0.57 % Result :Theorem 0.040000s
% 0.17/0.57 % Output :CNFRefutation 0.040000s
% 0.17/0.57 %-------------------------------------------
% 0.17/0.58 %--------------------------------------------------------------------------
% 0.17/0.58 % File : NUM002-1 : TPTP v8.2.0. Released v1.0.0.
% 0.17/0.58 % Domain : Number Theory
% 0.17/0.58 % Problem : (X - Y) + Z = X + (Z - Y)
% 0.17/0.58 % Version : [LS74] (equality) axioms : Especial.
% 0.17/0.58 % English :
% 0.17/0.58
% 0.17/0.58 % Refs : [Cha70] Chang (1970), The Unit Proof and the Input Proof in Th
% 0.17/0.58 % : [LS74] Lawrence & Starkey (1974), Experimental Tests of Resol
% 0.17/0.58 % : [WM76] Wilson & Minker (1976), Resolution, Refinements, and S
% 0.17/0.58 % Source : [SPRFN]
% 0.17/0.58 % Names : Example 10b [Cha70]
% 0.17/0.58 % : ls29 [LS74]
% 0.17/0.58 % : Problem 29 [LS74]
% 0.17/0.58 % : ls29 [WM76]
% 0.17/0.58
% 0.17/0.58 % Status : Unsatisfiable
% 0.17/0.58 % Rating : 0.00 v5.3.0, 0.05 v5.2.0, 0.08 v5.1.0, 0.06 v5.0.0, 0.00 v2.2.1, 0.33 v2.1.0, 0.17 v2.0.0
% 0.17/0.58 % Syntax : Number of clauses : 13 ( 8 unt; 0 nHn; 6 RR)
% 0.17/0.58 % Number of literals : 23 ( 0 equ; 11 neg)
% 0.17/0.58 % Maximal clause size : 3 ( 1 avg)
% 0.17/0.58 % Maximal term depth : 3 ( 1 avg)
% 0.17/0.58 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty)
% 0.17/0.58 % Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% 0.17/0.58 % Number of variables : 35 ( 0 sgn)
% 0.17/0.58 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.17/0.58
% 0.17/0.58 % Comments : The axioms are OK, even though symmetry and some substitution
% 0.17/0.58 % axioms are missing.
% 0.17/0.58 %--------------------------------------------------------------------------
% 0.17/0.58 %----Include additive algebra axioms
% 0.17/0.58 include('Axioms/NUM002-0.ax').
% 0.17/0.58 %--------------------------------------------------------------------------
% 0.17/0.58 cnf(prove_equation,negated_conjecture,
% 0.17/0.58 ~ equalish(add(subtract(a,b),c),add(a,subtract(c,b))) ).
% 0.17/0.58
% 0.17/0.58 %--------------------------------------------------------------------------
% 0.17/0.58 %-------------------------------------------
% 0.17/0.58 % Proof found
% 0.17/0.58 % SZS status Theorem for theBenchmark
% 0.17/0.58 % SZS output start Proof
% 0.17/0.58 %ClaNum:13(EqnAxiom:0)
% 0.17/0.58 %VarNum:70(SingletonVarNum:35)
% 0.17/0.58 %MaxLitNum:3
% 0.17/0.58 %MaxfuncDepth:2
% 0.17/0.58 %SharedTerms:8
% 0.17/0.58 %goalClause: 8
% 0.17/0.58 %singleGoalClaCount:1
% 0.17/0.58 [8]~P1(f1(f3(a2,a4),a5),f1(a2,f3(a5,a4)))
% 0.17/0.58 [1]P1(x11,x11)
% 0.17/0.58 [2]P1(f1(x21,x22),f1(x22,x21))
% 0.17/0.58 [3]P1(x31,f3(f1(x31,x32),x32))
% 0.17/0.58 [4]P1(f3(f1(x41,x42),x42),x41)
% 0.17/0.58 [5]P1(f1(x51,f1(x52,x53)),f1(f1(x51,x52),x53))
% 0.17/0.58 [6]P1(f1(f3(x61,x62),x63),f3(f1(x61,x63),x62))
% 0.17/0.58 [7]P1(f3(f1(x71,x72),x73),f1(f3(x71,x73),x72))
% 0.17/0.58 [9]~P1(x91,x93)+P1(x91,x92)+~P1(x93,x92)
% 0.17/0.58 [10]~P1(x104,x103)+~P1(x101,f1(x102,x104))+P1(x101,f1(x102,x103))
% 0.17/0.58 [11]~P1(x114,x112)+~P1(x111,f1(x114,x113))+P1(x111,f1(x112,x113))
% 0.17/0.58 [12]~P1(x124,x123)+~P1(x121,f3(x122,x124))+P1(x121,f3(x122,x123))
% 0.17/0.58 [13]~P1(x134,x132)+~P1(x131,f3(x134,x133))+P1(x131,f3(x132,x133))
% 0.17/0.58 %EqnAxiom
% 0.17/0.58
% 0.17/0.58 %-------------------------------------------
% 0.17/0.59 cnf(53,plain,
% 0.17/0.59 (~P1(f1(f3(a2,a4),a5),f1(f3(a5,a4),a2))),
% 0.17/0.59 inference(scs_inference,[],[2,8,9])).
% 0.17/0.59 cnf(57,plain,
% 0.17/0.59 (~P1(f1(f3(a2,a4),a5),f3(f1(a5,a2),a4))),
% 0.17/0.59 inference(scs_inference,[],[53,7,9])).
% 0.17/0.59 cnf(76,plain,
% 0.17/0.59 ($false),
% 0.17/0.59 inference(scs_inference,[],[6,57,2,13]),
% 0.17/0.59 ['proof']).
% 0.17/0.59 % SZS output end Proof
% 0.17/0.59 % Total time :0.040000s
%------------------------------------------------------------------------------