%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : GRP161-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n019.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:04 EDT 2024
% Result : Unsatisfiable 0.55s 0.60s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP161-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 07:54:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.56 start to proof:theBenchmark
% 0.20/0.60 %-------------------------------------------
% 0.20/0.60 % File :CSE---1.7
% 0.20/0.60 % Problem :theBenchmark
% 0.20/0.60 % Transform :cnf
% 0.20/0.60 % Format :tptp:raw
% 0.20/0.60 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.60
% 0.20/0.60 % Result :Theorem 0.000000s
% 0.20/0.60 % Output :CNFRefutation 0.000000s
% 0.20/0.60 %-------------------------------------------
% 0.20/0.60 %--------------------------------------------------------------------------
% 0.20/0.60 % File : GRP161-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.20/0.60 % Domain : Group Theory (Lattice Ordered)
% 0.20/0.60 % Problem : Prove reflexivity axiom using the GLB transformation
% 0.20/0.60 % Version : [Fuc94] (equality) axioms.
% 0.20/0.60 % English : This problem proves the original reflexivity axiom from the
% 0.20/0.60 % equational axiomatization.
% 0.20/0.60
% 0.20/0.60 % Refs : [Fuc94] Fuchs (1994), The Application of Goal-Orientated Heuri
% 0.20/0.60 % : [Sch95] Schulz (1995), Explanation Based Learning for Distribu
% 0.20/0.60 % Source : [Sch95]
% 0.20/0.60 % Names : ax_reflb [Sch95]
% 0.20/0.60
% 0.20/0.60 % Status : Unsatisfiable
% 0.20/0.60 % Rating : 0.00 v7.4.0, 0.04 v7.3.0, 0.00 v7.0.0, 0.05 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
% 0.20/0.60 % Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 1 RR)
% 0.20/0.60 % Number of literals : 16 ( 16 equ; 1 neg)
% 0.20/0.60 % Maximal clause size : 1 ( 1 avg)
% 0.20/0.60 % Maximal term depth : 3 ( 2 avg)
% 0.20/0.60 % Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty)
% 0.20/0.60 % Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% 0.20/0.60 % Number of variables : 33 ( 2 sgn)
% 0.20/0.60 % SPC : CNF_UNS_RFO_PEQ_UEQ
% 0.20/0.60
% 0.20/0.60 % Comments : ORDERING LPO inverse > product > greatest_lower_bound >
% 0.20/0.60 % least_upper_bound > identity > a
% 0.20/0.60 % Bugfixes : v1.2.1 - Duplicate axioms in GRP004-2.ax removed.
% 0.20/0.60 %--------------------------------------------------------------------------
% 0.20/0.60 %----Include equality group theory axioms
% 0.20/0.60 include('Axioms/GRP004-0.ax').
% 0.20/0.60 %----Include Lattice ordered group (equality) axioms
% 0.20/0.60 include('Axioms/GRP004-2.ax').
% 0.20/0.60 %--------------------------------------------------------------------------
% 0.20/0.60 cnf(prove_ax_reflb,negated_conjecture,
% 0.20/0.60 greatest_lower_bound(a,a) != a ).
% 0.20/0.60
% 0.20/0.60 %--------------------------------------------------------------------------
% 0.55/0.60 %-------------------------------------------
% 0.55/0.60 % Proof found
% 0.55/0.60 % SZS status Theorem for theBenchmark
% 0.55/0.60 % SZS output start Proof
% 0.55/0.60 %ClaNum:26(EqnAxiom:10)
% 0.55/0.60 %VarNum:72(SingletonVarNum:33)
% 0.55/0.60 %MaxLitNum:1
% 0.55/0.60 %MaxfuncDepth:2
% 0.55/0.60 %SharedTerms:4
% 0.55/0.60 %goalClause: 26
% 0.55/0.60 %singleGoalClaCount:1
% 0.55/0.60 [26]~E(f2(a3,a3),a3)
% 0.55/0.60 [11]E(f4(a1,x111),x111)
% 0.55/0.60 [12]E(f2(x121,x121),x121)
% 0.55/0.60 [13]E(f5(x131,x131),x131)
% 0.55/0.60 [14]E(f4(f6(x141),x141),a1)
% 0.55/0.60 [15]E(f2(x151,x152),f2(x152,x151))
% 0.55/0.60 [16]E(f5(x161,x162),f5(x162,x161))
% 0.55/0.60 [17]E(f2(x171,f5(x171,x172)),x171)
% 0.55/0.60 [18]E(f5(x181,f2(x181,x182)),x181)
% 0.55/0.60 [19]E(f2(f2(x191,x192),x193),f2(x191,f2(x192,x193)))
% 0.55/0.60 [20]E(f5(f5(x201,x202),x203),f5(x201,f5(x202,x203)))
% 0.55/0.60 [21]E(f4(f4(x211,x212),x213),f4(x211,f4(x212,x213)))
% 0.55/0.60 [22]E(f2(f4(x221,x222),f4(x221,x223)),f4(x221,f2(x222,x223)))
% 0.55/0.60 [23]E(f5(f4(x231,x232),f4(x231,x233)),f4(x231,f5(x232,x233)))
% 0.55/0.60 [24]E(f2(f4(x241,x242),f4(x243,x242)),f4(f2(x241,x243),x242))
% 0.55/0.60 [25]E(f5(f4(x251,x252),f4(x253,x252)),f4(f5(x251,x253),x252))
% 0.55/0.60 %EqnAxiom
% 0.55/0.60 [1]E(x11,x11)
% 0.55/0.60 [2]E(x22,x21)+~E(x21,x22)
% 0.55/0.60 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.55/0.60 [4]~E(x41,x42)+E(f4(x41,x43),f4(x42,x43))
% 0.55/0.60 [5]~E(x51,x52)+E(f4(x53,x51),f4(x53,x52))
% 0.55/0.60 [6]~E(x61,x62)+E(f2(x61,x63),f2(x62,x63))
% 0.55/0.60 [7]~E(x71,x72)+E(f2(x73,x71),f2(x73,x72))
% 0.55/0.60 [8]~E(x81,x82)+E(f5(x81,x83),f5(x82,x83))
% 0.55/0.60 [9]~E(x91,x92)+E(f5(x93,x91),f5(x93,x92))
% 0.55/0.60 [10]~E(x101,x102)+E(f6(x101),f6(x102))
% 0.55/0.60
% 0.55/0.61 %-------------------------------------------
% 0.55/0.61 cnf(27,plain,
% 0.55/0.61 ($false),
% 0.55/0.61 inference(scs_inference,[],[26,12]),
% 0.55/0.61 ['proof']).
% 0.55/0.61 % SZS output end Proof
% 0.55/0.61 % Total time :0.000000s
%------------------------------------------------------------------------------