%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : GRP150-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/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 06:39:02 EDT 2024
% Result : Unsatisfiable 5.95s 6.15s
% Output : CNFRefutation 5.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP150-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.11/0.33 % Computer : n023.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu Jun 20 11:56:39 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.51/0.56 start to proof:theBenchmark
% 5.85/6.15 %-------------------------------------------
% 5.85/6.15 % File :CSE---1.7
% 5.85/6.15 % Problem :theBenchmark
% 5.85/6.15 % Transform :cnf
% 5.85/6.15 % Format :tptp:raw
% 5.85/6.15 % Command :java -jar mcs_scs.jar %d %s
% 5.85/6.15
% 5.85/6.15 % Result :Theorem 5.400000s
% 5.85/6.15 % Output :CNFRefutation 5.400000s
% 5.85/6.15 %-------------------------------------------
% 5.95/6.15 %--------------------------------------------------------------------------
% 5.95/6.15 % File : GRP150-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% 5.95/6.15 % Domain : Group Theory (Lattice Ordered)
% 5.95/6.15 % Problem : Prove least upper-bound axiom using the LUB transformation
% 5.95/6.15 % Version : [Fuc94] (equality) axioms.
% 5.95/6.15 % English : This problem proves the original least upper-bound axiom from
% 5.95/6.15 % the equational axiomatization.
% 5.95/6.15
% 5.95/6.15 % Refs : [Fuc94] Fuchs (1994), The Application of Goal-Orientated Heuri
% 5.95/6.15 % : [Sch95] Schulz (1995), Explanation Based Learning for Distribu
% 5.95/6.15 % Source : [Sch95]
% 5.95/6.15 % Names : ax_lub2a [Sch95]
% 5.95/6.15
% 5.95/6.15 % Status : Unsatisfiable
% 5.95/6.15 % Rating : 0.00 v7.4.0, 0.04 v7.3.0, 0.00 v7.0.0, 0.05 v6.4.0, 0.11 v6.3.0, 0.12 v6.2.0, 0.14 v6.1.0, 0.06 v6.0.0, 0.10 v5.5.0, 0.05 v5.4.0, 0.00 v5.1.0, 0.07 v4.1.0, 0.09 v4.0.1, 0.07 v4.0.0, 0.08 v3.7.0, 0.00 v2.0.0
% 5.95/6.15 % Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 1 RR)
% 5.95/6.15 % Number of literals : 16 ( 16 equ; 1 neg)
% 5.95/6.15 % Maximal clause size : 1 ( 1 avg)
% 5.95/6.15 % Maximal term depth : 3 ( 2 avg)
% 5.95/6.15 % Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty)
% 5.95/6.15 % Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% 5.95/6.15 % Number of variables : 33 ( 2 sgn)
% 5.95/6.15 % SPC : CNF_UNS_RFO_PEQ_UEQ
% 5.95/6.15
% 5.95/6.15 % Comments : ORDERING LPO inverse > product > greatest_lower_bound >
% 5.95/6.15 % least_upper_bound > identity > a > b
% 5.95/6.15 % Bugfixes : v1.2.1 - Duplicate axioms in GRP004-2.ax removed.
% 5.95/6.15 %--------------------------------------------------------------------------
% 5.95/6.15 %----Include equality group theory axioms
% 5.95/6.15 include('Axioms/GRP004-0.ax').
% 5.95/6.15 %----Include Lattice ordered group (equality) axioms
% 5.95/6.15 include('Axioms/GRP004-2.ax').
% 5.95/6.15 %--------------------------------------------------------------------------
% 5.95/6.15 cnf(prove_ax_lub2a,negated_conjecture,
% 5.95/6.15 least_upper_bound(a,least_upper_bound(a,b)) != least_upper_bound(a,b) ).
% 5.95/6.15
% 5.95/6.15 %--------------------------------------------------------------------------
% 5.95/6.15 %-------------------------------------------
% 5.95/6.15 % Proof found
% 5.95/6.15 % SZS status Theorem for theBenchmark
% 5.95/6.16 % SZS output start Proof
% 5.95/6.16 %ClaNum:26(EqnAxiom:10)
% 5.95/6.16 %VarNum:72(SingletonVarNum:33)
% 5.95/6.16 %MaxLitNum:1
% 5.95/6.16 %MaxfuncDepth:2
% 5.95/6.16 %SharedTerms:6
% 5.95/6.16 %goalClause: 26
% 5.95/6.16 %singleGoalClaCount:1
% 5.95/6.16 [26]~E(f6(a3,f6(a3,a4)),f6(a3,a4))
% 5.95/6.16 [11]E(f5(a1,x111),x111)
% 5.95/6.16 [12]E(f2(x121,x121),x121)
% 5.95/6.16 [13]E(f6(x131,x131),x131)
% 5.95/6.16 [14]E(f5(f7(x141),x141),a1)
% 5.95/6.16 [15]E(f2(x151,x152),f2(x152,x151))
% 5.95/6.16 [16]E(f6(x161,x162),f6(x162,x161))
% 5.95/6.16 [17]E(f2(x171,f6(x171,x172)),x171)
% 5.95/6.16 [18]E(f6(x181,f2(x181,x182)),x181)
% 5.95/6.16 [19]E(f2(f2(x191,x192),x193),f2(x191,f2(x192,x193)))
% 5.95/6.16 [20]E(f6(f6(x201,x202),x203),f6(x201,f6(x202,x203)))
% 5.95/6.16 [21]E(f5(f5(x211,x212),x213),f5(x211,f5(x212,x213)))
% 5.95/6.16 [22]E(f2(f5(x221,x222),f5(x221,x223)),f5(x221,f2(x222,x223)))
% 5.95/6.16 [23]E(f6(f5(x231,x232),f5(x231,x233)),f5(x231,f6(x232,x233)))
% 5.95/6.16 [24]E(f2(f5(x241,x242),f5(x243,x242)),f5(f2(x241,x243),x242))
% 5.95/6.16 [25]E(f6(f5(x251,x252),f5(x253,x252)),f5(f6(x251,x253),x252))
% 5.95/6.16 %EqnAxiom
% 5.95/6.16 [1]E(x11,x11)
% 5.95/6.16 [2]E(x22,x21)+~E(x21,x22)
% 5.95/6.16 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 5.95/6.16 [4]~E(x41,x42)+E(f5(x41,x43),f5(x42,x43))
% 5.95/6.16 [5]~E(x51,x52)+E(f5(x53,x51),f5(x53,x52))
% 5.95/6.16 [6]~E(x61,x62)+E(f2(x61,x63),f2(x62,x63))
% 5.95/6.16 [7]~E(x71,x72)+E(f2(x73,x71),f2(x73,x72))
% 5.95/6.16 [8]~E(x81,x82)+E(f6(x81,x83),f6(x82,x83))
% 5.95/6.16 [9]~E(x91,x92)+E(f6(x93,x91),f6(x93,x92))
% 5.95/6.16 [10]~E(x101,x102)+E(f7(x101),f7(x102))
% 5.95/6.16
% 5.95/6.16 %-------------------------------------------
% 5.95/6.16 cnf(27,plain,
% 5.95/6.16 (E(x271,f2(x271,x271))),
% 5.95/6.16 inference(scs_inference,[],[12,2])).
% 5.95/6.16 cnf(29,plain,
% 5.95/6.16 (~E(f6(a3,f6(a3,a4)),f2(f6(a3,a4),f6(a3,a4)))),
% 5.95/6.16 inference(scs_inference,[],[26,12,2,9,3])).
% 5.95/6.16 cnf(70,plain,
% 5.95/6.16 (E(x701,f2(x701,f6(x701,x702)))),
% 5.95/6.16 inference(scs_inference,[],[17,2])).
% 5.95/6.16 cnf(71,plain,
% 5.95/6.16 (E(x711,f6(x711,f2(x711,x712)))),
% 5.95/6.16 inference(scs_inference,[],[18,2])).
% 5.95/6.16 cnf(119,plain,
% 5.95/6.16 (E(f2(x1191,x1191),f6(x1191,f2(x1191,x1192)))),
% 5.95/6.16 inference(scs_inference,[],[12,71,3])).
% 5.95/6.16 cnf(130,plain,
% 5.95/6.16 (E(f6(x1301,f2(x1301,x1302)),f2(f2(x1301,x1301),f2(x1301,x1301)))),
% 5.95/6.16 inference(scs_inference,[],[12,119,3,2])).
% 5.95/6.16 cnf(379,plain,
% 5.95/6.16 (E(f2(x3791,f2(x3792,x3793)),f2(x3793,f2(x3791,x3792)))),
% 5.95/6.16 inference(scs_inference,[],[15,19,3,2])).
% 5.95/6.16 cnf(404,plain,
% 5.95/6.16 (E(f2(f2(x4041,x4041),f2(x4041,x4041)),f6(f2(x4041,x4042),x4041))),
% 5.95/6.16 inference(scs_inference,[],[16,130,3,2])).
% 5.95/6.16 cnf(538,plain,
% 5.95/6.16 (E(f6(f2(x5381,x5382),x5381),f2(x5381,x5381))),
% 5.95/6.16 inference(scs_inference,[],[27,404,3,2])).
% 5.95/6.16 cnf(541,plain,
% 5.95/6.16 (~E(a3,f2(f6(a3,a4),x5411))),
% 5.95/6.16 inference(scs_inference,[],[538,29,3,8])).
% 5.95/6.16 cnf(542,plain,
% 5.95/6.16 (~E(a3,f2(x5421,f2(x5422,f6(a3,a4))))),
% 5.95/6.16 inference(scs_inference,[],[379,541,3])).
% 5.95/6.16 cnf(545,plain,
% 5.95/6.16 ($false),
% 5.95/6.16 inference(scs_inference,[],[27,70,542,3]),
% 5.95/6.16 ['proof']).
% 5.95/6.16 % SZS output end Proof
% 5.95/6.16 % Total time :5.400000s
%------------------------------------------------------------------------------