TSTP Solution File: COL050-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL050-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 : n027.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.71s
% Output : CNFRefutation 2.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 13 ( 9 unt; 4 typ; 0 def)
% Number of atoms : 9 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 13 (; 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ response > compose > #nlpp > mocking_bird > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(mocking_bird,type,
mocking_bird: $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_42,axiom,
! [Y] : ( response(a,Y) != Y ),
file(unknown,unknown) ).
tff(c_25,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_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_11,Y_12] : ( response(X_11,response(Y_12,compose(X_11,Y_12))) = response(mocking_bird,compose(X_11,Y_12)) ),
inference(superposition,[status(thm),theory(equality)],[c_25,c_2]) ).
tff(c_6,plain,
! [Y_5] : ( response(a,Y_5) != Y_5 ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_53,plain,
! [Y_12] : ( response(mocking_bird,compose(a,Y_12)) != response(Y_12,compose(a,Y_12)) ),
inference(superposition,[status(thm),theory(equality)],[c_42,c_6]) ).
tff(c_70,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL050-1 : TPTP v8.1.2. Released v1.0.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.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 18:32:38 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.60/1.71 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.60/1.71
% 2.60/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.72/1.73
% 2.72/1.73 Inference rules
% 2.72/1.73 ----------------------
% 2.72/1.73 #Ref : 1
% 2.72/1.73 #Sup : 14
% 2.72/1.73 #Fact : 0
% 2.72/1.73 #Define : 0
% 2.72/1.73 #Split : 0
% 2.72/1.73 #Chain : 0
% 2.72/1.73 #Close : 0
% 2.72/1.73
% 2.72/1.74 Ordering : KBO
% 2.72/1.74
% 2.72/1.74 Simplification rules
% 2.72/1.74 ----------------------
% 2.72/1.74 #Subsume : 0
% 2.72/1.74 #Demod : 0
% 2.72/1.74 #Tautology : 8
% 2.72/1.74 #SimpNegUnit : 0
% 2.72/1.74 #BackRed : 0
% 2.72/1.74
% 2.72/1.74 #Partial instantiations: 0
% 2.72/1.74 #Strategies tried : 1
% 2.72/1.74
% 2.72/1.74 Timing (in seconds)
% 2.72/1.74 ----------------------
% 2.72/1.74 Preprocessing : 0.40
% 2.72/1.74 Parsing : 0.22
% 2.72/1.74 CNF conversion : 0.02
% 2.72/1.74 Main loop : 0.17
% 2.72/1.74 Inferencing : 0.09
% 2.72/1.74 Reduction : 0.04
% 2.72/1.74 Demodulation : 0.03
% 2.72/1.74 BG Simplification : 0.01
% 2.72/1.74 Subsumption : 0.03
% 2.72/1.74 Abstraction : 0.01
% 2.72/1.74 MUC search : 0.00
% 2.72/1.74 Cooper : 0.00
% 2.72/1.74 Total : 0.61
% 2.72/1.74 Index Insertion : 0.00
% 2.72/1.74 Index Deletion : 0.00
% 2.72/1.74 Index Matching : 0.00
% 2.72/1.74 BG Taut test : 0.00
%------------------------------------------------------------------------------