TSTP Solution File: REL049-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : REL049-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n029.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 13:35:39 EDT 2023
% Result : Unsatisfiable 0.20s 0.64s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : REL049-1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 25 19:53:39 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.56 start to proof:theBenchmark
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % File :CSE---1.6
% 0.20/0.63 % Problem :theBenchmark
% 0.20/0.63 % Transform :cnf
% 0.20/0.63 % Format :tptp:raw
% 0.20/0.63 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.63
% 0.20/0.63 % Result :Theorem 0.020000s
% 0.20/0.63 % Output :CNFRefutation 0.020000s
% 0.20/0.63 %-------------------------------------------
% 0.20/0.64 %------------------------------------------------------------------------------
% 0.20/0.64 % File : REL049-1 : TPTP v8.1.2. Released v4.0.0.
% 0.20/0.64 % Domain : Relation Algebra
% 0.20/0.64 % Problem : Join splitting
% 0.20/0.64 % Version : [Mad95] (equational) axioms.
% 0.20/0.64 % English : Join can be split into 2 inequations iff the join is on the
% 0.20/0.64 % left hand side of an inequation.
% 0.20/0.64
% 0.20/0.64 % Refs : [Mad95] Maddux (1995), Relation-Algebraic Semantics
% 0.20/0.64 % : [Hoe08] Hoefner (2008), Email to G. Sutcliffe
% 0.20/0.64 % Source : [Hoe08]
% 0.20/0.64 % Names :
% 0.20/0.64
% 0.20/0.64 % Status : Unsatisfiable
% 0.20/0.64 % 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 v4.0.1, 0.07 v4.0.0
% 0.20/0.64 % Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 3 RR)
% 0.20/0.64 % Number of literals : 16 ( 16 equ; 1 neg)
% 0.20/0.64 % Maximal clause size : 1 ( 1 avg)
% 0.20/0.64 % Maximal term depth : 5 ( 2 avg)
% 0.20/0.64 % Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty)
% 0.20/0.64 % Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% 0.20/0.64 % Number of variables : 25 ( 0 sgn)
% 0.20/0.64 % SPC : CNF_UNS_RFO_PEQ_UEQ
% 0.20/0.64
% 0.20/0.64 % Comments : tptp2X -f tptp:short -t cnf:otter REL049+1.p
% 0.20/0.64 %------------------------------------------------------------------------------
% 0.20/0.64 %----Include axioms of relation algebra
% 0.20/0.64 include('Axioms/REL001-0.ax').
% 0.20/0.64 %------------------------------------------------------------------------------
% 0.20/0.64 cnf(goals_14,negated_conjecture,
% 0.20/0.64 join(sk1,sk2) = sk2 ).
% 0.20/0.64
% 0.20/0.64 cnf(goals_15,negated_conjecture,
% 0.20/0.64 join(sk3,sk2) = sk2 ).
% 0.20/0.64
% 0.20/0.64 cnf(goals_16,negated_conjecture,
% 0.20/0.64 join(join(sk1,sk3),sk2) != sk2 ).
% 0.20/0.64
% 0.20/0.64 %------------------------------------------------------------------------------
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 % Proof found
% 0.20/0.64 % SZS status Theorem for theBenchmark
% 0.20/0.64 % SZS output start Proof
% 0.20/0.64 %ClaNum:24(EqnAxiom:9)
% 0.20/0.64 %VarNum:49(SingletonVarNum:23)
% 0.20/0.64 %MaxLitNum:1
% 0.20/0.64 %MaxfuncDepth:4
% 0.20/0.64 %SharedTerms:13
% 0.20/0.64 %goalClause: 11 12 24
% 0.20/0.64 %singleGoalClaCount:3
% 0.20/0.64 [11]E(f5(a4,a7),a7)
% 0.20/0.64 [12]E(f5(a8,a7),a7)
% 0.20/0.64 [24]~E(f5(f5(a4,a8),a7),a7)
% 0.20/0.64 [13]E(f2(x131,a6),x131)
% 0.20/0.64 [10]E(f1(f1(x101)),x101)
% 0.20/0.64 [14]E(f5(x141,f3(x141)),a9)
% 0.20/0.64 [18]E(f3(f5(f3(x181),f3(f3(x181)))),a10)
% 0.20/0.64 [15]E(f5(x151,x152),f5(x152,x151))
% 0.20/0.64 [16]E(f5(f1(x161),f1(x162)),f1(f5(x161,x162)))
% 0.20/0.64 [17]E(f2(f1(x171),f1(x172)),f1(f2(x172,x171)))
% 0.20/0.64 [22]E(f5(f2(f1(x221),f3(f2(x221,x222))),f3(x222)),f3(x222))
% 0.20/0.64 [23]E(f5(f3(f5(f3(x231),f3(x232))),f3(f5(f3(x231),x232))),x231)
% 0.20/0.64 [19]E(f5(f5(x191,x192),x193),f5(x191,f5(x192,x193)))
% 0.20/0.64 [20]E(f2(f2(x201,x202),x203),f2(x201,f2(x202,x203)))
% 0.20/0.64 [21]E(f5(f2(x211,x212),f2(x213,x212)),f2(f5(x211,x213),x212))
% 0.20/0.64 %EqnAxiom
% 0.20/0.64 [1]E(x11,x11)
% 0.20/0.64 [2]E(x22,x21)+~E(x21,x22)
% 0.20/0.64 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.20/0.64 [4]~E(x41,x42)+E(f1(x41),f1(x42))
% 0.20/0.64 [5]~E(x51,x52)+E(f5(x51,x53),f5(x52,x53))
% 0.20/0.64 [6]~E(x61,x62)+E(f5(x63,x61),f5(x63,x62))
% 0.20/0.64 [7]~E(x71,x72)+E(f3(x71),f3(x72))
% 0.20/0.64 [8]~E(x81,x82)+E(f2(x81,x83),f2(x82,x83))
% 0.20/0.64 [9]~E(x91,x92)+E(f2(x93,x91),f2(x93,x92))
% 0.20/0.64
% 0.20/0.64 %-------------------------------------------
% 0.20/0.65 cnf(26,plain,
% 0.20/0.65 (~E(f5(f5(a4,a8),a7),f5(a4,a7))),
% 0.20/0.65 inference(scs_inference,[],[11,24,2,3])).
% 0.20/0.65 cnf(78,plain,
% 0.20/0.65 ($false),
% 0.20/0.65 inference(scs_inference,[],[14,19,26,12,3,2,6]),
% 0.20/0.65 ['proof']).
% 0.20/0.65 % SZS output end Proof
% 0.20/0.65 % Total time :0.020000s
%------------------------------------------------------------------------------