TSTP Solution File: COL098-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL098-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 : 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:35:05 EDT 2023
% Result : Unsatisfiable 8.37s 3.15s
% Output : CNFRefutation 8.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 24
% Syntax : Number of formulae : 43 ( 7 unt; 14 typ; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 84 ( 45 ~; 39 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 7 >; 5 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 52 (; 52 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ member > trans > sk1 > pair > comb_app > #nlpp > trancl > sk2 > z > y > x > sk3 > r > combS > combK
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(sk2,type,
sk2: $i > $i ).
tff(x,type,
x: $i ).
tff(r,type,
r: $i ).
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(pair,type,
pair: ( $i * $i ) > $i ).
tff(sk1,type,
sk1: ( $i * $i * $i ) > $i ).
tff(sk3,type,
sk3: $i ).
tff(z,type,
z: $i ).
tff(combK,type,
combK: $i ).
tff(f_97,axiom,
member(pair(x,sk3),r),
file(unknown,unknown) ).
tff(f_86,axiom,
member(pair(y,z),r),
file(unknown,unknown) ).
tff(f_96,axiom,
! [YP] :
( ~ member(pair(x,YP),r)
| member(pair(y,sk2(YP)),r) ),
file(unknown,unknown) ).
tff(f_76,axiom,
! [X,Y,YP] :
( ~ member(pair(X,Y),r)
| ~ member(pair(X,YP),r)
| member(pair(Y,sk1(X,Y,YP)),r) ),
file(unknown,unknown) ).
tff(f_84,axiom,
! [X,Y,YP] :
( ~ member(pair(X,Y),r)
| ~ member(pair(X,YP),r)
| member(pair(YP,sk1(X,Y,YP)),r) ),
file(unknown,unknown) ).
tff(f_91,axiom,
! [YP] :
( ~ member(pair(x,YP),r)
| member(pair(YP,sk2(YP)),trancl(r)) ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [R] : trans(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_68,axiom,
! [R,A,B,C] :
( ~ trans(R)
| ~ member(pair(A,B),R)
| ~ member(pair(B,C),R)
| member(pair(A,C),R) ),
file(unknown,unknown) ).
tff(f_103,axiom,
! [ZA] :
( ~ member(pair(sk3,ZA),trancl(r))
| ~ member(pair(z,ZA),r) ),
file(unknown,unknown) ).
tff(c_33,plain,
member(pair(x,sk3),r),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_27,plain,
member(pair(y,z),r),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_31,plain,
! [YP_32] :
( member(pair(y,sk2(YP_32)),r)
| ~ member(pair(x,YP_32),r) ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_21,plain,
! [Y_26,X_25,YP_27] :
( member(pair(Y_26,sk1(X_25,Y_26,YP_27)),r)
| ~ member(pair(X_25,YP_27),r)
| ~ member(pair(X_25,Y_26),r) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_23,plain,
! [YP_30,X_28,Y_29] :
( member(pair(YP_30,sk1(X_28,Y_29,YP_30)),r)
| ~ member(pair(X_28,YP_30),r)
| ~ member(pair(X_28,Y_29),r) ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_29,plain,
! [YP_31] :
( member(pair(YP_31,sk2(YP_31)),trancl(r))
| ~ member(pair(x,YP_31),r) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_17,plain,
! [R_20] : trans(trancl(R_20)),
inference(cnfTransformation,[status(thm)],[f_57]) ).
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_66,plain,
! [A_54,C_55,R_56,B_57] :
( member(pair(A_54,C_55),R_56)
| ~ member(pair(B_57,C_55),R_56)
| ~ member(pair(A_54,B_57),R_56)
| ~ trans(R_56) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_72,plain,
! [A_54,B_18,R_19,A_17] :
( member(pair(A_54,B_18),trancl(R_19))
| ~ member(pair(A_54,A_17),trancl(R_19))
| ~ trans(trancl(R_19))
| ~ member(pair(A_17,B_18),R_19) ),
inference(resolution,[status(thm)],[c_15,c_66]) ).
tff(c_117,plain,
! [A_62,B_63,R_64,A_65] :
( member(pair(A_62,B_63),trancl(R_64))
| ~ member(pair(A_62,A_65),trancl(R_64))
| ~ member(pair(A_65,B_63),R_64) ),
inference(demodulation,[status(thm),theory(equality)],[c_17,c_72]) ).
tff(c_304,plain,
! [YP_86,B_87] :
( member(pair(YP_86,B_87),trancl(r))
| ~ member(pair(sk2(YP_86),B_87),r)
| ~ member(pair(x,YP_86),r) ),
inference(resolution,[status(thm)],[c_29,c_117]) ).
tff(c_4003,plain,
! [YP_322,X_323,Y_324] :
( member(pair(YP_322,sk1(X_323,Y_324,sk2(YP_322))),trancl(r))
| ~ member(pair(x,YP_322),r)
| ~ member(pair(X_323,sk2(YP_322)),r)
| ~ member(pair(X_323,Y_324),r) ),
inference(resolution,[status(thm)],[c_23,c_304]) ).
tff(c_35,plain,
! [ZA_33] :
( ~ member(pair(z,ZA_33),r)
| ~ member(pair(sk3,ZA_33),trancl(r)) ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_4065,plain,
! [X_323,Y_324] :
( ~ member(pair(z,sk1(X_323,Y_324,sk2(sk3))),r)
| ~ member(pair(x,sk3),r)
| ~ member(pair(X_323,sk2(sk3)),r)
| ~ member(pair(X_323,Y_324),r) ),
inference(resolution,[status(thm)],[c_4003,c_35]) ).
tff(c_4099,plain,
! [X_325,Y_326] :
( ~ member(pair(z,sk1(X_325,Y_326,sk2(sk3))),r)
| ~ member(pair(X_325,sk2(sk3)),r)
| ~ member(pair(X_325,Y_326),r) ),
inference(demodulation,[status(thm),theory(equality)],[c_33,c_4065]) ).
tff(c_4105,plain,
! [X_327] :
( ~ member(pair(X_327,sk2(sk3)),r)
| ~ member(pair(X_327,z),r) ),
inference(resolution,[status(thm)],[c_21,c_4099]) ).
tff(c_4109,plain,
( ~ member(pair(y,z),r)
| ~ member(pair(x,sk3),r) ),
inference(resolution,[status(thm)],[c_31,c_4105]) ).
tff(c_4113,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_33,c_27,c_4109]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL098-1 : TPTP v8.1.2. Released v2.7.0.
% 0.00/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.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 18:29:31 EDT 2023
% 0.12/0.34 % CPUTime :
% 8.37/3.15 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.37/3.16
% 8.37/3.16 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.37/3.19
% 8.37/3.19 Inference rules
% 8.37/3.19 ----------------------
% 8.37/3.19 #Ref : 2
% 8.37/3.19 #Sup : 1196
% 8.37/3.19 #Fact : 0
% 8.37/3.19 #Define : 0
% 8.37/3.19 #Split : 13
% 8.37/3.19 #Chain : 0
% 8.37/3.19 #Close : 0
% 8.37/3.19
% 8.37/3.19 Ordering : KBO
% 8.37/3.19
% 8.37/3.19 Simplification rules
% 8.37/3.19 ----------------------
% 8.37/3.19 #Subsume : 313
% 8.37/3.19 #Demod : 78
% 8.37/3.19 #Tautology : 6
% 8.37/3.19 #SimpNegUnit : 0
% 8.37/3.19 #BackRed : 0
% 8.37/3.19
% 8.37/3.19 #Partial instantiations: 0
% 8.37/3.19 #Strategies tried : 1
% 8.37/3.19
% 8.37/3.19 Timing (in seconds)
% 8.37/3.19 ----------------------
% 8.37/3.19 Preprocessing : 0.58
% 8.37/3.19 Parsing : 0.32
% 8.37/3.19 CNF conversion : 0.03
% 8.37/3.19 Main loop : 1.45
% 8.37/3.19 Inferencing : 0.50
% 8.37/3.19 Reduction : 0.35
% 8.37/3.19 Demodulation : 0.23
% 8.37/3.19 BG Simplification : 0.04
% 8.37/3.19 Subsumption : 0.46
% 8.37/3.20 Abstraction : 0.04
% 8.37/3.20 MUC search : 0.00
% 8.37/3.20 Cooper : 0.00
% 8.37/3.20 Total : 2.08
% 8.37/3.20 Index Insertion : 0.00
% 8.37/3.20 Index Deletion : 0.00
% 8.37/3.20 Index Matching : 0.00
% 8.37/3.20 BG Taut test : 0.00
%------------------------------------------------------------------------------