%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : FLD059-4 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n014.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:31 EDT 2024
% Result : Unsatisfiable 11.48s 11.54s
% Output : CNFRefutation 11.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : FLD059-4 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.04/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jun 19 11:29:54 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.46/0.61 start to proof:theBenchmark
% 11.40/11.53 %-------------------------------------------
% 11.40/11.53 % File :CSE---1.7
% 11.40/11.53 % Problem :theBenchmark
% 11.40/11.53 % Transform :cnf
% 11.40/11.53 % Format :tptp:raw
% 11.40/11.53 % Command :java -jar mcs_scs.jar %d %s
% 11.40/11.53
% 11.40/11.53 % Result :Theorem 10.880000s
% 11.40/11.53 % Output :CNFRefutation 10.880000s
% 11.40/11.53 %-------------------------------------------
% 11.48/11.53 %--------------------------------------------------------------------------
% 11.48/11.53 % File : FLD059-4 : TPTP v8.2.0. Bugfixed v2.1.0.
% 11.48/11.53 % Domain : Field Theory (Ordered fields)
% 11.48/11.53 % Problem : If a greater or equal 0, then 2a greater or equal 0
% 11.48/11.53 % Version : [Dra93] axioms : Especial.
% 11.48/11.53 % Theorem formulation : Relational with re axiom set.
% 11.48/11.53 % English :
% 11.48/11.53
% 11.48/11.53 % Refs : [Dra93] Draeger (1993), Anwendung des Theorembeweisers SETHEO
% 11.48/11.53 % Source : [Dra93]
% 11.48/11.53 % Names :
% 11.48/11.53
% 11.48/11.53 % Status : Unsatisfiable
% 11.48/11.53 % Rating : 0.00 v6.4.0, 0.12 v6.3.0, 0.00 v5.5.0, 0.12 v5.4.0, 0.10 v5.2.0, 0.00 v5.0.0, 0.07 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.1.0
% 11.48/11.53 % Syntax : Number of clauses : 31 ( 8 unt; 3 nHn; 31 RR)
% 11.48/11.53 % Number of literals : 82 ( 0 equ; 50 neg)
% 11.48/11.53 % Maximal clause size : 5 ( 2 avg)
% 11.48/11.53 % Maximal term depth : 2 ( 1 avg)
% 11.48/11.53 % Number of predicates : 4 ( 4 usr; 0 prp; 1-3 aty)
% 11.48/11.53 % Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% 11.48/11.53 % Number of variables : 73 ( 0 sgn)
% 11.48/11.53 % SPC : CNF_UNS_RFO_NEQ_NHN
% 11.48/11.53
% 11.48/11.53 % Comments :
% 11.48/11.53 % Bugfixes : v2.1.0 - Bugfix in FLD002-0.ax
% 11.48/11.53 %--------------------------------------------------------------------------
% 11.48/11.53 include('Axioms/FLD002-0.ax').
% 11.48/11.53 %--------------------------------------------------------------------------
% 11.48/11.53 cnf(a_is_defined,hypothesis,
% 11.48/11.53 defined(a) ).
% 11.48/11.53
% 11.48/11.53 cnf(u_is_defined,hypothesis,
% 11.48/11.53 defined(u) ).
% 11.48/11.53
% 11.48/11.53 cnf(less_or_equal_3,negated_conjecture,
% 11.48/11.53 less_or_equal(additive_identity,a) ).
% 11.48/11.53
% 11.48/11.53 cnf(sum_4,negated_conjecture,
% 11.48/11.54 sum(a,a,u) ).
% 11.48/11.54
% 11.48/11.54 cnf(not_less_or_equal_5,negated_conjecture,
% 11.48/11.54 ~ less_or_equal(additive_identity,u) ).
% 11.48/11.54
% 11.48/11.54 %--------------------------------------------------------------------------
% 11.48/11.54 %-------------------------------------------
% 11.48/11.54 % Proof found
% 11.48/11.54 % SZS status Theorem for theBenchmark
% 11.48/11.54 % SZS output start Proof
% 11.48/11.54 %ClaNum:31(EqnAxiom:0)
% 11.48/11.54 %VarNum:162(SingletonVarNum:73)
% 11.48/11.54 %MaxLitNum:5
% 11.48/11.54 %MaxfuncDepth:1
% 11.48/11.54 %SharedTerms:12
% 11.48/11.54 %goalClause: 5 6 7
% 11.48/11.54 %singleGoalClaCount:3
% 11.48/11.54 [1]P1(a1)
% 11.48/11.54 [2]P1(a4)
% 11.48/11.54 [3]P1(a2)
% 11.48/11.54 [4]P1(a6)
% 11.48/11.54 [5]P2(a1,a2)
% 11.48/11.54 [6]P3(a2,a2,a6)
% 11.48/11.54 [7]~P2(a1,a6)
% 11.48/11.54 [8]~P3(a1,a1,a4)
% 11.48/11.54 [14]~P1(x141)+P3(a1,x141,x141)
% 11.48/11.54 [15]~P1(x151)+P4(a4,x151,x151)
% 11.48/11.54 [9]~P1(x91)+P1(f5(x91))
% 11.48/11.54 [16]~P1(x161)+P3(f5(x161),x161,a1)
% 11.48/11.54 [23]~P3(x232,x231,x233)+P3(x231,x232,x233)
% 11.48/11.54 [24]~P4(x242,x241,x243)+P4(x241,x242,x243)
% 11.48/11.54 [17]~P1(x171)+P3(a1,x171,a1)+P1(f8(x171))
% 11.48/11.54 [21]~P1(x211)+P4(f8(x211),x211,a4)+P3(a1,x211,a1)
% 11.48/11.54 [20]~P2(x202,x201)+~P2(x201,x202)+P3(a1,x201,x202)
% 11.48/11.54 [11]~P1(x112)+~P1(x111)+P1(f3(x111,x112))
% 11.48/11.54 [12]~P1(x122)+~P1(x121)+P1(f7(x121,x122))
% 11.48/11.54 [18]~P1(x182)+~P1(x181)+P3(x181,x182,f3(x181,x182))
% 11.48/11.54 [19]~P1(x192)+~P1(x191)+P4(x191,x192,f7(x191,x192))
% 11.48/11.54 [13]~P2(x131,x133)+P2(x131,x132)+~P2(x133,x132)
% 11.48/11.54 [10]P2(x102,x101)+~P1(x101)+~P1(x102)+P2(x101,x102)
% 11.48/11.54 [22]~P4(x223,x222,x221)+P2(a1,x221)+~P2(a1,x222)+~P2(a1,x223)
% 11.48/11.54 [25]~P3(x253,x255,x251)+P2(x251,x252)+~P3(x254,x255,x252)+~P2(x253,x254)
% 11.48/11.54 [26]~P3(x261,x266,x264)+P3(x261,x262,x263)+~P3(x264,x265,x263)+~P3(x266,x265,x262)
% 11.48/11.54 [27]~P3(x276,x274,x271)+P3(x271,x272,x273)+~P3(x274,x272,x275)+~P3(x276,x275,x273)
% 11.48/11.54 [28]~P4(x281,x286,x284)+P4(x281,x282,x283)+~P4(x284,x285,x283)+~P4(x286,x285,x282)
% 11.48/11.54 [29]~P4(x296,x294,x291)+P4(x291,x292,x293)+~P4(x294,x292,x295)+~P4(x296,x295,x293)
% 11.48/11.54 [30]~P4(x305,x307,x302)+~P4(x304,x307,x301)+P3(x301,x302,x303)+~P3(x304,x305,x306)+~P4(x306,x307,x303)
% 11.48/11.54 [31]~P4(x317,x312,x315)+~P4(x316,x312,x314)+P4(x311,x312,x313)+~P3(x314,x315,x313)+~P3(x316,x317,x311)
% 11.48/11.54 %EqnAxiom
% 11.48/11.54
% 11.48/11.54 %-------------------------------------------
% 11.48/11.54 cnf(36,plain,
% 11.48/11.54 (~P3(a1,a2,a1)),
% 11.48/11.54 inference(scs_inference,[],[5,6,7,1,10,22,25])).
% 11.48/11.54 cnf(46,plain,
% 11.48/11.54 (~P2(a2,a1)),
% 11.48/11.54 inference(scs_inference,[],[5,36,20])).
% 11.48/11.54 cnf(70,plain,
% 11.48/11.54 (P2(a6,a1)),
% 11.48/11.54 inference(scs_inference,[],[1,7,4,10])).
% 11.48/11.54 cnf(1156,plain,
% 11.48/11.54 (~P3(a6,x11561,a2)+~P3(a1,x11561,a1)),
% 11.48/11.54 inference(scs_inference,[],[46,70,25])).
% 11.48/11.54 cnf(1298,plain,
% 11.48/11.54 (~P3(a6,a1,a2)),
% 11.48/11.54 inference(scs_inference,[],[1,1156,14])).
% 11.48/11.54 cnf(1299,plain,
% 11.48/11.54 (~P3(a1,a6,a2)),
% 11.48/11.54 inference(scs_inference,[],[1298,23])).
% 11.48/11.54 cnf(1775,plain,
% 11.48/11.54 (~P2(a2,a6)),
% 11.48/11.54 inference(scs_inference,[],[70,5,1299,13,20])).
% 11.48/11.54 cnf(3676,plain,
% 11.48/11.54 ($false),
% 11.48/11.54 inference(scs_inference,[],[6,5,1775,3,25,14]),
% 11.48/11.54 ['proof']).
% 11.48/11.54 % SZS output end Proof
% 11.48/11.54 % Total time :10.880000s
%------------------------------------------------------------------------------