%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : PLA006-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n026.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 13:35:28 EDT 2024
% Result : Unsatisfiable 0.66s 0.70s
% Output : CNFRefutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PLA006-1 : TPTP v8.2.0. Released v1.1.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Jun 18 17:20:09 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.66/0.65 start to proof:theBenchmark
% 0.66/0.70 %-------------------------------------------
% 0.66/0.70 % File :CSE---1.7
% 0.66/0.70 % Problem :theBenchmark
% 0.66/0.70 % Transform :cnf
% 0.66/0.70 % Format :tptp:raw
% 0.66/0.70 % Command :java -jar mcs_scs.jar %d %s
% 0.66/0.70
% 0.66/0.70 % Result :Theorem 0.000000s
% 0.66/0.70 % Output :CNFRefutation 0.000000s
% 0.66/0.70 %-------------------------------------------
% 0.66/0.70 %--------------------------------------------------------------------------
% 0.66/0.70 % File : PLA006-1 : TPTP v8.2.0. Released v1.1.0.
% 0.66/0.70 % Domain : Planning (Blocks world)
% 0.66/0.70 % Problem : Block C on Table
% 0.66/0.70 % Version : [SE94] axioms.
% 0.66/0.70 % English :
% 0.66/0.70
% 0.66/0.70 % Refs : [Sus73] Sussman (1973), A Computational Model of Skill Acquisi
% 0.66/0.70 % : [SE94] Segre & Elkan (1994), A High-Performance Explanation-B
% 0.66/0.70 % Source : [SE94]
% 0.66/0.70 % Names : - [SE94]
% 0.66/0.70
% 0.66/0.70 % Status : Unsatisfiable
% 0.66/0.70 % Rating : 0.00 v7.4.0, 0.17 v7.3.0, 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.08 v5.1.0, 0.06 v5.0.0, 0.00 v2.4.0, 0.14 v2.3.0, 0.00 v2.0.0
% 0.66/0.70 % Syntax : Number of clauses : 31 ( 20 unt; 0 nHn; 28 RR)
% 0.66/0.70 % Number of literals : 53 ( 0 equ; 23 neg)
% 0.66/0.70 % Maximal clause size : 4 ( 1 avg)
% 0.66/0.70 % Maximal term depth : 3 ( 1 avg)
% 0.66/0.70 % Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty)
% 0.66/0.70 % Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% 0.66/0.70 % Number of variables : 37 ( 5 sgn)
% 0.66/0.70 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.66/0.70
% 0.66/0.70 % Comments : The axioms are a reconstruction of the situation calculus
% 0.66/0.70 % blocks world as in [Sus73].
% 0.66/0.70 %--------------------------------------------------------------------------
% 0.66/0.70 %----Include Blocks world axioms
% 0.66/0.70 include('Axioms/PLA001-0.ax').
% 0.66/0.70 %----Include Blocks world difference axioms for 4 blocks
% 0.66/0.70 include('Axioms/PLA001-1.ax').
% 0.66/0.70 %--------------------------------------------------------------------------
% 0.66/0.70 cnf(prove_CTable,negated_conjecture,
% 0.66/0.70 ~ holds(on(c,table),State) ).
% 0.66/0.70
% 0.66/0.70 %--------------------------------------------------------------------------
% 0.66/0.70 %-------------------------------------------
% 0.66/0.70 % Proof found
% 0.66/0.70 % SZS status Theorem for theBenchmark
% 0.66/0.70 % SZS output start Proof
% 0.66/0.71 %ClaNum:31(EqnAxiom:0)
% 0.66/0.71 %VarNum:85(SingletonVarNum:37)
% 0.66/0.71 %MaxLitNum:4
% 0.66/0.71 %MaxfuncDepth:2
% 0.66/0.71 %SharedTerms:34
% 0.66/0.71 %goalClause: 20
% 0.66/0.71 %singleGoalClaCount:1
% 0.66/0.71 [1]P1(a1,a9)
% 0.66/0.71 [2]P2(a2,a14)
% 0.66/0.71 [3]P2(a2,a3)
% 0.66/0.71 [4]P2(a2,a5)
% 0.66/0.71 [5]P2(a2,a6)
% 0.66/0.71 [6]P2(a3,a14)
% 0.66/0.71 [7]P2(a3,a5)
% 0.66/0.71 [8]P2(a3,a6)
% 0.66/0.71 [9]P2(a5,a14)
% 0.66/0.71 [10]P2(a5,a6)
% 0.66/0.71 [11]P2(a6,a14)
% 0.66/0.71 [12]P1(f7(a2),a9)
% 0.66/0.71 [13]P1(f7(a3),a9)
% 0.66/0.71 [14]P1(f7(a5),a9)
% 0.66/0.71 [16]P1(f10(a2,a14),a9)
% 0.66/0.71 [17]P1(f10(a3,a14),a9)
% 0.66/0.71 [18]P1(f10(a5,a6),a9)
% 0.66/0.71 [19]P1(f10(a6,a14),a9)
% 0.66/0.71 [15]P1(f7(a14),x151)
% 0.66/0.71 [20]~P1(f10(a5,a14),x201)
% 0.66/0.71 [21]~P2(x212,x211)+P2(x211,x212)
% 0.66/0.71 [30]~P1(f10(x301,x302),x305)+P1(f10(x301,x302),f8(f13(x303,x304),x305))
% 0.66/0.71 [22]~P1(x222,x223)+~P1(x221,x223)+P1(f4(x221,x222),x223)
% 0.66/0.71 [23]~P2(x231,x232)+~P1(f7(x231),x233)+P1(f7(x231),f8(f12(x232),x233))
% 0.66/0.71 [26]~P1(f11(x261),x263)+~P1(f7(x262),x263)+P1(a1,f8(f13(x261,x262),x263))
% 0.66/0.71 [27]~P1(f11(x271),x273)+~P1(f7(x272),x273)+P1(f7(x271),f8(f13(x271,x272),x273))
% 0.66/0.71 [31]~P1(f11(x311),x313)+~P1(f7(x312),x313)+P1(f10(x311,x312),f8(f13(x311,x312),x313))
% 0.66/0.71 [25]~P2(x251,x253)+~P1(f7(x251),x254)+P1(f7(x251),f8(f13(x252,x253),x254))
% 0.66/0.71 [28]~P2(x281,x283)+~P1(f10(x281,x282),x284)+P1(f10(x281,x282),f8(f12(x283),x284))
% 0.66/0.71 [24]~P2(x241,a14)+~P1(a1,x242)+~P1(f7(x241),x242)+P1(f11(x241),f8(f12(x241),x242))
% 0.66/0.71 [29]~P1(a1,x293)+~P1(f7(x292),x293)+~P1(f10(x292,x291),x293)+P1(f7(x291),f8(f12(x292),x293))
% 0.66/0.71 %EqnAxiom
% 0.66/0.71
% 0.66/0.71 %-------------------------------------------
% 0.66/0.71 cnf(35,plain,
% 0.66/0.71 ($false),
% 0.66/0.71 inference(scs_inference,[],[20,15,1,9,14,31,24]),
% 0.66/0.71 ['proof']).
% 0.66/0.71 % SZS output end Proof
% 0.66/0.71 % Total time :0.000000s
%------------------------------------------------------------------------------