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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : FLD021-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d

% Computer : n006.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 : Wed Aug 30 22:26:33 EDT 2023

% Result   : Unsatisfiable 0.20s 0.68s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : FLD021-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35  % Computer : n006.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.20/0.35  % CPULimit   : 300
% 0.20/0.35  % WCLimit    : 300
% 0.20/0.35  % DateTime   : Sun Aug 27 23:38:07 EDT 2023
% 0.20/0.35  % CPUTime    : 
% 0.20/0.61  start to proof:theBenchmark
% 0.20/0.67  %-------------------------------------------
% 0.20/0.67  % File        :CSE---1.6
% 0.20/0.67  % Problem     :theBenchmark
% 0.20/0.67  % Transform   :cnf
% 0.20/0.67  % Format      :tptp:raw
% 0.20/0.67  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.67  
% 0.20/0.67  % Result      :Theorem 0.020000s
% 0.20/0.67  % Output      :CNFRefutation 0.020000s
% 0.20/0.67  %-------------------------------------------
% 0.20/0.68  %--------------------------------------------------------------------------
% 0.20/0.68  % File     : FLD021-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.20/0.68  % Domain   : Field Theory (Ordered fields)
% 0.20/0.68  % Problem  : Every element equal to zero is an additive identity
% 0.20/0.68  % Version  : [Dra93] axioms : Especial.
% 0.20/0.68  %            Theorem formulation : Functional with glxx axiom set.
% 0.20/0.68  % English  :
% 0.20/0.68  
% 0.20/0.68  % Refs     : [Dra93] Draeger (1993), Anwendung des Theorembeweisers SETHEO
% 0.20/0.68  % Source   : [Dra93]
% 0.20/0.68  % Names    :
% 0.20/0.68  
% 0.20/0.68  % Status   : Unsatisfiable
% 0.20/0.68  % Rating   : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.14 v6.2.0, 0.00 v5.5.0, 0.12 v5.4.0, 0.10 v5.2.0, 0.00 v5.0.0, 0.21 v4.1.0, 0.00 v4.0.1, 0.20 v4.0.0, 0.14 v3.4.0, 0.25 v3.3.0, 0.33 v3.1.0, 0.17 v2.7.0, 0.00 v2.6.0, 0.33 v2.5.0, 0.00 v2.2.1, 0.33 v2.1.0
% 0.20/0.68  % Syntax   : Number of clauses     :   31 (   7 unt;   3 nHn;  31 RR)
% 0.20/0.68  %            Number of literals    :   77 (   0 equ;  45 neg)
% 0.20/0.68  %            Maximal clause size   :    4 (   2 avg)
% 0.20/0.68  %            Maximal term depth    :    3 (   1 avg)
% 0.20/0.68  %            Number of predicates  :    3 (   3 usr;   0 prp; 1-2 aty)
% 0.20/0.68  %            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
% 0.20/0.68  %            Number of variables   :   50 (   0 sgn)
% 0.20/0.68  % SPC      : CNF_UNS_RFO_NEQ_NHN
% 0.20/0.68  
% 0.20/0.68  % Comments :
% 0.20/0.68  % Bugfixes : v2.1.0 - Bugfix in FLD001-0.ax
% 0.20/0.68  %--------------------------------------------------------------------------
% 0.20/0.68  include('Axioms/FLD001-0.ax').
% 0.20/0.68  %--------------------------------------------------------------------------
% 0.20/0.68  cnf(a_is_defined,hypothesis,
% 0.20/0.68      defined(a) ).
% 0.20/0.68  
% 0.20/0.68  cnf(m_is_defined,hypothesis,
% 0.20/0.68      defined(m) ).
% 0.20/0.68  
% 0.20/0.68  cnf(m_equals_additive_identity_3,negated_conjecture,
% 0.20/0.68      equalish(m,additive_identity) ).
% 0.20/0.68  
% 0.20/0.68  cnf(add_not_equal_to_a_4,negated_conjecture,
% 0.20/0.68      ~ equalish(add(m,a),a) ).
% 0.20/0.68  
% 0.20/0.68  %--------------------------------------------------------------------------
% 0.20/0.68  %-------------------------------------------
% 0.20/0.68  % Proof found
% 0.20/0.68  % SZS status Theorem for theBenchmark
% 0.20/0.68  % SZS output start Proof
% 0.20/0.68  %ClaNum:31(EqnAxiom:0)
% 0.20/0.68  %VarNum:128(SingletonVarNum:50)
% 0.20/0.68  %MaxLitNum:4
% 0.20/0.68  %MaxfuncDepth:2
% 0.20/0.68  %SharedTerms:12
% 0.20/0.68  %goalClause: 5 7
% 0.20/0.68  %singleGoalClaCount:2
% 0.20/0.68  [1]P1(a1)
% 0.20/0.68  [2]P1(a4)
% 0.20/0.68  [3]P1(a2)
% 0.20/0.68  [4]P1(a5)
% 0.20/0.68  [5]P2(a5,a1)
% 0.20/0.68  [6]~P2(a1,a4)
% 0.20/0.68  [7]~P2(f3(a5,a2),a2)
% 0.20/0.68  [9]~P1(x91)+P2(x91,x91)
% 0.20/0.68  [8]~P1(x81)+P1(f6(x81))
% 0.20/0.68  [13]~P1(x131)+P2(f3(a1,x131),x131)
% 0.20/0.68  [14]~P1(x141)+P2(f8(a4,x141),x141)
% 0.20/0.68  [17]~P1(x171)+P2(f3(x171,f6(x171)),a1)
% 0.20/0.68  [11]~P2(x112,x111)+P2(x111,x112)
% 0.20/0.68  [10]~P1(x101)+P2(x101,a1)+P1(f7(x101))
% 0.20/0.68  [22]~P1(x221)+P2(x221,a1)+P2(f8(x221,f7(x221)),a4)
% 0.20/0.68  [19]~P3(x192,x191)+~P3(x191,x192)+P2(x191,x192)
% 0.20/0.68  [15]~P1(x152)+~P1(x151)+P1(f3(x151,x152))
% 0.20/0.68  [16]~P1(x162)+~P1(x161)+P1(f8(x161,x162))
% 0.20/0.68  [23]~P3(a1,x232)+~P3(a1,x231)+P3(a1,f8(x231,x232))
% 0.20/0.68  [24]~P1(x242)+~P1(x241)+P2(f3(x241,x242),f3(x242,x241))
% 0.20/0.68  [25]~P1(x252)+~P1(x251)+P2(f8(x251,x252),f8(x252,x251))
% 0.20/0.68  [18]~P2(x181,x183)+P2(x181,x182)+~P2(x183,x182)
% 0.20/0.68  [20]~P3(x203,x202)+P3(x201,x202)+~P2(x203,x201)
% 0.20/0.68  [21]~P3(x211,x213)+P3(x211,x212)+~P3(x213,x212)
% 0.20/0.68  [26]~P1(x262)+~P2(x261,x263)+P2(f3(x261,x262),f3(x263,x262))
% 0.20/0.68  [27]~P1(x272)+~P2(x271,x273)+P2(f8(x271,x272),f8(x273,x272))
% 0.20/0.68  [28]~P1(x282)+~P3(x281,x283)+P3(f3(x281,x282),f3(x283,x282))
% 0.20/0.68  [12]P3(x122,x121)+~P1(x121)+~P1(x122)+P3(x121,x122)
% 0.20/0.68  [29]~P1(x293)+~P1(x292)+~P1(x291)+P2(f3(x291,f3(x292,x293)),f3(f3(x291,x292),x293))
% 0.20/0.68  [30]~P1(x303)+~P1(x302)+~P1(x301)+P2(f8(x301,f8(x302,x303)),f8(f8(x301,x302),x303))
% 0.20/0.68  [31]~P1(x313)+~P1(x312)+~P1(x311)+P2(f3(f8(x311,x312),f8(x313,x312)),f8(f3(x311,x313),x312))
% 0.20/0.68  %EqnAxiom
% 0.20/0.68  
% 0.20/0.68  %-------------------------------------------
% 0.20/0.69  cnf(32,plain,
% 0.20/0.69     (~P2(a4,a1)),
% 0.20/0.69     inference(scs_inference,[],[6,11])).
% 0.20/0.69  cnf(39,plain,
% 0.20/0.69     (P2(f3(a1,a1),a1)),
% 0.20/0.69     inference(scs_inference,[],[5,1,6,11,18,12,9,14,13])).
% 0.20/0.69  cnf(43,plain,
% 0.20/0.69     (P2(f3(a1,f6(a1)),a1)),
% 0.20/0.69     inference(scs_inference,[],[5,1,6,11,18,12,9,14,13,8,17])).
% 0.20/0.69  cnf(47,plain,
% 0.20/0.69     (P3(a1,f8(a1,a1))),
% 0.20/0.69     inference(scs_inference,[],[5,1,6,11,18,12,9,14,13,8,17,19,23])).
% 0.20/0.69  cnf(55,plain,
% 0.20/0.69     (P3(f3(a1,a1),f3(a1,a1))),
% 0.20/0.69     inference(scs_inference,[],[5,1,2,6,11,18,12,9,14,13,8,17,19,23,16,15,10,28])).
% 0.20/0.69  cnf(71,plain,
% 0.20/0.69     (P2(f3(f8(a1,a1),f8(a1,a1)),f8(f3(a1,a1),a1))),
% 0.20/0.69     inference(scs_inference,[],[5,1,2,6,11,18,12,9,14,13,8,17,19,23,16,15,10,28,27,26,25,24,22,30,29,31])).
% 0.20/0.69  cnf(105,plain,
% 0.20/0.69     (~P2(f3(a1,a2),a2)),
% 0.20/0.69     inference(scs_inference,[],[5,3,7,55,39,47,23,15,26,24,29,11,16,28,27,25,30,31,20,21,19,18])).
% 0.20/0.69  cnf(131,plain,
% 0.20/0.69     ($false),
% 0.20/0.69     inference(scs_inference,[],[32,3,71,105,43,18,11,13]),
% 0.20/0.69     ['proof']).
% 0.20/0.69  % SZS output end Proof
% 0.20/0.69  % Total time :0.020000s
%------------------------------------------------------------------------------