TSTP Solution File: LCL438-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL438-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/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 : n003.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:07 EDT 2023
% Result : Unsatisfiable 2.59s 1.63s
% Output : CNFRefutation 2.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 24 ( 10 unt; 9 typ; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 4 >; 5 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 28 (; 28 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_in > c_PropLog_Opl_Oop_A_N_62 > c_PropLog_Othms > #nlpp > tc_PropLog_Opl > v_q > v_pa > v_p > v_H > t_a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c_PropLog_Opl_Oop_A_N_62,type,
c_PropLog_Opl_Oop_A_N_62: ( $i * $i * $i ) > $i ).
tff(v_q,type,
v_q: $i ).
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(v_pa,type,
v_pa: $i ).
tff(v_H,type,
v_H: $i ).
tff(tc_PropLog_Opl,type,
tc_PropLog_Opl: $i > $i ).
tff(v_p,type,
v_p: $i ).
tff(f_29,axiom,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file(unknown,unknown) ).
tff(f_27,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file(unknown,unknown) ).
tff(f_26,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file(unknown,unknown) ).
tff(f_39,axiom,
! [V_r,T_a,V_H,V_p,V_q] : c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p,c_PropLog_Opl_Oop_A_N_62(V_q,V_r,T_a),T_a),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Opl_Oop_A_N_62(V_p,V_r,T_a),T_a),T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)),
file(unknown,unknown) ).
tff(f_37,axiom,
! [V_p,V_H,T_a,V_q] :
( ~ c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))
| c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ),
file(unknown,unknown) ).
tff(c_6,plain,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_4,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_2,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_21,plain,
! [V_p_14,V_H_16,T_a_18,V_r_17,V_q_15] : c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p_14,c_PropLog_Opl_Oop_A_N_62(V_q_15,V_r_17,T_a_18),T_a_18),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p_14,V_q_15,T_a_18),c_PropLog_Opl_Oop_A_N_62(V_p_14,V_r_17,T_a_18),T_a_18),T_a_18),c_PropLog_Othms(V_H_16,T_a_18),tc_PropLog_Opl(T_a_18)),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_8,plain,
! [V_q_4,V_H_2,T_a_3,V_p_1] :
( c_in(V_q_4,c_PropLog_Othms(V_H_2,T_a_3),tc_PropLog_Opl(T_a_3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p_1,V_q_4,T_a_3),c_PropLog_Othms(V_H_2,T_a_3),tc_PropLog_Opl(T_a_3))
| ~ c_in(V_p_1,c_PropLog_Othms(V_H_2,T_a_3),tc_PropLog_Opl(T_a_3)) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_26,plain,
! [V_r_23,V_q_22,T_a_21,V_p_19,V_H_20] :
( c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p_19,V_q_22,T_a_21),c_PropLog_Opl_Oop_A_N_62(V_p_19,V_r_23,T_a_21),T_a_21),c_PropLog_Othms(V_H_20,T_a_21),tc_PropLog_Opl(T_a_21))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p_19,c_PropLog_Opl_Oop_A_N_62(V_q_22,V_r_23,T_a_21),T_a_21),c_PropLog_Othms(V_H_20,T_a_21),tc_PropLog_Opl(T_a_21)) ),
inference(resolution,[status(thm)],[c_21,c_8]) ).
tff(c_31,plain,
! [T_a_26,V_H_28,V_p_24,V_q_27,V_r_25] :
( c_in(c_PropLog_Opl_Oop_A_N_62(V_p_24,V_r_25,T_a_26),c_PropLog_Othms(V_H_28,T_a_26),tc_PropLog_Opl(T_a_26))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p_24,V_q_27,T_a_26),c_PropLog_Othms(V_H_28,T_a_26),tc_PropLog_Opl(T_a_26))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p_24,c_PropLog_Opl_Oop_A_N_62(V_q_27,V_r_25,T_a_26),T_a_26),c_PropLog_Othms(V_H_28,T_a_26),tc_PropLog_Opl(T_a_26)) ),
inference(resolution,[status(thm)],[c_26,c_8]) ).
tff(c_40,plain,
( c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ),
inference(resolution,[status(thm)],[c_2,c_31]) ).
tff(c_45,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_40]) ).
tff(c_47,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL438-2 : TPTP v8.1.2. Released v3.2.0.
% 0.13/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.36 % Computer : n003.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:32:23 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.59/1.63 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.59/1.63
% 2.59/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.81/1.67
% 2.81/1.67 Inference rules
% 2.81/1.67 ----------------------
% 2.81/1.67 #Ref : 0
% 2.81/1.67 #Sup : 7
% 2.81/1.67 #Fact : 0
% 2.81/1.67 #Define : 0
% 2.81/1.67 #Split : 1
% 2.81/1.67 #Chain : 0
% 2.81/1.67 #Close : 0
% 2.81/1.67
% 2.81/1.67 Ordering : KBO
% 2.81/1.67
% 2.81/1.67 Simplification rules
% 2.81/1.67 ----------------------
% 2.81/1.67 #Subsume : 1
% 2.81/1.67 #Demod : 1
% 2.81/1.67 #Tautology : 0
% 2.81/1.67 #SimpNegUnit : 1
% 2.81/1.67 #BackRed : 0
% 2.81/1.67
% 2.81/1.67 #Partial instantiations: 0
% 2.81/1.67 #Strategies tried : 1
% 2.81/1.67
% 2.81/1.67 Timing (in seconds)
% 2.81/1.67 ----------------------
% 2.81/1.67 Preprocessing : 0.40
% 2.81/1.67 Parsing : 0.22
% 2.81/1.67 CNF conversion : 0.02
% 2.81/1.67 Main loop : 0.19
% 2.81/1.67 Inferencing : 0.08
% 2.81/1.67 Reduction : 0.04
% 2.81/1.67 Demodulation : 0.03
% 2.81/1.67 BG Simplification : 0.01
% 2.81/1.67 Subsumption : 0.03
% 2.81/1.67 Abstraction : 0.01
% 2.81/1.67 MUC search : 0.00
% 2.81/1.67 Cooper : 0.00
% 2.81/1.67 Total : 0.64
% 2.81/1.67 Index Insertion : 0.00
% 2.81/1.67 Index Deletion : 0.00
% 2.81/1.67 Index Matching : 0.00
% 2.81/1.67 BG Taut test : 0.00
%------------------------------------------------------------------------------