TSTP Solution File: COL058-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL058-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 : n011.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 3.86s 2.00s
% Output : CNFRefutation 3.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 9 unt; 2 typ; 0 def)
% Number of atoms : 9 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 11 (; 11 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ response > #nlpp > lark
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(response,type,
response: ( $i * $i ) > $i ).
tff(lark,type,
lark: $i ).
tff(f_27,axiom,
! [X1,X2] : ( response(response(lark,X1),X2) = response(X1,response(X2,X2)) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X] : ( response(X,X) != X ),
file(unknown,unknown) ).
tff(c_2,plain,
! [X1_1,X2_2] : ( response(response(lark,X1_1),X2_2) = response(X1_1,response(X2_2,X2_2)) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_6,plain,
! [X1_5,X2_6] : ( response(response(lark,X1_5),X2_6) = response(X1_5,response(X2_6,X2_6)) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_4,plain,
! [X_3] : ( response(X_3,X_3) != X_3 ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_43,plain,
! [X2_7] : ( response(response(lark,response(X2_7,X2_7)),X2_7) != response(X2_7,X2_7) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_61,plain,
! [X2_8] : ( response(response(response(lark,lark),X2_8),X2_8) != response(X2_8,X2_8) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_43]) ).
tff(c_65,plain,
! [X2_2] : ( response(response(response(lark,response(lark,lark)),X2_2),response(X2_2,X2_2)) != response(response(X2_2,X2_2),response(X2_2,X2_2)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_61]) ).
tff(c_1154,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : COL058-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.15/0.37 % Computer : n011.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 18:14:36 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.86/2.00 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.86/2.01
% 3.86/2.01 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.86/2.04
% 3.86/2.04 Inference rules
% 3.86/2.04 ----------------------
% 3.86/2.04 #Ref : 1
% 3.86/2.04 #Sup : 248
% 3.86/2.04 #Fact : 0
% 3.86/2.04 #Define : 0
% 3.86/2.04 #Split : 0
% 3.86/2.04 #Chain : 0
% 3.86/2.04 #Close : 0
% 3.86/2.04
% 3.86/2.04 Ordering : KBO
% 3.86/2.04
% 3.86/2.04 Simplification rules
% 3.86/2.04 ----------------------
% 3.86/2.04 #Subsume : 71
% 3.86/2.04 #Demod : 411
% 3.86/2.04 #Tautology : 27
% 3.86/2.04 #SimpNegUnit : 0
% 3.86/2.04 #BackRed : 0
% 3.86/2.04
% 3.86/2.04 #Partial instantiations: 0
% 3.86/2.04 #Strategies tried : 1
% 3.86/2.04
% 3.86/2.04 Timing (in seconds)
% 3.86/2.04 ----------------------
% 3.86/2.05 Preprocessing : 0.37
% 3.86/2.05 Parsing : 0.19
% 3.86/2.05 CNF conversion : 0.02
% 3.86/2.05 Main loop : 0.60
% 3.86/2.05 Inferencing : 0.19
% 3.86/2.05 Reduction : 0.28
% 3.86/2.05 Demodulation : 0.24
% 3.86/2.05 BG Simplification : 0.02
% 3.86/2.05 Subsumption : 0.08
% 3.86/2.05 Abstraction : 0.03
% 3.86/2.05 MUC search : 0.00
% 3.86/2.05 Cooper : 0.00
% 3.86/2.05 Total : 1.01
% 3.86/2.05 Index Insertion : 0.00
% 3.86/2.05 Index Deletion : 0.00
% 3.86/2.05 Index Matching : 0.00
% 3.86/2.05 BG Taut test : 0.00
%------------------------------------------------------------------------------