TSTP Solution File: SWV254-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV254-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 : n009.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 11:03:22 EDT 2023
% Result : Unsatisfiable 2.14s 1.58s
% Output : CNFRefutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of formulae : 26 ( 14 unt; 9 typ; 0 def)
% Number of atoms : 22 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 6 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 21 (; 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > class_Orderings_Oorder > c_insert > c_SetInterval_OatLeastLessThan > #nlpp > v_x > c_Suc > v_nat > tc_nat > c_emptyset
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c_emptyset,type,
c_emptyset: $i ).
tff(class_Orderings_Oorder,type,
class_Orderings_Oorder: $i > $o ).
tff(c_Suc,type,
c_Suc: $i > $i ).
tff(c_lessequals,type,
c_lessequals: ( $i * $i * $i ) > $o ).
tff(v_nat,type,
v_nat: $i ).
tff(tc_nat,type,
tc_nat: $i ).
tff(c_SetInterval_OatLeastLessThan,type,
c_SetInterval_OatLeastLessThan: ( $i * $i * $i ) > $i ).
tff(v_x,type,
v_x: $i > $i ).
tff(c_insert,type,
c_insert: ( $i * $i * $i ) > $i ).
tff(f_38,axiom,
! [V_a,V_A,T_a] : ( c_emptyset != c_insert(V_a,V_A,T_a) ),
file(unknown,unknown) ).
tff(f_43,axiom,
class_Orderings_Oorder(tc_nat),
file(unknown,unknown) ).
tff(f_42,axiom,
! [V_U] : ( v_x(V_U) = v_nat ),
file(unknown,unknown) ).
tff(f_40,axiom,
! [V_U] : c_lessequals(V_U,v_x(V_U),tc_nat),
file(unknown,unknown) ).
tff(f_33,axiom,
! [T_a,V_n,V_m] :
( ~ class_Orderings_Oorder(T_a)
| ~ c_lessequals(V_n,V_m,T_a)
| ( c_SetInterval_OatLeastLessThan(V_m,V_n,T_a) = c_emptyset ) ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [V_m] : ( c_SetInterval_OatLeastLessThan(V_m,c_Suc(V_m),tc_nat) = c_insert(V_m,c_emptyset,tc_nat) ),
file(unknown,unknown) ).
tff(c_6,plain,
! [V_a_5,V_A_6,T_a_7] : ( c_insert(V_a_5,V_A_6,T_a_7) != c_emptyset ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_12,plain,
class_Orderings_Oorder(tc_nat),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_10,plain,
! [V_U_9] : ( v_x(V_U_9) = v_nat ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_8,plain,
! [V_U_8] : c_lessequals(V_U_8,v_x(V_U_8),tc_nat),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_13,plain,
! [V_U_8] : c_lessequals(V_U_8,v_nat,tc_nat),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_8]) ).
tff(c_32,plain,
! [V_m_16,V_n_17,T_a_18] :
( ( c_SetInterval_OatLeastLessThan(V_m_16,V_n_17,T_a_18) = c_emptyset )
| ~ c_lessequals(V_n_17,V_m_16,T_a_18)
| ~ class_Orderings_Oorder(T_a_18) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_35,plain,
! [V_U_8] :
( ( c_SetInterval_OatLeastLessThan(v_nat,V_U_8,tc_nat) = c_emptyset )
| ~ class_Orderings_Oorder(tc_nat) ),
inference(resolution,[status(thm)],[c_13,c_32]) ).
tff(c_39,plain,
! [V_U_19] : ( c_SetInterval_OatLeastLessThan(v_nat,V_U_19,tc_nat) = c_emptyset ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_35]) ).
tff(c_4,plain,
! [V_m_4] : ( c_SetInterval_OatLeastLessThan(V_m_4,c_Suc(V_m_4),tc_nat) = c_insert(V_m_4,c_emptyset,tc_nat) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_45,plain,
c_insert(v_nat,c_emptyset,tc_nat) = c_emptyset,
inference(superposition,[status(thm),theory(equality)],[c_39,c_4]) ).
tff(c_54,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV254-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.35 % Computer : n009.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 22:59:38 EDT 2023
% 0.15/0.35 % CPUTime :
% 2.14/1.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.14/1.59
% 2.14/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.62/1.61
% 2.62/1.61 Inference rules
% 2.62/1.61 ----------------------
% 2.62/1.61 #Ref : 0
% 2.62/1.61 #Sup : 9
% 2.62/1.61 #Fact : 0
% 2.62/1.61 #Define : 0
% 2.62/1.61 #Split : 0
% 2.62/1.61 #Chain : 0
% 2.62/1.61 #Close : 0
% 2.62/1.61
% 2.62/1.61 Ordering : KBO
% 2.62/1.61
% 2.62/1.61 Simplification rules
% 2.62/1.61 ----------------------
% 2.62/1.61 #Subsume : 0
% 2.62/1.61 #Demod : 2
% 2.62/1.61 #Tautology : 5
% 2.62/1.61 #SimpNegUnit : 1
% 2.62/1.61 #BackRed : 0
% 2.62/1.62
% 2.62/1.62 #Partial instantiations: 0
% 2.62/1.62 #Strategies tried : 1
% 2.62/1.62
% 2.62/1.62 Timing (in seconds)
% 2.62/1.62 ----------------------
% 2.62/1.62 Preprocessing : 0.40
% 2.62/1.62 Parsing : 0.23
% 2.62/1.62 CNF conversion : 0.02
% 2.62/1.62 Main loop : 0.16
% 2.62/1.62 Inferencing : 0.08
% 2.62/1.62 Reduction : 0.04
% 2.62/1.62 Demodulation : 0.03
% 2.62/1.62 BG Simplification : 0.01
% 2.62/1.62 Subsumption : 0.02
% 2.62/1.62 Abstraction : 0.01
% 2.62/1.62 MUC search : 0.00
% 2.62/1.62 Cooper : 0.00
% 2.62/1.62 Total : 0.60
% 2.62/1.62 Index Insertion : 0.00
% 2.62/1.62 Index Deletion : 0.00
% 2.62/1.62 Index Matching : 0.00
% 2.62/1.62 BG Taut test : 0.00
%------------------------------------------------------------------------------