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 : n015.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:40 EDT 2023
% Result : Theorem 0.20s 0.62s
% 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 : n015.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 23:01:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.56 start to proof:theBenchmark
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % File :CSE---1.6
% 0.20/0.62 % Problem :theBenchmark
% 0.20/0.62 % Transform :cnf
% 0.20/0.62 % Format :tptp:raw
% 0.20/0.62 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.62
% 0.20/0.62 % Result :Theorem 0.010000s
% 0.20/0.62 % Output :CNFRefutation 0.010000s
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 % File : REL049+1 : TPTP v8.1.2. Released v4.0.0.
% 0.20/0.62 % Domain : Relation Algebra
% 0.20/0.62 % Problem : Join splitting
% 0.20/0.62 % Version : [Mad95] (equational) axioms.
% 0.20/0.62 % English : Join can be split into 2 inequations iff the join is on the
% 0.20/0.62 % left hand side of an inequation.
% 0.20/0.62
% 0.20/0.62 % Refs : [Mad95] Maddux (1995), Relation-Algebraic Semantics
% 0.20/0.62 % : [Hoe08] Hoefner (2008), Email to G. Sutcliffe
% 0.20/0.62 % Source : [Hoe08]
% 0.20/0.62 % Names :
% 0.20/0.62
% 0.20/0.62 % Status : Theorem
% 0.20/0.62 % Rating : 0.00 v6.3.0, 0.07 v6.2.0, 0.09 v6.1.0, 0.00 v4.0.0
% 0.20/0.62 % Syntax : Number of formulae : 14 ( 13 unt; 0 def)
% 0.20/0.62 % Number of atoms : 16 ( 16 equ)
% 0.20/0.62 % Maximal formula atoms : 3 ( 1 avg)
% 0.20/0.62 % Number of connectives : 2 ( 0 ~; 0 |; 1 &)
% 0.20/0.62 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.20/0.62 % Maximal formula depth : 6 ( 3 avg)
% 0.20/0.62 % Maximal term depth : 5 ( 2 avg)
% 0.20/0.62 % Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty)
% 0.20/0.62 % Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% 0.20/0.62 % Number of variables : 28 ( 28 !; 0 ?)
% 0.20/0.62 % SPC : FOF_THM_RFO_PEQ
% 0.20/0.62
% 0.20/0.62 % Comments :
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 %---Include axioms for relation algebra
% 0.20/0.62 include('Axioms/REL001+0.ax').
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 fof(goals,conjecture,
% 0.20/0.62 ! [X0,X1,X2] :
% 0.20/0.62 ( ( join(X0,X1) = X1
% 0.20/0.62 & join(X2,X1) = X1 )
% 0.20/0.62 => join(join(X0,X2),X1) = X1 ) ).
% 0.20/0.62
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % Proof found
% 0.20/0.62 % SZS status Theorem for theBenchmark
% 0.20/0.62 % SZS output start Proof
% 0.20/0.62 %ClaNum:24(EqnAxiom:9)
% 0.20/0.62 %VarNum:49(SingletonVarNum:23)
% 0.20/0.62 %MaxLitNum:1
% 0.20/0.62 %MaxfuncDepth:4
% 0.20/0.62 %SharedTerms:13
% 0.20/0.62 %goalClause: 11 12 24
% 0.20/0.62 %singleGoalClaCount:3
% 0.20/0.63 [11]E(f6(a4,a5),a5)
% 0.20/0.63 [12]E(f6(a7,a5),a5)
% 0.20/0.63 [24]~E(f6(f6(a4,a7),a5),a5)
% 0.20/0.63 [13]E(f2(x131,a8),x131)
% 0.20/0.63 [10]E(f1(f1(x101)),x101)
% 0.20/0.63 [14]E(f6(x141,f3(x141)),a9)
% 0.20/0.63 [18]E(f3(f6(f3(x181),f3(f3(x181)))),a10)
% 0.20/0.63 [15]E(f6(x151,x152),f6(x152,x151))
% 0.20/0.63 [16]E(f6(f1(x161),f1(x162)),f1(f6(x161,x162)))
% 0.20/0.63 [17]E(f2(f1(x171),f1(x172)),f1(f2(x172,x171)))
% 0.20/0.63 [22]E(f6(f2(f1(x221),f3(f2(x221,x222))),f3(x222)),f3(x222))
% 0.20/0.63 [23]E(f6(f3(f6(f3(x231),f3(x232))),f3(f6(f3(x231),x232))),x231)
% 0.20/0.63 [19]E(f6(f6(x191,x192),x193),f6(x191,f6(x192,x193)))
% 0.20/0.63 [20]E(f2(f2(x201,x202),x203),f2(x201,f2(x202,x203)))
% 0.20/0.63 [21]E(f6(f2(x211,x212),f2(x213,x212)),f2(f6(x211,x213),x212))
% 0.20/0.63 %EqnAxiom
% 0.20/0.63 [1]E(x11,x11)
% 0.20/0.63 [2]E(x22,x21)+~E(x21,x22)
% 0.20/0.63 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.20/0.63 [4]~E(x41,x42)+E(f1(x41),f1(x42))
% 0.20/0.63 [5]~E(x51,x52)+E(f6(x51,x53),f6(x52,x53))
% 0.20/0.63 [6]~E(x61,x62)+E(f6(x63,x61),f6(x63,x62))
% 0.20/0.63 [7]~E(x71,x72)+E(f3(x71),f3(x72))
% 0.20/0.63 [8]~E(x81,x82)+E(f2(x81,x83),f2(x82,x83))
% 0.20/0.63 [9]~E(x91,x92)+E(f2(x93,x91),f2(x93,x92))
% 0.20/0.63
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 cnf(26,plain,
% 0.20/0.63 (~E(f6(f6(a4,a7),a5),f6(a4,a5))),
% 0.20/0.63 inference(scs_inference,[],[11,24,2,3])).
% 0.20/0.63 cnf(78,plain,
% 0.20/0.63 ($false),
% 0.20/0.63 inference(scs_inference,[],[14,19,26,12,5,2,3,6]),
% 0.20/0.63 ['proof']).
% 0.20/0.63 % SZS output end Proof
% 0.20/0.63 % Total time :0.010000s
%------------------------------------------------------------------------------