TSTP Solution File: LCL656+1.001 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n025.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 06:50:08 EDT 2023
% Result : Theorem 0.19s 0.61s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Aug 24 20:45:52 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.19/0.55 start to proof:theBenchmark
% 0.19/0.60 %-------------------------------------------
% 0.19/0.60 % File :CSE---1.6
% 0.19/0.60 % Problem :theBenchmark
% 0.19/0.60 % Transform :cnf
% 0.19/0.60 % Format :tptp:raw
% 0.19/0.60 % Command :java -jar mcs_scs.jar %d %s
% 0.19/0.60
% 0.19/0.60 % Result :Theorem 0.000000s
% 0.19/0.60 % Output :CNFRefutation 0.000000s
% 0.19/0.60 %-------------------------------------------
% 0.19/0.60 %------------------------------------------------------------------------------
% 0.19/0.60 % File : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.19/0.60 % Domain : Logic Calculi (Modal Logic)
% 0.19/0.60 % Problem : In KT, the branching formula made provable, size 1
% 0.19/0.60 % Version : Especial.
% 0.19/0.60 % English : The branching formula plus a negation symbol in front and an
% 0.19/0.60 % additional subformula to make the formula provable.
% 0.19/0.60
% 0.19/0.60 % Refs : [BHS00] Balsiger et al. (2000), A Benchmark Method for the Pro
% 0.19/0.60 % : [Kam08] Kaminski (2008), Email to G. Sutcliffe
% 0.19/0.60 % Source : [Kam08]
% 0.19/0.60 % Names : kt_branch_p [BHS00]
% 0.19/0.60
% 0.19/0.60 % Status : Theorem
% 0.19/0.60 % Rating : 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v6.1.0, 0.04 v6.0.0, 0.25 v5.5.0, 0.08 v5.4.0, 0.09 v5.3.0, 0.17 v5.2.0, 0.07 v5.0.0, 0.05 v4.1.0, 0.06 v4.0.1, 0.05 v4.0.0
% 0.19/0.60 % Syntax : Number of formulae : 2 ( 1 unt; 0 def)
% 0.19/0.60 % Number of atoms : 38 ( 0 equ)
% 0.19/0.60 % Maximal formula atoms : 37 ( 19 avg)
% 0.19/0.60 % Number of connectives : 70 ( 34 ~; 22 |; 14 &)
% 0.19/0.60 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.19/0.60 % Maximal formula depth : 19 ( 11 avg)
% 0.19/0.60 % Maximal term depth : 1 ( 1 avg)
% 0.19/0.60 % Number of predicates : 6 ( 6 usr; 0 prp; 1-2 aty)
% 0.19/0.60 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.19/0.60 % Number of variables : 10 ( 9 !; 1 ?)
% 0.19/0.60 % SPC : FOF_THM_RFO_NEQ
% 0.19/0.60
% 0.19/0.60 % Comments : A naive relational encoding of the modal logic problem into
% 0.19/0.60 % first-order logic.
% 0.19/0.60 %------------------------------------------------------------------------------
% 0.19/0.60 fof(reflexivity,axiom,
% 0.19/0.60 ! [X] : r1(X,X) ).
% 0.19/0.60
% 0.19/0.60 fof(main,conjecture,
% 0.19/0.60 ~ ? [X] :
% 0.19/0.60 ~ ( ~ ! [Y] :
% 0.19/0.60 ( ~ r1(X,Y)
% 0.19/0.60 | p2(Y) )
% 0.19/0.60 | ~ ( ! [Y] :
% 0.19/0.60 ( ~ r1(X,Y)
% 0.19/0.60 | ( ( ( ~ ! [X] :
% 0.19/0.60 ( ~ r1(Y,X)
% 0.19/0.60 | ~ ( ~ p2(X)
% 0.19/0.60 & ~ p102(X)
% 0.19/0.60 & p101(X) ) )
% 0.19/0.60 & ~ ! [X] :
% 0.19/0.60 ( ~ r1(Y,X)
% 0.19/0.60 | ~ ( p2(X)
% 0.19/0.60 & ~ p102(X)
% 0.19/0.60 & p101(X) ) ) )
% 0.19/0.60 | ~ ( ~ p101(Y)
% 0.19/0.60 & p100(Y) ) )
% 0.19/0.60 & ( ( ( ! [X] :
% 0.19/0.60 ( ~ r1(Y,X)
% 0.19/0.60 | ~ p2(X)
% 0.19/0.60 | ~ p101(X) )
% 0.19/0.60 | p2(Y) )
% 0.19/0.60 & ( ! [X] :
% 0.19/0.60 ( ~ r1(Y,X)
% 0.19/0.60 | p2(X)
% 0.19/0.60 | ~ p101(X) )
% 0.19/0.60 | ~ p2(Y) ) )
% 0.19/0.60 | ~ p101(Y) )
% 0.19/0.61 & ( ( ( ! [X] :
% 0.19/0.61 ( ~ r1(Y,X)
% 0.19/0.61 | ~ p1(X)
% 0.19/0.61 | ~ p100(X) )
% 0.19/0.61 | p1(Y) )
% 0.19/0.61 & ( ! [X] :
% 0.19/0.61 ( ~ r1(Y,X)
% 0.19/0.61 | p1(X)
% 0.19/0.61 | ~ p100(X) )
% 0.19/0.61 | ~ p1(Y) ) )
% 0.19/0.61 | ~ p100(Y) )
% 0.19/0.61 & ( p101(Y)
% 0.19/0.61 | ~ p102(Y) )
% 0.19/0.61 & ( p100(Y)
% 0.19/0.61 | ~ p101(Y) ) ) )
% 0.19/0.61 & ~ p101(X)
% 0.19/0.61 & p100(X) ) ) ).
% 0.19/0.61
% 0.19/0.61 %------------------------------------------------------------------------------
% 0.19/0.61 %-------------------------------------------
% 0.19/0.61 % Proof found
% 0.19/0.61 % SZS status Theorem for theBenchmark
% 0.19/0.61 % SZS output start Proof
% 0.19/0.61 %ClaNum:18(EqnAxiom:0)
% 0.19/0.61 %VarNum:65(SingletonVarNum:18)
% 0.19/0.61 %MaxLitNum:6
% 0.19/0.61 %MaxfuncDepth:1
% 0.19/0.61 %SharedTerms:3
% 0.19/0.61 %goalClause: 1 3 4 5 6 7 8 9 10 11 12 13 14 15 17 18
% 0.19/0.61 %singleGoalClaCount:2
% 0.19/0.61 [1]P1(a1)
% 0.19/0.61 [3]~P4(a1)
% 0.19/0.61 [2]P3(x21,x21)
% 0.19/0.61 [4]P5(x41)+~P3(a1,x41)
% 0.19/0.61 [5]~P6(x51)+P4(x51)+~P3(a1,x51)
% 0.19/0.61 [6]~P4(x61)+P1(x61)+~P3(a1,x61)
% 0.19/0.61 [7]~P1(x71)+P4(x71)+~P3(a1,x71)+P5(f2(x71))
% 0.19/0.61 [8]~P1(x81)+P4(x81)+~P3(a1,x81)+P4(f3(x81))
% 0.19/0.61 [9]~P1(x91)+P4(x91)+~P3(a1,x91)+P4(f2(x91))
% 0.19/0.61 [10]~P1(x101)+P4(x101)+~P3(a1,x101)+~P5(f3(x101))
% 0.19/0.61 [11]~P1(x111)+P4(x111)+~P3(a1,x111)+~P6(f3(x111))
% 0.19/0.61 [12]~P1(x121)+P4(x121)+~P3(a1,x121)+~P6(f2(x121))
% 0.19/0.61 [13]~P1(x131)+P4(x131)+P3(x131,f3(x131))+~P3(a1,x131)
% 0.19/0.61 [14]~P1(x141)+P4(x141)+P3(x141,f2(x141))+~P3(a1,x141)
% 0.19/0.61 [15]~P4(x151)+~P4(x152)+~P3(x152,x151)+P5(x151)+~P5(x152)+~P3(a1,x152)
% 0.19/0.61 [17]~P1(x171)+~P2(x172)+~P3(x172,x171)+P2(x171)+~P1(x172)+~P3(a1,x172)
% 0.19/0.61 [18]~P1(x181)+~P2(x182)+~P3(x181,x182)+P2(x181)+~P1(x182)+~P3(a1,x181)
% 0.19/0.61 %EqnAxiom
% 0.19/0.61
% 0.19/0.61 %-------------------------------------------
% 0.19/0.61 cnf(20,plain,
% 0.19/0.61 (P3(x201,x201)),
% 0.19/0.61 inference(rename_variables,[],[2])).
% 0.19/0.61 cnf(22,plain,
% 0.19/0.61 (P3(x221,x221)),
% 0.19/0.61 inference(rename_variables,[],[2])).
% 0.19/0.61 cnf(24,plain,
% 0.19/0.61 (P3(a1,f3(a1))),
% 0.19/0.61 inference(scs_inference,[],[1,2,20,22,3,4,14,13])).
% 0.19/0.61 cnf(25,plain,
% 0.19/0.61 (P3(x251,x251)),
% 0.19/0.61 inference(rename_variables,[],[2])).
% 0.19/0.61 cnf(27,plain,
% 0.19/0.61 (~P5(f3(a1))),
% 0.19/0.61 inference(scs_inference,[],[1,2,20,22,25,3,4,14,13,10])).
% 0.19/0.61 cnf(44,plain,
% 0.19/0.61 ($false),
% 0.19/0.61 inference(scs_inference,[],[27,24,4]),
% 0.19/0.61 ['proof']).
% 0.19/0.61 % SZS output end Proof
% 0.19/0.61 % Total time :0.000000s
%------------------------------------------------------------------------------