TSTP Solution File: LCL433-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL433-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 : 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:48:05 EDT 2023
% Result : Unsatisfiable 3.47s 1.88s
% Output : CNFRefutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 33 ( 9 unt; 10 typ; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 41 ( 22 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 6 >; 9 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 53 (; 53 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_in > c_PropLog_Osat > c_insert > c_PropLog_Opl_Oop_A_N_62 > c_PropLog_Othms > #nlpp > tc_PropLog_Opl > v_xa > v_x > v_F > t_a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_x,type,
v_x: $i ).
tff(c_PropLog_Opl_Oop_A_N_62,type,
c_PropLog_Opl_Oop_A_N_62: ( $i * $i * $i ) > $i ).
tff(v_xa,type,
v_xa: $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(v_F,type,
v_F: $i ).
tff(c_insert,type,
c_insert: ( $i * $i * $i ) > $i ).
tff(f_26,axiom,
c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a),
file(unknown,unknown) ).
tff(f_38,axiom,
! [V_p,V_H,T_a,V_q] :
( ~ c_PropLog_Osat(c_insert(V_p,V_H,tc_PropLog_Opl(T_a)),V_q,T_a)
| c_PropLog_Osat(V_H,c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),T_a) ),
file(unknown,unknown) ).
tff(f_58,axiom,
! [V_x,V_B,T_a] : c_in(V_x,c_insert(V_x,V_B,T_a),T_a),
file(unknown,unknown) ).
tff(f_33,axiom,
! [V_U] :
( c_in(V_U,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(v_F,V_U,t_a) ),
file(unknown,unknown) ).
tff(f_43,axiom,
! [V_p,V_H,T_a] :
( ~ c_in(V_p,V_H,tc_PropLog_Opl(T_a))
| c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [V_p,V_G,T_a,V_a] :
( ~ c_in(V_p,c_PropLog_Othms(V_G,T_a),tc_PropLog_Opl(T_a))
| c_in(V_p,c_PropLog_Othms(c_insert(V_a,V_G,tc_PropLog_Opl(T_a)),T_a),tc_PropLog_Opl(T_a)) ),
file(unknown,unknown) ).
tff(f_51,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(f_28,axiom,
~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
file(unknown,unknown) ).
tff(c_2,plain,
c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_24,plain,
! [V_H_27,V_p_28,V_q_29,T_a_30] :
( c_PropLog_Osat(V_H_27,c_PropLog_Opl_Oop_A_N_62(V_p_28,V_q_29,T_a_30),T_a_30)
| ~ c_PropLog_Osat(c_insert(V_p_28,V_H_27,tc_PropLog_Opl(T_a_30)),V_q_29,T_a_30) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_28,plain,
c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(v_x,v_xa,t_a),t_a),
inference(resolution,[status(thm)],[c_2,c_24]) ).
tff(c_16,plain,
! [V_x_17,V_B_18,T_a_19] : c_in(V_x_17,c_insert(V_x_17,V_B_18,T_a_19),T_a_19),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_6,plain,
! [V_U_1] :
( ~ c_PropLog_Osat(v_F,V_U_1,t_a)
| c_in(V_U_1,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a)) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_10,plain,
! [V_p_6,V_H_7,T_a_8] :
( c_in(V_p_6,c_PropLog_Othms(V_H_7,T_a_8),tc_PropLog_Opl(T_a_8))
| ~ c_in(V_p_6,V_H_7,tc_PropLog_Opl(T_a_8)) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_14,plain,
! [V_p_13,V_a_16,V_G_14,T_a_15] :
( c_in(V_p_13,c_PropLog_Othms(c_insert(V_a_16,V_G_14,tc_PropLog_Opl(T_a_15)),T_a_15),tc_PropLog_Opl(T_a_15))
| ~ c_in(V_p_13,c_PropLog_Othms(V_G_14,T_a_15),tc_PropLog_Opl(T_a_15)) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_34,plain,
! [V_q_35,V_H_36,T_a_37,V_p_38] :
( c_in(V_q_35,c_PropLog_Othms(V_H_36,T_a_37),tc_PropLog_Opl(T_a_37))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p_38,V_q_35,T_a_37),c_PropLog_Othms(V_H_36,T_a_37),tc_PropLog_Opl(T_a_37))
| ~ c_in(V_p_38,c_PropLog_Othms(V_H_36,T_a_37),tc_PropLog_Opl(T_a_37)) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_139,plain,
! [T_a_64,V_q_63,V_G_62,V_a_61,V_p_65] :
( c_in(V_q_63,c_PropLog_Othms(c_insert(V_a_61,V_G_62,tc_PropLog_Opl(T_a_64)),T_a_64),tc_PropLog_Opl(T_a_64))
| ~ c_in(V_p_65,c_PropLog_Othms(c_insert(V_a_61,V_G_62,tc_PropLog_Opl(T_a_64)),T_a_64),tc_PropLog_Opl(T_a_64))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p_65,V_q_63,T_a_64),c_PropLog_Othms(V_G_62,T_a_64),tc_PropLog_Opl(T_a_64)) ),
inference(resolution,[status(thm)],[c_14,c_34]) ).
tff(c_221,plain,
! [V_p_98,V_G_96,T_a_99,V_q_100,V_a_97] :
( c_in(V_q_100,c_PropLog_Othms(c_insert(V_a_97,V_G_96,tc_PropLog_Opl(T_a_99)),T_a_99),tc_PropLog_Opl(T_a_99))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p_98,V_q_100,T_a_99),c_PropLog_Othms(V_G_96,T_a_99),tc_PropLog_Opl(T_a_99))
| ~ c_in(V_p_98,c_insert(V_a_97,V_G_96,tc_PropLog_Opl(T_a_99)),tc_PropLog_Opl(T_a_99)) ),
inference(resolution,[status(thm)],[c_10,c_139]) ).
tff(c_259,plain,
! [V_q_106,V_a_107,V_p_108] :
( c_in(V_q_106,c_PropLog_Othms(c_insert(V_a_107,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| ~ c_in(V_p_108,c_insert(V_a_107,v_F,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(V_p_108,V_q_106,t_a),t_a) ),
inference(resolution,[status(thm)],[c_6,c_221]) ).
tff(c_264,plain,
! [V_q_109,V_x_110] :
( c_in(V_q_109,c_PropLog_Othms(c_insert(V_x_110,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(V_x_110,V_q_109,t_a),t_a) ),
inference(resolution,[status(thm)],[c_16,c_259]) ).
tff(c_4,plain,
~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_292,plain,
~ c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(v_x,v_xa,t_a),t_a),
inference(resolution,[status(thm)],[c_264,c_4]) ).
tff(c_304,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_292]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL433-2 : TPTP v8.1.2. Released v3.2.0.
% 0.07/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.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 13:34:29 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.47/1.88 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.47/1.89
% 3.47/1.89 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.47/1.91
% 3.47/1.92 Inference rules
% 3.47/1.92 ----------------------
% 3.47/1.92 #Ref : 0
% 3.47/1.92 #Sup : 63
% 3.47/1.92 #Fact : 0
% 3.47/1.92 #Define : 0
% 3.47/1.92 #Split : 1
% 3.47/1.92 #Chain : 0
% 3.47/1.92 #Close : 0
% 3.47/1.92
% 3.47/1.92 Ordering : KBO
% 3.47/1.92
% 3.47/1.92 Simplification rules
% 3.47/1.92 ----------------------
% 3.47/1.92 #Subsume : 6
% 3.47/1.92 #Demod : 1
% 3.47/1.92 #Tautology : 0
% 3.47/1.92 #SimpNegUnit : 2
% 3.47/1.92 #BackRed : 0
% 3.47/1.92
% 3.47/1.92 #Partial instantiations: 0
% 3.47/1.92 #Strategies tried : 1
% 3.47/1.92
% 3.47/1.92 Timing (in seconds)
% 3.47/1.92 ----------------------
% 3.47/1.92 Preprocessing : 0.44
% 3.47/1.92 Parsing : 0.24
% 3.47/1.92 CNF conversion : 0.02
% 3.47/1.92 Main loop : 0.41
% 3.47/1.92 Inferencing : 0.17
% 3.47/1.92 Reduction : 0.10
% 3.47/1.92 Demodulation : 0.07
% 3.47/1.92 BG Simplification : 0.02
% 3.47/1.92 Subsumption : 0.11
% 3.47/1.92 Abstraction : 0.01
% 3.47/1.92 MUC search : 0.00
% 3.47/1.92 Cooper : 0.00
% 3.47/1.92 Total : 0.90
% 3.47/1.92 Index Insertion : 0.00
% 3.47/1.92 Index Deletion : 0.00
% 3.47/1.92 Index Matching : 0.00
% 3.47/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------