TSTP Solution File: COL099-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL099-1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n032.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:35:05 EDT 2023
% Result : Unsatisfiable 4.66s 2.18s
% Output : CNFRefutation 4.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 20
% Syntax : Number of formulae : 34 ( 8 unt; 13 typ; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 58 ( 33 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 7 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 31 (; 31 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ member > trans > diamond > diamond_strip_lemmaD_sk1 > pair > comb_app > #nlpp > trancl > yp > ya > y > r > combS > combK
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(yp,type,
yp: $i ).
tff(r,type,
r: $i ).
tff(diamond_strip_lemmaD_sk1,type,
diamond_strip_lemmaD_sk1: ( $i * $i * $i * $i ) > $i ).
tff(diamond,type,
diamond: $i > $o ).
tff(comb_app,type,
comb_app: ( $i * $i ) > $i ).
tff(trans,type,
trans: $i > $o ).
tff(trancl,type,
trancl: $i > $i ).
tff(y,type,
y: $i ).
tff(combS,type,
combS: $i ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff(ya,type,
ya: $i ).
tff(pair,type,
pair: ( $i * $i ) > $i ).
tff(combK,type,
combK: $i ).
tff(f_92,axiom,
member(pair(y,ya),r),
file(unknown,unknown) ).
tff(f_93,axiom,
member(pair(y,yp),trancl(r)),
file(unknown,unknown) ).
tff(f_91,axiom,
diamond(r),
file(unknown,unknown) ).
tff(f_90,axiom,
! [R,X,Y,YP] :
( ~ diamond(R)
| ~ member(pair(X,Y),trancl(R))
| ~ member(pair(X,YP),R)
| member(pair(Y,diamond_strip_lemmaD_sk1(X,Y,YP,R)),R) ),
file(unknown,unknown) ).
tff(f_79,axiom,
! [R,X,Y,YP] :
( ~ diamond(R)
| ~ member(pair(X,Y),trancl(R))
| ~ member(pair(X,YP),R)
| member(pair(YP,diamond_strip_lemmaD_sk1(X,Y,YP,R)),trancl(R)) ),
file(unknown,unknown) ).
tff(f_55,axiom,
! [A,B,R] :
( ~ member(pair(A,B),R)
| member(pair(A,B),trancl(R)) ),
file(unknown,unknown) ).
tff(f_99,axiom,
! [Z] :
( ~ member(pair(ya,Z),trancl(r))
| ~ member(pair(yp,Z),trancl(r)) ),
file(unknown,unknown) ).
tff(c_27,plain,
member(pair(y,ya),r),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_29,plain,
member(pair(y,yp),trancl(r)),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_25,plain,
diamond(r),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_23,plain,
! [Y_31,X_30,YP_32,R_29] :
( member(pair(Y_31,diamond_strip_lemmaD_sk1(X_30,Y_31,YP_32,R_29)),R_29)
| ~ member(pair(X_30,YP_32),R_29)
| ~ member(pair(X_30,Y_31),trancl(R_29))
| ~ diamond(R_29) ),
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_115,plain,
! [YP_62,X_63,Y_64,R_65] :
( member(pair(YP_62,diamond_strip_lemmaD_sk1(X_63,Y_64,YP_62,R_65)),trancl(R_65))
| ~ member(pair(X_63,YP_62),R_65)
| ~ member(pair(X_63,Y_64),trancl(R_65))
| ~ diamond(R_65) ),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_15,plain,
! [A_17,B_18,R_19] :
( member(pair(A_17,B_18),trancl(R_19))
| ~ member(pair(A_17,B_18),R_19) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_46,plain,
! [Z_50] :
( ~ member(pair(yp,Z_50),trancl(r))
| ~ member(pair(ya,Z_50),trancl(r)) ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_51,plain,
! [B_18] :
( ~ member(pair(ya,B_18),trancl(r))
| ~ member(pair(yp,B_18),r) ),
inference(resolution,[status(thm)],[c_15,c_46]) ).
tff(c_121,plain,
! [X_63,Y_64] :
( ~ member(pair(yp,diamond_strip_lemmaD_sk1(X_63,Y_64,ya,r)),r)
| ~ member(pair(X_63,ya),r)
| ~ member(pair(X_63,Y_64),trancl(r))
| ~ diamond(r) ),
inference(resolution,[status(thm)],[c_115,c_51]) ).
tff(c_1111,plain,
! [X_153,Y_154] :
( ~ member(pair(yp,diamond_strip_lemmaD_sk1(X_153,Y_154,ya,r)),r)
| ~ member(pair(X_153,ya),r)
| ~ member(pair(X_153,Y_154),trancl(r)) ),
inference(demodulation,[status(thm),theory(equality)],[c_25,c_121]) ).
tff(c_1119,plain,
! [X_30] :
( ~ member(pair(X_30,ya),r)
| ~ member(pair(X_30,yp),trancl(r))
| ~ diamond(r) ),
inference(resolution,[status(thm)],[c_23,c_1111]) ).
tff(c_1126,plain,
! [X_155] :
( ~ member(pair(X_155,ya),r)
| ~ member(pair(X_155,yp),trancl(r)) ),
inference(demodulation,[status(thm),theory(equality)],[c_25,c_1119]) ).
tff(c_1148,plain,
~ member(pair(y,ya),r),
inference(resolution,[status(thm)],[c_29,c_1126]) ).
tff(c_1159,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_27,c_1148]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COL099-1 : TPTP v8.1.2. Released v2.7.0.
% 0.11/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.33 % Computer : n032.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 3 18:12:21 EDT 2023
% 0.13/0.33 % CPUTime :
% 4.66/2.18 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.66/2.19
% 4.66/2.19 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.66/2.21
% 4.66/2.21 Inference rules
% 4.66/2.21 ----------------------
% 4.66/2.21 #Ref : 2
% 4.66/2.21 #Sup : 271
% 4.66/2.21 #Fact : 0
% 4.66/2.21 #Define : 0
% 4.66/2.21 #Split : 7
% 4.66/2.21 #Chain : 0
% 4.66/2.21 #Close : 0
% 4.66/2.21
% 4.66/2.21 Ordering : KBO
% 4.66/2.21
% 4.66/2.21 Simplification rules
% 4.66/2.21 ----------------------
% 4.66/2.21 #Subsume : 64
% 4.66/2.21 #Demod : 61
% 4.66/2.21 #Tautology : 4
% 4.66/2.21 #SimpNegUnit : 0
% 4.66/2.22 #BackRed : 0
% 4.66/2.22
% 4.66/2.22 #Partial instantiations: 0
% 4.66/2.22 #Strategies tried : 1
% 4.66/2.22
% 4.66/2.22 Timing (in seconds)
% 4.66/2.22 ----------------------
% 4.66/2.22 Preprocessing : 0.51
% 4.66/2.22 Parsing : 0.27
% 4.66/2.22 CNF conversion : 0.02
% 4.66/2.22 Main loop : 0.62
% 4.66/2.22 Inferencing : 0.22
% 4.66/2.22 Reduction : 0.16
% 4.66/2.22 Demodulation : 0.10
% 4.66/2.22 BG Simplification : 0.02
% 4.66/2.22 Subsumption : 0.17
% 4.66/2.22 Abstraction : 0.02
% 4.66/2.22 MUC search : 0.00
% 4.66/2.22 Cooper : 0.00
% 4.66/2.22 Total : 1.17
% 4.66/2.22 Index Insertion : 0.00
% 4.66/2.22 Index Deletion : 0.00
% 4.66/2.22 Index Matching : 0.00
% 4.66/2.22 BG Taut test : 0.00
%------------------------------------------------------------------------------