TSTP Solution File: COL058-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL058-3 : 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 : n010.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.04s 1.78s
% Output : CNFRefutation 3.20s
% 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 : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 6 ( 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 : 10 (; 10 !; 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_29,axiom,
! [X1,X2] : ( response(response(lark,X1),X2) = response(X1,response(X2,X2)) ),
file(unknown,unknown) ).
tff(f_32,axiom,
response(response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark)))) != response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),
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_29]) ).
tff(c_5,plain,
! [X1_3,X2_4] : ( response(response(lark,X1_3),X2_4) = response(X1_3,response(X2_4,X2_4)) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_198,plain,
! [X1_9,X2_10] : ( response(X1_9,response(response(lark,response(X2_10,X2_10)),X2_10)) = response(response(lark,X1_9),response(X2_10,X2_10)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_5]) ).
tff(c_280,plain,
! [X1_9,X2_2] : ( response(X1_9,response(response(response(lark,lark),X2_2),X2_2)) = response(response(lark,X1_9),response(X2_2,X2_2)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_198]) ).
tff(c_4,plain,
response(response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark)))) != response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_306,plain,
response(response(response(lark,lark),response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))) != response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),
inference(demodulation,[status(thm),theory(equality)],[c_280,c_280,c_4]) ).
tff(c_309,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_2,c_306]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COL058-3 : 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.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 18:03:28 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.04/1.78 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.20/1.78
% 3.20/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.20/1.82
% 3.20/1.82 Inference rules
% 3.20/1.82 ----------------------
% 3.20/1.82 #Ref : 0
% 3.20/1.82 #Sup : 71
% 3.20/1.82 #Fact : 0
% 3.20/1.82 #Define : 0
% 3.20/1.82 #Split : 0
% 3.20/1.82 #Chain : 0
% 3.20/1.82 #Close : 0
% 3.20/1.82
% 3.20/1.82 Ordering : KBO
% 3.20/1.82
% 3.20/1.82 Simplification rules
% 3.20/1.82 ----------------------
% 3.20/1.82 #Subsume : 7
% 3.20/1.82 #Demod : 38
% 3.20/1.82 #Tautology : 18
% 3.20/1.82 #SimpNegUnit : 0
% 3.20/1.82 #BackRed : 1
% 3.20/1.82
% 3.20/1.82 #Partial instantiations: 0
% 3.20/1.82 #Strategies tried : 1
% 3.20/1.82
% 3.20/1.82 Timing (in seconds)
% 3.20/1.82 ----------------------
% 3.20/1.82 Preprocessing : 0.40
% 3.20/1.82 Parsing : 0.22
% 3.20/1.82 CNF conversion : 0.02
% 3.20/1.82 Main loop : 0.33
% 3.20/1.82 Inferencing : 0.13
% 3.20/1.82 Reduction : 0.12
% 3.20/1.82 Demodulation : 0.10
% 3.20/1.82 BG Simplification : 0.02
% 3.20/1.82 Subsumption : 0.05
% 3.20/1.82 Abstraction : 0.02
% 3.20/1.82 MUC search : 0.00
% 3.20/1.82 Cooper : 0.00
% 3.20/1.82 Total : 0.79
% 3.20/1.82 Index Insertion : 0.00
% 3.20/1.82 Index Deletion : 0.00
% 3.20/1.83 Index Matching : 0.00
% 3.20/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------