TSTP Solution File: LAT035-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LAT035-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n001.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 : Thu Aug 31 05:57:14 EDT 2023
% Result : Unsatisfiable 0.20s 0.67s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT035-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.12/0.34 % Computer : n001.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 24 08:13:26 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.56 start to proof:theBenchmark
% 0.20/0.67 %-------------------------------------------
% 0.20/0.67 % File :CSE---1.6
% 0.20/0.67 % Problem :theBenchmark
% 0.20/0.67 % Transform :cnf
% 0.20/0.67 % Format :tptp:raw
% 0.20/0.67 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.67
% 0.20/0.67 % Result :Theorem 0.060000s
% 0.20/0.67 % Output :CNFRefutation 0.060000s
% 0.20/0.67 %-------------------------------------------
% 0.20/0.67 %--------------------------------------------------------------------------
% 0.20/0.67 % File : LAT035-1 : TPTP v8.1.2. Released v2.4.0.
% 0.20/0.67 % Domain : Lattice Theory
% 0.20/0.67 % Problem : Composition to form a join hemimorphism
% 0.20/0.67 % Version : [McC88] (equality) axioms.
% 0.20/0.67 % English : In a lattice with 0,1, the composition of a unary join
% 0.20/0.67 % antihemimorphism and a lattice antimorphism is a join
% 0.20/0.67 % hemimorphism.
% 0.20/0.67
% 0.20/0.67 % Refs : [DeN00] DeNivelle (2000), Email to G. Sutcliffe
% 0.20/0.67 % [McC88] McCune (1988), Challenge Equality Problems in Lattice
% 0.20/0.67 % Source : [DeN00]
% 0.20/0.67 % Names : lattice-antihemi [DeN00]
% 0.20/0.67
% 0.20/0.67 % Status : Unsatisfiable
% 0.20/0.67 % Rating : 0.00 v6.2.0, 0.10 v6.1.0, 0.09 v6.0.0, 0.00 v5.5.0, 0.12 v5.4.0, 0.00 v5.3.0, 0.20 v5.2.0, 0.00 v5.1.0, 0.11 v5.0.0, 0.10 v4.1.0, 0.11 v4.0.1, 0.12 v4.0.0, 0.14 v3.7.0, 0.00 v2.4.0
% 0.20/0.67 % Syntax : Number of clauses : 20 ( 18 unt; 0 nHn; 4 RR)
% 0.20/0.67 % Number of literals : 22 ( 22 equ; 3 neg)
% 0.20/0.67 % Maximal clause size : 2 ( 1 avg)
% 0.20/0.67 % Maximal term depth : 4 ( 2 avg)
% 0.20/0.67 % Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty)
% 0.20/0.67 % Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% 0.20/0.67 % Number of variables : 29 ( 4 sgn)
% 0.20/0.67 % SPC : CNF_UNS_RFO_PEQ_NUE
% 0.20/0.67
% 0.20/0.67 % Comments :
% 0.20/0.67 %--------------------------------------------------------------------------
% 0.20/0.67 %----Include lattice theory axioms
% 0.20/0.67 include('Axioms/LAT001-0.ax').
% 0.20/0.67 %--------------------------------------------------------------------------
% 0.20/0.67 cnf(x_meet_0,axiom,
% 0.20/0.67 meet(X,n0) = n0 ).
% 0.20/0.67
% 0.20/0.67 cnf(x_join_0,axiom,
% 0.20/0.67 join(X,n0) = X ).
% 0.20/0.67
% 0.20/0.67 cnf(x_meet_1,axiom,
% 0.20/0.67 meet(X,n1) = X ).
% 0.20/0.67
% 0.20/0.67 cnf(x_join_1,axiom,
% 0.20/0.67 join(X,n1) = n1 ).
% 0.20/0.67
% 0.20/0.67 cnf(modular,axiom,
% 0.20/0.67 ( meet(X,Z) != X
% 0.20/0.67 | meet(Z,join(X,Y)) = join(X,meet(Y,Z)) ) ).
% 0.20/0.67
% 0.20/0.67 cnf(k_on_join,axiom,
% 0.20/0.67 k(join(U,V)) = meet(k(U),k(V)) ).
% 0.20/0.67
% 0.20/0.67 cnf(k_on_meet,axiom,
% 0.20/0.67 k(meet(U,V)) = join(k(U),k(V)) ).
% 0.20/0.67
% 0.20/0.67 cnf(k_on_bottom,axiom,
% 0.20/0.67 k(n0) = n1 ).
% 0.20/0.67
% 0.20/0.67 cnf(k_on_top,axiom,
% 0.20/0.67 k(n1) = n0 ).
% 0.20/0.67
% 0.20/0.67 cnf(f_on_meet,axiom,
% 0.20/0.67 f(meet(U,V)) = join(f(U),f(V)) ).
% 0.20/0.67
% 0.20/0.67 cnf(f_on_top,axiom,
% 0.20/0.67 f(n1) = n0 ).
% 0.20/0.67
% 0.20/0.67 cnf(comp_join_hemimorphism,negated_conjecture,
% 0.20/0.67 ( f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb)))
% 0.20/0.67 | f(k(n0)) != n0 ) ).
% 0.20/0.67
% 0.20/0.67 %--------------------------------------------------------------------------
% 0.20/0.67 %-------------------------------------------
% 0.20/0.67 % Proof found
% 0.20/0.67 % SZS status Theorem for theBenchmark
% 0.20/0.67 % SZS output start Proof
% 0.20/0.67 %ClaNum:29(EqnAxiom:9)
% 0.20/0.67 %VarNum:61(SingletonVarNum:29)
% 0.20/0.67 %MaxLitNum:2
% 0.20/0.67 %MaxfuncDepth:3
% 0.20/0.67 %SharedTerms:21
% 0.20/0.67 %goalClause: 29
% 0.20/0.67 [10]E(f2(a1),a8)
% 0.20/0.67 [11]E(f2(a8),a1)
% 0.20/0.67 [12]E(f3(a8),a1)
% 0.20/0.67 [13]E(f7(x131,a1),a1)
% 0.20/0.67 [14]E(f6(x141,a8),a8)
% 0.20/0.67 [15]E(f7(x151,a8),x151)
% 0.20/0.68 [16]E(f6(x161,a1),x161)
% 0.20/0.68 [17]E(f7(x171,x171),x171)
% 0.20/0.68 [18]E(f6(x181,x181),x181)
% 0.20/0.68 [19]E(f7(x191,x192),f7(x192,x191))
% 0.20/0.68 [20]E(f6(x201,x202),f6(x202,x201))
% 0.20/0.68 [21]E(f7(x211,f6(x211,x212)),x211)
% 0.20/0.68 [22]E(f6(x221,f7(x221,x222)),x221)
% 0.20/0.68 [23]E(f6(f2(x231),f2(x232)),f2(f7(x231,x232)))
% 0.20/0.68 [24]E(f7(f2(x241),f2(x242)),f2(f6(x241,x242)))
% 0.20/0.68 [25]E(f3(f7(x251,x252)),f6(f3(x251),f3(x252)))
% 0.20/0.68 [26]E(f7(f7(x261,x262),x263),f7(x261,f7(x262,x263)))
% 0.20/0.68 [27]E(f6(f6(x271,x272),x273),f6(x271,f6(x272,x273)))
% 0.20/0.68 [29]~E(f3(f2(a1)),a1)+~E(f6(f3(f2(a4)),f3(f2(a5))),f3(f2(f6(a4,a5))))
% 0.20/0.68 [28]~E(f7(x282,x281),x282)+E(f7(x281,f6(x282,x283)),f6(x282,f7(x283,x281)))
% 0.20/0.68 %EqnAxiom
% 0.20/0.68 [1]E(x11,x11)
% 0.20/0.68 [2]E(x22,x21)+~E(x21,x22)
% 0.20/0.68 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.20/0.68 [4]~E(x41,x42)+E(f2(x41),f2(x42))
% 0.20/0.68 [5]~E(x51,x52)+E(f3(x51),f3(x52))
% 0.20/0.68 [6]~E(x61,x62)+E(f6(x61,x63),f6(x62,x63))
% 0.20/0.68 [7]~E(x71,x72)+E(f6(x73,x71),f6(x73,x72))
% 0.20/0.68 [8]~E(x81,x82)+E(f7(x81,x83),f7(x82,x83))
% 0.20/0.68 [9]~E(x91,x92)+E(f7(x93,x91),f7(x93,x92))
% 0.20/0.68
% 0.20/0.68 %-------------------------------------------
% 0.20/0.68 cnf(37,plain,
% 0.20/0.68 (E(f3(f2(a1)),f3(a8))),
% 0.20/0.68 inference(scs_inference,[],[10,17,2,3,9,8,7,6,5])).
% 0.20/0.68 cnf(43,plain,
% 0.20/0.68 (~E(f6(f3(f2(a4)),f3(f2(a5))),f3(f2(f6(a4,a5))))),
% 0.20/0.68 inference(scs_inference,[],[12,37,29,3])).
% 0.20/0.68 cnf(44,plain,
% 0.20/0.68 (~E(f3(f2(f6(a4,a5))),f6(f3(f2(a4)),f3(f2(a5))))),
% 0.20/0.68 inference(scs_inference,[],[43,2])).
% 0.20/0.68 cnf(142,plain,
% 0.20/0.68 ($false),
% 0.20/0.68 inference(scs_inference,[],[24,44,25,4,6,3,5,9,8,2]),
% 0.20/0.68 ['proof']).
% 0.20/0.68 % SZS output end Proof
% 0.20/0.68 % Total time :0.060000s
%------------------------------------------------------------------------------