TSTP Solution File: COL051-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL051-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 : n012.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.60s 1.60s
% Output : CNFRefutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 14 ( 11 unt; 3 typ; 0 def)
% Number of atoms : 11 ( 10 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 15 (; 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ response > compose > #nlpp > mocking_bird
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(mocking_bird,type,
mocking_bird: $i ).
tff(response,type,
response: ( $i * $i ) > $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(f_28,axiom,
! [Y] : ( response(mocking_bird,Y) = response(Y,Y) ),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X,Y,W] : ( response(compose(X,Y),W) = response(X,response(Y,W)) ),
file(unknown,unknown) ).
tff(f_40,axiom,
! [X] : ( response(X,X) != X ),
file(unknown,unknown) ).
tff(c_2,plain,
! [Y_1] : ( response(mocking_bird,Y_1) = response(Y_1,Y_1) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_32,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_63,plain,
! [X_14,Y_15] : ( response(X_14,response(Y_15,compose(X_14,Y_15))) = response(mocking_bird,compose(X_14,Y_15)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_32]) ).
tff(c_8,plain,
! [Y_7] : ( response(mocking_bird,Y_7) = response(Y_7,Y_7) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_6,plain,
! [X_5] : ( response(X_5,X_5) != X_5 ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_17,plain,
! [Y_7] : ( response(mocking_bird,Y_7) != Y_7 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_6]) ).
tff(c_74,plain,
! [Y_15] : ( response(mocking_bird,compose(mocking_bird,Y_15)) != response(Y_15,compose(mocking_bird,Y_15)) ),
inference(superposition,[status(thm),theory(equality)],[c_63,c_17]) ).
tff(c_91,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_74]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COL051-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % 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.15/0.35 % Computer : n012.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 18:08:22 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.60/1.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.60/1.60
% 2.60/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.62/1.63
% 2.62/1.63 Inference rules
% 2.62/1.63 ----------------------
% 2.62/1.63 #Ref : 1
% 2.62/1.63 #Sup : 19
% 2.62/1.63 #Fact : 0
% 2.62/1.63 #Define : 0
% 2.62/1.63 #Split : 0
% 2.62/1.63 #Chain : 0
% 2.62/1.63 #Close : 0
% 2.62/1.63
% 2.62/1.63 Ordering : KBO
% 2.62/1.63
% 2.62/1.63 Simplification rules
% 2.62/1.63 ----------------------
% 2.62/1.63 #Subsume : 2
% 2.62/1.63 #Demod : 1
% 2.62/1.63 #Tautology : 8
% 2.62/1.63 #SimpNegUnit : 0
% 2.62/1.63 #BackRed : 1
% 2.62/1.63
% 2.62/1.63 #Partial instantiations: 0
% 2.62/1.63 #Strategies tried : 1
% 2.62/1.63
% 2.62/1.63 Timing (in seconds)
% 2.62/1.63 ----------------------
% 2.62/1.64 Preprocessing : 0.39
% 2.62/1.64 Parsing : 0.21
% 2.62/1.64 CNF conversion : 0.02
% 2.62/1.64 Main loop : 0.18
% 2.62/1.64 Inferencing : 0.08
% 2.62/1.64 Reduction : 0.05
% 2.62/1.64 Demodulation : 0.03
% 2.62/1.64 BG Simplification : 0.01
% 2.62/1.64 Subsumption : 0.04
% 2.62/1.64 Abstraction : 0.01
% 2.62/1.64 MUC search : 0.00
% 2.62/1.64 Cooper : 0.00
% 2.62/1.64 Total : 0.62
% 2.62/1.64 Index Insertion : 0.00
% 2.62/1.64 Index Deletion : 0.00
% 2.62/1.64 Index Matching : 0.00
% 2.62/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------