%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : GRP182-2 : 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 : n020.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:10 EDT 2024
% Result : Unsatisfiable 0.52s 0.90s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP182-2 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.06/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.10/0.32 % Computer : n020.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Thu Jun 20 12:23:09 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.45/0.56 start to proof:theBenchmark
% 0.52/0.89 %-------------------------------------------
% 0.52/0.89 % File :CSE---1.7
% 0.52/0.89 % Problem :theBenchmark
% 0.52/0.89 % Transform :cnf
% 0.52/0.89 % Format :tptp:raw
% 0.52/0.89 % Command :java -jar mcs_scs.jar %d %s
% 0.52/0.89
% 0.52/0.89 % Result :Theorem 0.300000s
% 0.52/0.89 % Output :CNFRefutation 0.300000s
% 0.52/0.89 %-------------------------------------------
% 0.52/0.90 %--------------------------------------------------------------------------
% 0.52/0.90 % File : GRP182-2 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.52/0.90 % Domain : Group Theory (Lattice Ordered)
% 0.52/0.90 % Problem : Positive part of the negative part is identity
% 0.52/0.90 % Version : [Fuc94] (equality) axioms : Augmented.
% 0.52/0.90 % English :
% 0.52/0.90
% 0.52/0.90 % Refs : [Fuc94] Fuchs (1994), The Application of Goal-Orientated Heuri
% 0.52/0.90 % : [Sch95] Schulz (1995), Explanation Based Learning for Distribu
% 0.52/0.90 % : [Dah95] Dahn (1995), Email to G. Sutcliffe
% 0.52/0.90 % Source : [Sch95]
% 0.52/0.90 % Names : p17a [Sch95]
% 0.52/0.90
% 0.52/0.90 % Status : Unsatisfiable
% 0.52/0.90 % 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 v2.0.0
% 0.52/0.90 % Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 2 RR)
% 0.52/0.90 % Number of literals : 19 ( 19 equ; 1 neg)
% 0.52/0.90 % Maximal clause size : 1 ( 1 avg)
% 0.52/0.90 % Maximal term depth : 3 ( 2 avg)
% 0.52/0.90 % Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty)
% 0.52/0.90 % Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% 0.52/0.90 % Number of variables : 36 ( 2 sgn)
% 0.52/0.90 % SPC : CNF_UNS_RFO_PEQ_UEQ
% 0.52/0.90
% 0.52/0.90 % Comments : ORDERING LPO inverse > product > greatest_lower_bound >
% 0.52/0.90 % least_upper_bound > identity > a
% 0.52/0.90 % : ORDERING LPO greatest_lower_bound > least_upper_bound >
% 0.52/0.90 % inverse > product > identity > a
% 0.52/0.90 % : The theorem clause has been modified according to instructions
% 0.52/0.90 % in [Dah95].
% 0.52/0.90 % Bugfixes : v1.2.1 - Duplicate axioms in GRP004-2.ax removed.
% 0.52/0.90 %--------------------------------------------------------------------------
% 0.52/0.90 %----Include equality group theory axioms
% 0.52/0.90 include('Axioms/GRP004-0.ax').
% 0.52/0.90 %----Include Lattice ordered group (equality) axioms
% 0.52/0.90 include('Axioms/GRP004-2.ax').
% 0.52/0.90 %--------------------------------------------------------------------------
% 0.52/0.90 cnf(p17a_1,hypothesis,
% 0.52/0.90 inverse(identity) = identity ).
% 0.52/0.90
% 0.52/0.90 cnf(p17a_2,hypothesis,
% 0.52/0.90 inverse(inverse(X)) = X ).
% 0.52/0.90
% 0.52/0.90 cnf(p17a_3,hypothesis,
% 0.52/0.90 inverse(multiply(X,Y)) = multiply(inverse(Y),inverse(X)) ).
% 0.52/0.90
% 0.52/0.90 %----This is Schulz's clause
% 0.52/0.90 %input_clause(prove_p17a,negated_conjecture,
% 0.52/0.90 % [--equal(least_upper_bound(identity,least_upper_bound(a,identity)),
% 0.52/0.90 %least_upper_bound(a,identity))]).
% 0.52/0.90 %----This is Dahn's clause
% 0.52/0.90 cnf(prove_p17a,negated_conjecture,
% 0.52/0.90 least_upper_bound(identity,greatest_lower_bound(a,identity)) != identity ).
% 0.52/0.90
% 0.52/0.90 %--------------------------------------------------------------------------
% 0.52/0.90 %-------------------------------------------
% 0.52/0.90 % Proof found
% 0.52/0.90 % SZS status Theorem for theBenchmark
% 0.52/0.90 % SZS output start Proof
% 0.52/0.90 %ClaNum:29(EqnAxiom:10)
% 0.52/0.90 %VarNum:78(SingletonVarNum:36)
% 0.52/0.90 %MaxLitNum:1
% 0.52/0.90 %MaxfuncDepth:2
% 0.52/0.90 %SharedTerms:7
% 0.52/0.90 %goalClause: 29
% 0.52/0.90 %singleGoalClaCount:1
% 0.52/0.90 [11]E(f4(a1),a1)
% 0.52/0.90 [29]~E(f6(a1,f2(a3,a1)),a1)
% 0.52/0.90 [13]E(f5(a1,x131),x131)
% 0.52/0.90 [14]E(f2(x141,x141),x141)
% 0.52/0.90 [15]E(f6(x151,x151),x151)
% 0.52/0.90 [12]E(f4(f4(x121)),x121)
% 0.52/0.90 [16]E(f5(f4(x161),x161),a1)
% 0.52/0.90 [17]E(f2(x171,x172),f2(x172,x171))
% 0.52/0.90 [18]E(f6(x181,x182),f6(x182,x181))
% 0.52/0.90 [19]E(f2(x191,f6(x191,x192)),x191)
% 0.52/0.90 [20]E(f6(x201,f2(x201,x202)),x201)
% 0.52/0.90 [21]E(f4(f5(x211,x212)),f5(f4(x212),f4(x211)))
% 0.52/0.90 [22]E(f2(f2(x221,x222),x223),f2(x221,f2(x222,x223)))
% 0.52/0.90 [23]E(f6(f6(x231,x232),x233),f6(x231,f6(x232,x233)))
% 0.52/0.90 [24]E(f5(f5(x241,x242),x243),f5(x241,f5(x242,x243)))
% 0.52/0.90 [25]E(f2(f5(x251,x252),f5(x251,x253)),f5(x251,f2(x252,x253)))
% 0.52/0.90 [26]E(f6(f5(x261,x262),f5(x261,x263)),f5(x261,f6(x262,x263)))
% 0.52/0.90 [27]E(f2(f5(x271,x272),f5(x273,x272)),f5(f2(x271,x273),x272))
% 0.52/0.90 [28]E(f6(f5(x281,x282),f5(x283,x282)),f5(f6(x281,x283),x282))
% 0.52/0.90 %EqnAxiom
% 0.52/0.90 [1]E(x11,x11)
% 0.52/0.90 [2]E(x22,x21)+~E(x21,x22)
% 0.52/0.90 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.52/0.90 [4]~E(x41,x42)+E(f4(x41),f4(x42))
% 0.52/0.90 [5]~E(x51,x52)+E(f6(x51,x53),f6(x52,x53))
% 0.52/0.90 [6]~E(x61,x62)+E(f6(x63,x61),f6(x63,x62))
% 0.52/0.90 [7]~E(x71,x72)+E(f2(x71,x73),f2(x72,x73))
% 0.52/0.90 [8]~E(x81,x82)+E(f2(x83,x81),f2(x83,x82))
% 0.52/0.90 [9]~E(x91,x92)+E(f5(x91,x93),f5(x92,x93))
% 0.52/0.90 [10]~E(x101,x102)+E(f5(x103,x101),f5(x103,x102))
% 0.52/0.90
% 0.52/0.90 %-------------------------------------------
% 0.52/0.91 cnf(125,plain,
% 0.52/0.91 (E(a1,f4(a1))),
% 0.52/0.91 inference(scs_inference,[],[11,2])).
% 0.52/0.91 cnf(128,plain,
% 0.52/0.91 (E(a1,f5(f4(x1281),x1281))),
% 0.52/0.91 inference(scs_inference,[],[16,2])).
% 0.52/0.91 cnf(129,plain,
% 0.52/0.91 (E(f5(f4(x1291),x1291),f4(a1))),
% 0.52/0.91 inference(scs_inference,[],[125,16,2,3])).
% 0.52/0.91 cnf(137,plain,
% 0.52/0.91 (~E(f6(a1,f2(a3,a1)),f4(a1))),
% 0.52/0.91 inference(scs_inference,[],[29,11,3])).
% 0.52/0.91 cnf(144,plain,
% 0.52/0.91 (E(f6(a1,f2(a1,x1441)),f5(f4(x1442),x1442))),
% 0.52/0.91 inference(scs_inference,[],[128,20,3])).
% 0.52/0.91 cnf(147,plain,
% 0.52/0.91 (~E(f6(a1,f2(a3,a1)),f5(f4(x1471),x1471))),
% 0.52/0.91 inference(scs_inference,[],[129,137,3])).
% 0.52/0.91 cnf(154,plain,
% 0.52/0.91 ($false),
% 0.52/0.91 inference(scs_inference,[],[144,17,147,3,6]),
% 0.52/0.91 ['proof']).
% 0.52/0.91 % SZS output end Proof
% 0.52/0.91 % Total time :0.300000s
%------------------------------------------------------------------------------