TSTP Solution File: LCL432-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL432-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n013.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:48:05 EDT 2023
% Result : Unsatisfiable 2.19s 1.58s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 15 ( 6 unt; 7 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 4 >; 5 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 4 (; 4 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_in > c_PropLog_Osat > c_PropLog_Othms > #nlpp > tc_PropLog_Opl > v_x > t_a > c_emptyset
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_x,type,
v_x: $i ).
tff(c_emptyset,type,
c_emptyset: $i ).
tff(c_PropLog_Osat,type,
c_PropLog_Osat: ( $i * $i * $i ) > $o ).
tff(t_a,type,
t_a: $i ).
tff(c_PropLog_Othms,type,
c_PropLog_Othms: ( $i * $i ) > $i ).
tff(c_in,type,
c_in: ( $i * $i * $i ) > $o ).
tff(tc_PropLog_Opl,type,
tc_PropLog_Opl: $i > $i ).
tff(f_26,axiom,
c_PropLog_Osat(c_emptyset,v_x,t_a),
file(unknown,unknown) ).
tff(f_33,axiom,
! [V_p,T_a] :
( ~ c_PropLog_Osat(c_emptyset,V_p,T_a)
| c_in(V_p,c_PropLog_Othms(c_emptyset,T_a),tc_PropLog_Opl(T_a)) ),
file(unknown,unknown) ).
tff(f_28,axiom,
~ c_in(v_x,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)),
file(unknown,unknown) ).
tff(c_2,plain,
c_PropLog_Osat(c_emptyset,v_x,t_a),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_7,plain,
! [V_p_3,T_a_4] :
( c_in(V_p_3,c_PropLog_Othms(c_emptyset,T_a_4),tc_PropLog_Opl(T_a_4))
| ~ c_PropLog_Osat(c_emptyset,V_p_3,T_a_4) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_4,plain,
~ c_in(v_x,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_10,plain,
~ c_PropLog_Osat(c_emptyset,v_x,t_a),
inference(resolution,[status(thm)],[c_7,c_4]) ).
tff(c_14,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LCL432-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 13:25:33 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.19/1.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.50/1.58
% 2.50/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.50/1.62
% 2.50/1.62 Inference rules
% 2.50/1.62 ----------------------
% 2.50/1.62 #Ref : 0
% 2.50/1.62 #Sup : 1
% 2.50/1.62 #Fact : 0
% 2.50/1.62 #Define : 0
% 2.50/1.62 #Split : 0
% 2.50/1.62 #Chain : 0
% 2.50/1.62 #Close : 0
% 2.50/1.62
% 2.50/1.62 Ordering : KBO
% 2.50/1.62
% 2.50/1.62 Simplification rules
% 2.50/1.62 ----------------------
% 2.50/1.62 #Subsume : 0
% 2.50/1.62 #Demod : 1
% 2.50/1.62 #Tautology : 0
% 2.50/1.62 #SimpNegUnit : 0
% 2.50/1.62 #BackRed : 0
% 2.50/1.62
% 2.50/1.62 #Partial instantiations: 0
% 2.50/1.62 #Strategies tried : 1
% 2.50/1.62
% 2.50/1.62 Timing (in seconds)
% 2.50/1.62 ----------------------
% 2.50/1.62 Preprocessing : 0.38
% 2.50/1.62 Parsing : 0.21
% 2.50/1.62 CNF conversion : 0.02
% 2.50/1.62 Main loop : 0.11
% 2.50/1.62 Inferencing : 0.05
% 2.50/1.62 Reduction : 0.02
% 2.50/1.62 Demodulation : 0.02
% 2.50/1.62 BG Simplification : 0.01
% 2.50/1.62 Subsumption : 0.02
% 2.50/1.62 Abstraction : 0.00
% 2.50/1.62 MUC search : 0.00
% 2.50/1.62 Cooper : 0.00
% 2.50/1.62 Total : 0.55
% 2.50/1.62 Index Insertion : 0.00
% 2.50/1.62 Index Deletion : 0.00
% 2.50/1.62 Index Matching : 0.00
% 2.50/1.62 BG Taut test : 0.00
%------------------------------------------------------------------------------