%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : FLD013-5 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n027.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 05:55:12 EDT 2024
% Result : Unsatisfiable 2.62s 2.71s
% Output : CNFRefutation 2.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : FLD013-5 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.35 % Computer : n027.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Wed Jun 19 11:16:39 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.54/0.58 start to proof:theBenchmark
% 2.62/2.71 %-------------------------------------------
% 2.62/2.71 % File :CSE---1.7
% 2.62/2.71 % Problem :theBenchmark
% 2.62/2.71 % Transform :cnf
% 2.62/2.71 % Format :tptp:raw
% 2.62/2.71 % Command :java -jar mcs_scs.jar %d %s
% 2.62/2.71
% 2.62/2.71 % Result :Theorem 2.080000s
% 2.62/2.71 % Output :CNFRefutation 2.080000s
% 2.62/2.71 %-------------------------------------------
% 2.62/2.71 %--------------------------------------------------------------------------
% 2.62/2.71 % File : FLD013-5 : TPTP v8.2.0. Bugfixed v2.1.0.
% 2.62/2.71 % Domain : Field Theory (Ordered fields)
% 2.62/2.71 % Problem : The resulting equation of the summation of two equations
% 2.62/2.71 % Version : [Dra93] axioms : Especial.
% 2.62/2.71 % Theorem formulation : Relational variant with re axiom set.
% 2.62/2.71 % English :
% 2.62/2.71
% 2.62/2.71 % Refs : [Dra93] Draeger (1993), Anwendung des Theorembeweisers SETHEO
% 2.62/2.71 % Source : [Dra93]
% 2.62/2.71 % Names :
% 2.62/2.71
% 2.62/2.71 % Status : Unsatisfiable
% 2.62/2.71 % Rating : 0.00 v5.5.0, 0.12 v5.4.0, 0.10 v5.2.0, 0.00 v5.0.0, 0.14 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.4.0, 0.00 v2.2.1, 0.33 v2.1.0
% 2.62/2.71 % Syntax : Number of clauses : 37 ( 14 unt; 3 nHn; 37 RR)
% 2.62/2.71 % Number of literals : 88 ( 0 equ; 50 neg)
% 2.62/2.71 % Maximal clause size : 5 ( 2 avg)
% 2.62/2.71 % Maximal term depth : 2 ( 1 avg)
% 2.62/2.71 % Number of predicates : 4 ( 4 usr; 0 prp; 1-3 aty)
% 2.62/2.71 % Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% 2.62/2.71 % Number of variables : 73 ( 0 sgn)
% 2.62/2.71 % SPC : CNF_UNS_RFO_NEQ_NHN
% 2.62/2.71
% 2.62/2.71 % Comments :
% 2.62/2.71 % Bugfixes : v2.1.0 - Bugfix in FLD002-0.ax
% 2.62/2.71 %--------------------------------------------------------------------------
% 2.62/2.71 include('Axioms/FLD002-0.ax').
% 2.62/2.71 %--------------------------------------------------------------------------
% 2.62/2.71 cnf(a_is_defined,hypothesis,
% 2.62/2.71 defined(a) ).
% 2.62/2.71
% 2.62/2.71 cnf(b_is_defined,hypothesis,
% 2.62/2.71 defined(b) ).
% 2.62/2.71
% 2.62/2.71 cnf(c_is_defined,hypothesis,
% 2.62/2.71 defined(c) ).
% 2.62/2.71
% 2.62/2.71 cnf(d_is_defined,hypothesis,
% 2.62/2.71 defined(d) ).
% 2.62/2.71
% 2.62/2.71 cnf(u_is_defined,hypothesis,
% 2.62/2.71 defined(u) ).
% 2.62/2.71
% 2.62/2.71 cnf(v_is_defined,hypothesis,
% 2.62/2.71 defined(v) ).
% 2.62/2.71
% 2.62/2.71 cnf(sum_7,negated_conjecture,
% 2.62/2.71 sum(additive_identity,a,b) ).
% 2.62/2.71
% 2.62/2.71 cnf(sum_8,negated_conjecture,
% 2.62/2.71 sum(additive_identity,c,d) ).
% 2.62/2.71
% 2.62/2.71 cnf(sum_9,negated_conjecture,
% 2.62/2.71 sum(a,c,u) ).
% 2.62/2.71
% 2.62/2.71 cnf(sum_10,negated_conjecture,
% 2.62/2.71 sum(d,b,v) ).
% 2.62/2.71
% 2.62/2.71 cnf(not_sum_11,negated_conjecture,
% 2.62/2.71 ~ sum(additive_identity,u,v) ).
% 2.62/2.71
% 2.62/2.71 %--------------------------------------------------------------------------
% 2.62/2.71 %-------------------------------------------
% 2.62/2.71 % Proof found
% 2.62/2.71 % SZS status Theorem for theBenchmark
% 2.62/2.71 % SZS output start Proof
% 2.62/2.71 %ClaNum:37(EqnAxiom:0)
% 2.62/2.71 %VarNum:162(SingletonVarNum:73)
% 2.62/2.71 %MaxLitNum:5
% 2.62/2.71 %MaxfuncDepth:1
% 2.62/2.71 %SharedTerms:22
% 2.62/2.71 %goalClause: 9 10 11 12 14
% 2.62/2.71 %singleGoalClaCount:5
% 2.62/2.71 [1]P1(a1)
% 2.62/2.71 [2]P1(a4)
% 2.62/2.71 [3]P1(a2)
% 2.62/2.71 [4]P1(a5)
% 2.62/2.71 [5]P1(a7)
% 2.62/2.71 [6]P1(a8)
% 2.62/2.71 [7]P1(a9)
% 2.62/2.71 [8]P1(a12)
% 2.62/2.71 [9]P2(a1,a2,a5)
% 2.62/2.71 [10]P2(a1,a7,a8)
% 2.62/2.71 [11]P2(a2,a7,a9)
% 2.62/2.71 [12]P2(a8,a5,a12)
% 2.62/2.71 [13]~P2(a1,a1,a4)
% 2.62/2.71 [14]~P2(a1,a9,a12)
% 2.62/2.71 [20]~P1(x201)+P2(a1,x201,x201)
% 2.62/2.71 [21]~P1(x211)+P4(a4,x211,x211)
% 2.62/2.71 [15]~P1(x151)+P1(f6(x151))
% 2.62/2.71 [22]~P1(x221)+P2(f6(x221),x221,a1)
% 2.62/2.71 [29]~P2(x292,x291,x293)+P2(x291,x292,x293)
% 2.62/2.71 [30]~P4(x302,x301,x303)+P4(x301,x302,x303)
% 2.62/2.71 [23]~P1(x231)+P2(a1,x231,a1)+P1(f11(x231))
% 2.62/2.71 [27]~P1(x271)+P4(f11(x271),x271,a4)+P2(a1,x271,a1)
% 2.62/2.71 [26]~P3(x262,x261)+~P3(x261,x262)+P2(a1,x261,x262)
% 2.62/2.71 [17]~P1(x172)+~P1(x171)+P1(f3(x171,x172))
% 2.62/2.71 [18]~P1(x182)+~P1(x181)+P1(f10(x181,x182))
% 2.62/2.71 [24]~P1(x242)+~P1(x241)+P2(x241,x242,f3(x241,x242))
% 2.62/2.71 [25]~P1(x252)+~P1(x251)+P4(x251,x252,f10(x251,x252))
% 2.62/2.71 [19]~P3(x191,x193)+P3(x191,x192)+~P3(x193,x192)
% 2.62/2.71 [16]P3(x162,x161)+~P1(x161)+~P1(x162)+P3(x161,x162)
% 2.62/2.71 [28]~P4(x283,x282,x281)+P3(a1,x281)+~P3(a1,x282)+~P3(a1,x283)
% 2.62/2.71 [31]~P2(x313,x315,x311)+P3(x311,x312)+~P2(x314,x315,x312)+~P3(x313,x314)
% 2.62/2.71 [32]~P2(x321,x326,x324)+P2(x321,x322,x323)+~P2(x324,x325,x323)+~P2(x326,x325,x322)
% 2.62/2.71 [33]~P2(x336,x334,x331)+P2(x331,x332,x333)+~P2(x334,x332,x335)+~P2(x336,x335,x333)
% 2.62/2.71 [34]~P4(x341,x346,x344)+P4(x341,x342,x343)+~P4(x344,x345,x343)+~P4(x346,x345,x342)
% 2.62/2.71 [35]~P4(x356,x354,x351)+P4(x351,x352,x353)+~P4(x354,x352,x355)+~P4(x356,x355,x353)
% 2.62/2.71 [36]~P4(x365,x367,x362)+~P4(x364,x367,x361)+P2(x361,x362,x363)+~P2(x364,x365,x366)+~P4(x366,x367,x363)
% 2.62/2.71 [37]~P4(x377,x372,x375)+~P4(x376,x372,x374)+P4(x371,x372,x373)+~P2(x374,x375,x373)+~P2(x376,x377,x371)
% 2.62/2.71 %EqnAxiom
% 2.62/2.71
% 2.62/2.71 %-------------------------------------------
% 2.62/2.71 cnf(40,plain,
% 2.62/2.71 (~P2(a5,a7,a12)),
% 2.62/2.71 inference(scs_inference,[],[9,11,14,29,32])).
% 2.62/2.71 cnf(51,plain,
% 2.62/2.71 (~P2(a7,a5,a12)),
% 2.62/2.71 inference(scs_inference,[],[40,29])).
% 2.62/2.71 cnf(189,plain,
% 2.62/2.71 (P2(f6(f6(a5)),f6(a5),a1)),
% 2.62/2.71 inference(scs_inference,[],[4,22,15])).
% 2.62/2.71 cnf(199,plain,
% 2.62/2.71 (P2(a1,a5,a5)+~P2(f6(a5),a1,f6(a5))),
% 2.62/2.71 inference(scs_inference,[],[9,189,33,32])).
% 2.62/2.71 cnf(800,plain,
% 2.62/2.72 (~P2(a1,f6(a5),f6(a5))+P2(a1,a5,a5)),
% 2.62/2.72 inference(scs_inference,[],[199,29])).
% 2.62/2.72 cnf(912,plain,
% 2.62/2.72 (~P1(f6(a5))+P2(a1,a5,a5)),
% 2.62/2.72 inference(scs_inference,[],[800,20])).
% 2.62/2.72 cnf(928,plain,
% 2.62/2.72 (P2(a1,a5,a5)),
% 2.62/2.72 inference(scs_inference,[],[4,912,15])).
% 2.62/2.72 cnf(931,plain,
% 2.62/2.72 ($false),
% 2.62/2.72 inference(scs_inference,[],[12,10,51,928,32,29]),
% 2.62/2.72 ['proof']).
% 2.62/2.72 % SZS output end Proof
% 2.62/2.72 % Total time :2.080000s
%------------------------------------------------------------------------------