TSTP Solution File: COL052-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL052-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 : n003.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:34:54 EDT 2023
% Result : Unsatisfiable 2.47s 1.63s
% Output : CNFRefutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 19 ( 12 unt; 7 typ; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ response > compose > #nlpp > common_bird > odd_bird > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(common_bird,type,
common_bird: $i > $i ).
tff(a,type,
a: $i ).
tff(b,type,
b: $i ).
tff(odd_bird,type,
odd_bird: $i ).
tff(response,type,
response: ( $i * $i ) > $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_46,axiom,
c = compose(a,b),
file(unknown,unknown) ).
tff(f_30,axiom,
! [X,Y,W] : ( response(compose(X,Y),W) = response(X,response(Y,W)) ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [X] : ( response(c,common_bird(X)) = response(X,common_bird(X)) ),
file(unknown,unknown) ).
tff(f_44,axiom,
! [V] : ( response(a,V) != response(odd_bird,V) ),
file(unknown,unknown) ).
tff(c_8,plain,
compose(a,b) = c,
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_35,plain,
! [X_8,Y_9,W_10] : ( response(compose(X_8,Y_9),W_10) = response(X_8,response(Y_9,W_10)) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_52,plain,
! [W_10] : ( response(a,response(b,W_10)) = response(c,W_10) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_35]) ).
tff(c_4,plain,
! [X_4] : ( response(c,common_bird(X_4)) = response(X_4,common_bird(X_4)) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_64,plain,
! [X_12,Y_13] : ( response(X_12,response(Y_13,common_bird(compose(X_12,Y_13)))) = response(c,common_bird(compose(X_12,Y_13))) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_35]) ).
tff(c_6,plain,
! [V_5] : ( response(odd_bird,V_5) != response(a,V_5) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_108,plain,
! [Y_14] : ( response(a,response(Y_14,common_bird(compose(odd_bird,Y_14)))) != response(c,common_bird(compose(odd_bird,Y_14))) ),
inference(superposition,[status(thm),theory(equality)],[c_64,c_6]) ).
tff(c_118,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_52,c_108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : COL052-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % 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.15/0.36 % Computer : n003.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 18:12:38 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.47/1.63 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.47/1.63
% 2.47/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.47/1.65
% 2.47/1.65 Inference rules
% 2.47/1.65 ----------------------
% 2.47/1.65 #Ref : 0
% 2.47/1.65 #Sup : 26
% 2.47/1.65 #Fact : 0
% 2.47/1.65 #Define : 0
% 2.47/1.65 #Split : 0
% 2.47/1.65 #Chain : 0
% 2.47/1.65 #Close : 0
% 2.47/1.65
% 2.47/1.65 Ordering : KBO
% 2.47/1.65
% 2.47/1.65 Simplification rules
% 2.47/1.65 ----------------------
% 2.47/1.65 #Subsume : 0
% 2.47/1.65 #Demod : 7
% 2.47/1.65 #Tautology : 16
% 2.47/1.65 #SimpNegUnit : 0
% 2.47/1.65 #BackRed : 0
% 2.47/1.65
% 2.47/1.65 #Partial instantiations: 0
% 2.47/1.65 #Strategies tried : 1
% 2.47/1.65
% 2.47/1.65 Timing (in seconds)
% 2.47/1.65 ----------------------
% 2.47/1.66 Preprocessing : 0.40
% 2.47/1.66 Parsing : 0.21
% 2.68/1.66 CNF conversion : 0.02
% 2.68/1.66 Main loop : 0.19
% 2.68/1.66 Inferencing : 0.08
% 2.68/1.66 Reduction : 0.05
% 2.68/1.66 Demodulation : 0.04
% 2.68/1.66 BG Simplification : 0.01
% 2.68/1.66 Subsumption : 0.03
% 2.68/1.66 Abstraction : 0.01
% 2.68/1.66 MUC search : 0.00
% 2.68/1.66 Cooper : 0.00
% 2.68/1.66 Total : 0.64
% 2.68/1.66 Index Insertion : 0.00
% 2.68/1.66 Index Deletion : 0.00
% 2.68/1.66 Index Matching : 0.00
% 2.68/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------