TSTP Solution File: PUZ008-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ008-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %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 : Tue Aug 22 10:53:50 EDT 2023
% Result : Unsatisfiable 3.26s 1.83s
% Output : CNFRefutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 12
% Syntax : Number of formulae : 17 ( 6 unt; 9 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 21 (; 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ achievable > west > east > #nlpp > s > m > c > n0 > boatonwest > boatoneast
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(achievable,type,
achievable: ( $i * $i * $i ) > $o ).
tff(west,type,
west: ( $i * $i ) > $i ).
tff(s,type,
s: $i > $i ).
tff(east,type,
east: ( $i * $i ) > $i ).
tff(boatoneast,type,
boatoneast: $i ).
tff(c,type,
c: $i > $i ).
tff(n0,type,
n0: $i ).
tff(m,type,
m: $i > $i ).
tff(boatonwest,type,
boatonwest: $i ).
tff(f_96,axiom,
! [X,Y,Z,W] : achievable(west(X,Y),Z,east(m(s(W)),c(s(s(W))))),
file(unknown,unknown) ).
tff(f_60,axiom,
! [X,Y,Z,W] :
( ~ achievable(west(m(s(X)),c(Y)),boatonwest,east(m(Z),c(W)))
| achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(W))) ),
file(unknown,unknown) ).
tff(f_102,axiom,
! [X] : ~ achievable(west(m(n0),c(n0)),X,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
file(unknown,unknown) ).
tff(c_26,plain,
! [X_49,Y_50,Z_51,W_52] : achievable(west(X_49,Y_50),Z_51,east(m(s(W_52)),c(s(s(W_52))))),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_38,plain,
! [X_75,Y_76,Z_77,W_78] :
( achievable(west(m(X_75),c(Y_76)),boatoneast,east(m(s(Z_77)),c(W_78)))
| ~ achievable(west(m(s(X_75)),c(Y_76)),boatonwest,east(m(Z_77),c(W_78))) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_72,plain,
! [X_89,Y_90,W_91] : achievable(west(m(X_89),c(Y_90)),boatoneast,east(m(s(s(W_91))),c(s(s(W_91))))),
inference(resolution,[status(thm)],[c_26,c_38]) ).
tff(c_32,plain,
! [X_57] : ~ achievable(west(m(n0),c(n0)),X_57,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_77,plain,
$false,
inference(resolution,[status(thm)],[c_72,c_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ008-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.16/0.34 % Computer : n026.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu Aug 3 17:55:17 EDT 2023
% 0.16/0.34 % CPUTime :
% 3.26/1.83 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.26/1.83
% 3.26/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.26/1.86
% 3.26/1.86 Inference rules
% 3.26/1.86 ----------------------
% 3.26/1.86 #Ref : 0
% 3.26/1.86 #Sup : 7
% 3.26/1.86 #Fact : 0
% 3.26/1.86 #Define : 0
% 3.26/1.86 #Split : 0
% 3.26/1.86 #Chain : 0
% 3.26/1.86 #Close : 0
% 3.26/1.86
% 3.26/1.86 Ordering : KBO
% 3.26/1.86
% 3.26/1.86 Simplification rules
% 3.26/1.86 ----------------------
% 3.26/1.86 #Subsume : 0
% 3.26/1.86 #Demod : 2
% 3.26/1.86 #Tautology : 3
% 3.26/1.86 #SimpNegUnit : 0
% 3.26/1.86 #BackRed : 0
% 3.26/1.86
% 3.26/1.86 #Partial instantiations: 0
% 3.26/1.86 #Strategies tried : 1
% 3.26/1.86
% 3.26/1.86 Timing (in seconds)
% 3.26/1.86 ----------------------
% 3.26/1.86 Preprocessing : 0.50
% 3.26/1.87 Parsing : 0.28
% 3.26/1.87 CNF conversion : 0.03
% 3.26/1.87 Main loop : 0.20
% 3.26/1.87 Inferencing : 0.07
% 3.26/1.87 Reduction : 0.06
% 3.26/1.87 Demodulation : 0.05
% 3.26/1.87 BG Simplification : 0.01
% 3.26/1.87 Subsumption : 0.04
% 3.26/1.87 Abstraction : 0.01
% 3.26/1.87 MUC search : 0.00
% 3.26/1.87 Cooper : 0.00
% 3.26/1.87 Total : 0.74
% 3.26/1.87 Index Insertion : 0.00
% 3.26/1.87 Index Deletion : 0.00
% 3.26/1.87 Index Matching : 0.00
% 3.26/1.87 BG Taut test : 0.00
%------------------------------------------------------------------------------