TSTP Solution File: LCL445-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL445-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 : n012.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:08 EDT 2023
% Result : Unsatisfiable 2.87s 1.72s
% Output : CNFRefutation 3.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 30 ( 12 unt; 10 typ; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 14 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 5 >; 7 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 36 (; 36 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_in > c_insert > c_PropLog_Opl_Oop_A_N_62 > c_PropLog_Othms > #nlpp > tc_PropLog_Opl > v_q > v_p > v_H > t_a > c_PropLog_Opl_Ofalse
%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(c_PropLog_Opl_Ofalse,type,
c_PropLog_Opl_Ofalse: $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_H,type,
v_H: $i ).
tff(tc_PropLog_Opl,type,
tc_PropLog_Opl: $i > $i ).
tff(v_p,type,
v_p: $i ).
tff(c_insert,type,
c_insert: ( $i * $i * $i ) > $i ).
tff(f_29,axiom,
~ c_in(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file(unknown,unknown) ).
tff(f_26,axiom,
c_in(v_q,c_PropLog_Othms(c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
file(unknown,unknown) ).
tff(f_34,axiom,
! [V_q,V_p,V_H,T_a] :
( ~ c_in(V_q,c_PropLog_Othms(c_insert(V_p,V_H,tc_PropLog_Opl(T_a)),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)) ),
file(unknown,unknown) ).
tff(f_27,axiom,
c_in(v_q,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
file(unknown,unknown) ).
tff(f_44,axiom,
! [V_p,V_q,T_a,V_H] : c_in(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(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p,c_PropLog_Opl_Ofalse,T_a),V_q,T_a),V_q,T_a),T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)),
file(unknown,unknown) ).
tff(f_42,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(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_2,plain,
c_in(v_q,c_PropLog_Othms(c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_13,plain,
! [V_p_13,V_q_14,T_a_15,V_H_16] :
( c_in(c_PropLog_Opl_Oop_A_N_62(V_p_13,V_q_14,T_a_15),c_PropLog_Othms(V_H_16,T_a_15),tc_PropLog_Opl(T_a_15))
| ~ c_in(V_q_14,c_PropLog_Othms(c_insert(V_p_13,V_H_16,tc_PropLog_Opl(T_a_15)),T_a_15),tc_PropLog_Opl(T_a_15)) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_21,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(resolution,[status(thm)],[c_2,c_13]) ).
tff(c_4,plain,
c_in(v_q,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_20,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(resolution,[status(thm)],[c_4,c_13]) ).
tff(c_12,plain,
! [V_p_9,V_q_10,T_a_11,V_H_12] : c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p_9,V_q_10,T_a_11),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p_9,c_PropLog_Opl_Ofalse,T_a_11),V_q_10,T_a_11),V_q_10,T_a_11),T_a_11),c_PropLog_Othms(V_H_12,T_a_11),tc_PropLog_Opl(T_a_11)),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_28,plain,
! [V_q_21,V_H_22,T_a_23,V_p_24] :
( c_in(V_q_21,c_PropLog_Othms(V_H_22,T_a_23),tc_PropLog_Opl(T_a_23))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p_24,V_q_21,T_a_23),c_PropLog_Othms(V_H_22,T_a_23),tc_PropLog_Opl(T_a_23))
| ~ c_in(V_p_24,c_PropLog_Othms(V_H_22,T_a_23),tc_PropLog_Opl(T_a_23)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_56,plain,
! [V_p_30,T_a_31,V_q_32,V_H_33] :
( c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p_30,c_PropLog_Opl_Ofalse,T_a_31),V_q_32,T_a_31),V_q_32,T_a_31),c_PropLog_Othms(V_H_33,T_a_31),tc_PropLog_Opl(T_a_31))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p_30,V_q_32,T_a_31),c_PropLog_Othms(V_H_33,T_a_31),tc_PropLog_Opl(T_a_31)) ),
inference(resolution,[status(thm)],[c_12,c_28]) ).
tff(c_10,plain,
! [V_q_8,V_H_6,T_a_7,V_p_5] :
( c_in(V_q_8,c_PropLog_Othms(V_H_6,T_a_7),tc_PropLog_Opl(T_a_7))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p_5,V_q_8,T_a_7),c_PropLog_Othms(V_H_6,T_a_7),tc_PropLog_Opl(T_a_7))
| ~ c_in(V_p_5,c_PropLog_Othms(V_H_6,T_a_7),tc_PropLog_Opl(T_a_7)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_77,plain,
! [V_q_40,V_H_41,T_a_42,V_p_43] :
( c_in(V_q_40,c_PropLog_Othms(V_H_41,T_a_42),tc_PropLog_Opl(T_a_42))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p_43,c_PropLog_Opl_Ofalse,T_a_42),V_q_40,T_a_42),c_PropLog_Othms(V_H_41,T_a_42),tc_PropLog_Opl(T_a_42))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p_43,V_q_40,T_a_42),c_PropLog_Othms(V_H_41,T_a_42),tc_PropLog_Opl(T_a_42)) ),
inference(resolution,[status(thm)],[c_56,c_10]) ).
tff(c_92,plain,
( c_in(v_q,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)) ),
inference(resolution,[status(thm)],[c_20,c_77]) ).
tff(c_106,plain,
c_in(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(demodulation,[status(thm),theory(equality)],[c_21,c_92]) ).
tff(c_108,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL445-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/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.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % 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 13:22:07 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.87/1.72 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.87/1.72
% 2.87/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.00/1.76
% 3.00/1.76 Inference rules
% 3.00/1.76 ----------------------
% 3.00/1.76 #Ref : 0
% 3.00/1.76 #Sup : 17
% 3.00/1.76 #Fact : 0
% 3.00/1.76 #Define : 0
% 3.00/1.76 #Split : 0
% 3.00/1.76 #Chain : 0
% 3.00/1.76 #Close : 0
% 3.00/1.76
% 3.00/1.76 Ordering : KBO
% 3.00/1.76
% 3.00/1.76 Simplification rules
% 3.00/1.76 ----------------------
% 3.00/1.76 #Subsume : 1
% 3.00/1.76 #Demod : 7
% 3.00/1.76 #Tautology : 4
% 3.00/1.76 #SimpNegUnit : 3
% 3.00/1.76 #BackRed : 0
% 3.00/1.76
% 3.00/1.76 #Partial instantiations: 0
% 3.00/1.76 #Strategies tried : 1
% 3.00/1.76
% 3.00/1.76 Timing (in seconds)
% 3.00/1.76 ----------------------
% 3.00/1.77 Preprocessing : 0.42
% 3.00/1.77 Parsing : 0.24
% 3.00/1.77 CNF conversion : 0.02
% 3.00/1.77 Main loop : 0.24
% 3.00/1.77 Inferencing : 0.11
% 3.00/1.77 Reduction : 0.07
% 3.00/1.77 Demodulation : 0.05
% 3.00/1.77 BG Simplification : 0.01
% 3.00/1.77 Subsumption : 0.04
% 3.00/1.77 Abstraction : 0.01
% 3.00/1.77 MUC search : 0.00
% 3.00/1.77 Cooper : 0.00
% 3.00/1.77 Total : 0.72
% 3.00/1.77 Index Insertion : 0.00
% 3.00/1.77 Index Deletion : 0.00
% 3.00/1.77 Index Matching : 0.00
% 3.00/1.77 BG Taut test : 0.00
%------------------------------------------------------------------------------