TSTP Solution File: COL054-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL054-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/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 : n007.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:55 EDT 2023
% Result : Unsatisfiable 2.65s 1.66s
% Output : CNFRefutation 2.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 16 ( 10 unt; 5 typ; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 5 ( 4 ~; 1 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 20 (; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ response > compose > #nlpp > mocking_bird > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(mocking_bird,type,
mocking_bird: $i ).
tff(b,type,
b: $i ).
tff(response,type,
response: ( $i * $i ) > $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(f_34,axiom,
! [X,Y,W] : ( response(compose(X,Y),W) = response(X,response(Y,W)) ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [Y] : ( response(mocking_bird,Y) = response(Y,Y) ),
file(unknown,unknown) ).
tff(f_46,axiom,
! [X,Y] :
( ( response(a,X) != Y )
| ( response(b,Y) != X ) ),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_2,Y_3,W_4] : ( response(compose(X_2,Y_3),W_4) = response(X_2,response(Y_3,W_4)) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_25,plain,
! [X_9,Y_10,W_11] : ( response(compose(X_9,Y_10),W_11) = response(X_9,response(Y_10,W_11)) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_2,plain,
! [Y_1] : ( response(mocking_bird,Y_1) = response(Y_1,Y_1) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_42,plain,
! [X_12,Y_13] : ( response(X_12,response(Y_13,compose(X_12,Y_13))) = response(mocking_bird,compose(X_12,Y_13)) ),
inference(superposition,[status(thm),theory(equality)],[c_25,c_2]) ).
tff(c_77,plain,
! [X_15,X_16,Y_17] : ( response(X_15,response(X_16,response(Y_17,compose(X_15,compose(X_16,Y_17))))) = response(mocking_bird,compose(X_15,compose(X_16,Y_17))) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_42]) ).
tff(c_6,plain,
! [Y_6] : ( response(a,response(b,Y_6)) != Y_6 ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_92,plain,
! [Y_17] : ( response(mocking_bird,compose(a,compose(b,Y_17))) != response(Y_17,compose(a,compose(b,Y_17))) ),
inference(superposition,[status(thm),theory(equality)],[c_77,c_6]) ).
tff(c_113,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : COL054-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % 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.19/0.36 % Computer : n007.cluster.edu
% 0.19/0.36 % Model : x86_64 x86_64
% 0.19/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.36 % Memory : 8042.1875MB
% 0.19/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.36 % CPULimit : 300
% 0.19/0.36 % WCLimit : 300
% 0.19/0.36 % DateTime : Thu Aug 3 18:01:53 EDT 2023
% 0.19/0.36 % CPUTime :
% 2.65/1.66 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.65/1.67
% 2.65/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.75/1.69
% 2.75/1.69 Inference rules
% 2.75/1.69 ----------------------
% 2.75/1.69 #Ref : 1
% 2.75/1.69 #Sup : 24
% 2.75/1.69 #Fact : 0
% 2.75/1.69 #Define : 0
% 2.75/1.69 #Split : 0
% 2.75/1.69 #Chain : 0
% 2.75/1.69 #Close : 0
% 2.75/1.69
% 2.75/1.69 Ordering : KBO
% 2.75/1.69
% 2.75/1.69 Simplification rules
% 2.75/1.69 ----------------------
% 2.75/1.69 #Subsume : 0
% 2.75/1.69 #Demod : 1
% 2.75/1.69 #Tautology : 11
% 2.75/1.69 #SimpNegUnit : 0
% 2.75/1.69 #BackRed : 0
% 2.75/1.69
% 2.75/1.69 #Partial instantiations: 0
% 2.75/1.69 #Strategies tried : 1
% 2.75/1.69
% 2.75/1.69 Timing (in seconds)
% 2.75/1.69 ----------------------
% 2.75/1.69 Preprocessing : 0.41
% 2.75/1.69 Parsing : 0.21
% 2.75/1.69 CNF conversion : 0.02
% 2.75/1.69 Main loop : 0.21
% 2.75/1.69 Inferencing : 0.09
% 2.75/1.69 Reduction : 0.05
% 2.75/1.69 Demodulation : 0.04
% 2.75/1.69 BG Simplification : 0.01
% 2.75/1.69 Subsumption : 0.04
% 2.75/1.69 Abstraction : 0.01
% 2.75/1.69 MUC search : 0.00
% 2.75/1.69 Cooper : 0.00
% 2.75/1.69 Total : 0.66
% 2.75/1.69 Index Insertion : 0.00
% 2.75/1.69 Index Deletion : 0.00
% 2.75/1.69 Index Matching : 0.00
% 2.75/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------