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