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

View Problem - Process Solution

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

% Computer : n013.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:32 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : FLD017-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.33  % Computer : n013.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Sun Aug 27 23:44:02 EDT 2023
% 0.13/0.33  % CPUTime    : 
% 0.20/0.55  start to proof:theBenchmark
% 0.20/0.61  %-------------------------------------------
% 0.20/0.61  % File        :CSE---1.6
% 0.20/0.61  % Problem     :theBenchmark
% 0.20/0.61  % Transform   :cnf
% 0.20/0.61  % Format      :tptp:raw
% 0.20/0.61  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.61  
% 0.20/0.61  % Result      :Theorem 0.000000s
% 0.20/0.61  % Output      :CNFRefutation 0.000000s
% 0.20/0.61  %-------------------------------------------
% 0.20/0.61  %--------------------------------------------------------------------------
% 0.20/0.61  % File     : FLD017-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.20/0.61  % Domain   : Field Theory (Ordered fields)
% 0.20/0.61  % Problem  : Substitution of an element in additive equations
% 0.20/0.61  % Version  : [Dra93] axioms : Especial.
% 0.20/0.61  %            Theorem formulation : Functional with glxx axiom set.
% 0.20/0.61  % English  :
% 0.20/0.61  
% 0.20/0.61  % Refs     : [Dra93] Draeger (1993), Anwendung des Theorembeweisers SETHEO
% 0.20/0.61  % Source   : [Dra93]
% 0.20/0.61  % Names    :
% 0.20/0.61  
% 0.20/0.61  % Status   : Unsatisfiable
% 0.20/0.61  % Rating   : 0.00 v7.4.0, 0.17 v7.0.0, 0.00 v5.5.0, 0.12 v5.4.0, 0.20 v5.2.0, 0.00 v5.1.0, 0.09 v5.0.0, 0.29 v4.1.0, 0.12 v4.0.1, 0.20 v4.0.0, 0.29 v3.4.0, 0.25 v3.3.0, 0.33 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.61  % Syntax   : Number of clauses     :   34 (  10 unt;   3 nHn;  34 RR)
% 0.20/0.61  %            Number of literals    :   80 (   0 equ;  45 neg)
% 0.20/0.61  %            Maximal clause size   :    4 (   2 avg)
% 0.20/0.61  %            Maximal term depth    :    3 (   1 avg)
% 0.20/0.61  %            Number of predicates  :    3 (   3 usr;   0 prp; 1-2 aty)
% 0.20/0.61  %            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
% 0.20/0.61  %            Number of variables   :   50 (   0 sgn)
% 0.20/0.61  % SPC      : CNF_UNS_RFO_NEQ_NHN
% 0.20/0.61  
% 0.20/0.61  % Comments :
% 0.20/0.61  % Bugfixes : v2.1.0 - Bugfix in FLD001-0.ax
% 0.20/0.61  %--------------------------------------------------------------------------
% 0.20/0.61  include('Axioms/FLD001-0.ax').
% 0.20/0.61  %--------------------------------------------------------------------------
% 0.20/0.61  cnf(a_is_defined,hypothesis,
% 0.20/0.61      defined(a) ).
% 0.20/0.61  
% 0.20/0.61  cnf(b_is_defined,hypothesis,
% 0.20/0.61      defined(b) ).
% 0.20/0.61  
% 0.20/0.61  cnf(c_is_defined,hypothesis,
% 0.20/0.61      defined(c) ).
% 0.20/0.61  
% 0.20/0.61  cnf(x_is_defined,hypothesis,
% 0.20/0.61      defined(x) ).
% 0.20/0.61  
% 0.20/0.61  cnf(a_equals_x_5,negated_conjecture,
% 0.20/0.61      equalish(a,x) ).
% 0.20/0.61  
% 0.20/0.61  cnf(add_equals_c_6,negated_conjecture,
% 0.20/0.61      equalish(add(a,b),c) ).
% 0.20/0.61  
% 0.20/0.61  cnf(add_not_equal_to_c_7,negated_conjecture,
% 0.20/0.61      ~ equalish(add(x,b),c) ).
% 0.20/0.61  
% 0.20/0.61  %--------------------------------------------------------------------------
% 0.20/0.61  %-------------------------------------------
% 0.20/0.61  % Proof found
% 0.20/0.61  % SZS status Theorem for theBenchmark
% 0.20/0.61  % SZS output start Proof
% 0.20/0.61  %ClaNum:34(EqnAxiom:0)
% 0.20/0.61  %VarNum:128(SingletonVarNum:50)
% 0.20/0.61  %MaxLitNum:4
% 0.20/0.61  %MaxfuncDepth:2
% 0.20/0.61  %SharedTerms:18
% 0.20/0.61  %goalClause: 7 8 10
% 0.20/0.61  %singleGoalClaCount:3
% 0.20/0.61  [1]P1(a1)
% 0.20/0.61  [2]P1(a4)
% 0.20/0.61  [3]P1(a2)
% 0.20/0.61  [4]P1(a5)
% 0.20/0.61  [5]P1(a7)
% 0.20/0.61  [6]P1(a8)
% 0.20/0.61  [7]P2(a2,a8)
% 0.20/0.61  [9]~P2(a1,a4)
% 0.20/0.61  [8]P2(f3(a2,a5),a7)
% 0.20/0.61  [10]~P2(f3(a8,a5),a7)
% 0.20/0.61  [12]~P1(x121)+P2(x121,x121)
% 0.20/0.61  [11]~P1(x111)+P1(f6(x111))
% 0.20/0.61  [16]~P1(x161)+P2(f3(a1,x161),x161)
% 0.20/0.61  [17]~P1(x171)+P2(f10(a4,x171),x171)
% 0.20/0.61  [20]~P1(x201)+P2(f3(x201,f6(x201)),a1)
% 0.20/0.61  [14]~P2(x142,x141)+P2(x141,x142)
% 0.20/0.61  [13]~P1(x131)+P2(x131,a1)+P1(f9(x131))
% 0.20/0.61  [25]~P1(x251)+P2(x251,a1)+P2(f10(x251,f9(x251)),a4)
% 0.20/0.61  [22]~P3(x222,x221)+~P3(x221,x222)+P2(x221,x222)
% 0.20/0.62  [18]~P1(x182)+~P1(x181)+P1(f3(x181,x182))
% 0.20/0.62  [19]~P1(x192)+~P1(x191)+P1(f10(x191,x192))
% 0.20/0.62  [26]~P3(a1,x262)+~P3(a1,x261)+P3(a1,f10(x261,x262))
% 0.20/0.62  [27]~P1(x272)+~P1(x271)+P2(f3(x271,x272),f3(x272,x271))
% 0.20/0.62  [28]~P1(x282)+~P1(x281)+P2(f10(x281,x282),f10(x282,x281))
% 0.20/0.62  [21]~P2(x211,x213)+P2(x211,x212)+~P2(x213,x212)
% 0.20/0.62  [23]~P3(x233,x232)+P3(x231,x232)+~P2(x233,x231)
% 0.20/0.62  [24]~P3(x241,x243)+P3(x241,x242)+~P3(x243,x242)
% 0.20/0.62  [29]~P1(x292)+~P2(x291,x293)+P2(f3(x291,x292),f3(x293,x292))
% 0.20/0.62  [30]~P1(x302)+~P2(x301,x303)+P2(f10(x301,x302),f10(x303,x302))
% 0.20/0.62  [31]~P1(x312)+~P3(x311,x313)+P3(f3(x311,x312),f3(x313,x312))
% 0.20/0.62  [15]P3(x152,x151)+~P1(x151)+~P1(x152)+P3(x151,x152)
% 0.20/0.62  [32]~P1(x323)+~P1(x322)+~P1(x321)+P2(f3(x321,f3(x322,x323)),f3(f3(x321,x322),x323))
% 0.20/0.62  [33]~P1(x333)+~P1(x332)+~P1(x331)+P2(f10(x331,f10(x332,x333)),f10(f10(x331,x332),x333))
% 0.20/0.62  [34]~P1(x343)+~P1(x342)+~P1(x341)+P2(f3(f10(x341,x342),f10(x343,x342)),f10(f3(x341,x343),x342))
% 0.20/0.62  %EqnAxiom
% 0.20/0.62  
% 0.20/0.62  %-------------------------------------------
% 0.20/0.62  cnf(37,plain,
% 0.20/0.62     (~P2(a8,a2)),
% 0.20/0.62     inference(scs_inference,[],[4,9,8,10,14,21,29])).
% 0.20/0.62  cnf(61,plain,
% 0.20/0.62     (P3(f3(a1,a1),f3(a1,a1))),
% 0.20/0.62     inference(scs_inference,[],[1,2,4,9,8,10,14,21,29,15,12,17,16,11,20,22,26,19,18,13,31])).
% 0.20/0.62  cnf(93,plain,
% 0.20/0.62     ($false),
% 0.20/0.62     inference(scs_inference,[],[7,3,61,37,18,31,29,27,33,32,34,14]),
% 0.20/0.62     ['proof']).
% 0.20/0.62  % SZS output end Proof
% 0.20/0.62  % Total time :0.000000s
%------------------------------------------------------------------------------