TSTP Solution File: SET828-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET828-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 : n019.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:57:06 EDT 2023
% Result : Unsatisfiable 2.26s 1.57s
% Output : CNFRefutation 2.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 18 ( 8 unt; 7 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 3 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > #nlpp > tc_set > v_x > v_Y > v_X > t_a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_x,type,
v_x: $i ).
tff(v_X,type,
v_X: $i ).
tff(tc_set,type,
tc_set: $i > $i ).
tff(t_a,type,
t_a: $i ).
tff(c_lessequals,type,
c_lessequals: ( $i * $i * $i ) > $o ).
tff(c_in,type,
c_in: ( $i * $i * $i ) > $o ).
tff(v_Y,type,
v_Y: $i ).
tff(f_35,axiom,
c_in(v_x,v_X,t_a),
file(unknown,unknown) ).
tff(f_34,axiom,
c_lessequals(v_X,v_Y,tc_set(t_a)),
file(unknown,unknown) ).
tff(f_33,axiom,
! [V_c,V_A,T_a,V_B] :
( ~ c_in(V_c,V_A,T_a)
| ~ c_lessequals(V_A,V_B,tc_set(T_a))
| c_in(V_c,V_B,T_a) ),
file(unknown,unknown) ).
tff(f_37,axiom,
~ c_in(v_x,v_Y,t_a),
file(unknown,unknown) ).
tff(c_6,plain,
c_in(v_x,v_X,t_a),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_4,plain,
c_lessequals(v_X,v_Y,tc_set(t_a)),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_9,plain,
! [V_c_5,V_B_6,T_a_7,V_A_8] :
( c_in(V_c_5,V_B_6,T_a_7)
| ~ c_lessequals(V_A_8,V_B_6,tc_set(T_a_7))
| ~ c_in(V_c_5,V_A_8,T_a_7) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_13,plain,
! [V_c_9] :
( c_in(V_c_9,v_Y,t_a)
| ~ c_in(V_c_9,v_X,t_a) ),
inference(resolution,[status(thm)],[c_4,c_9]) ).
tff(c_8,plain,
~ c_in(v_x,v_Y,t_a),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_16,plain,
~ c_in(v_x,v_X,t_a),
inference(resolution,[status(thm)],[c_13,c_8]) ).
tff(c_20,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET828-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.14/0.36 % Computer : n019.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 16:06:16 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.26/1.57 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.26/1.57
% 2.26/1.57 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.26/1.60
% 2.26/1.60 Inference rules
% 2.26/1.60 ----------------------
% 2.26/1.60 #Ref : 0
% 2.26/1.60 #Sup : 2
% 2.26/1.60 #Fact : 0
% 2.26/1.60 #Define : 0
% 2.26/1.60 #Split : 0
% 2.26/1.60 #Chain : 0
% 2.26/1.60 #Close : 0
% 2.26/1.60
% 2.26/1.60 Ordering : KBO
% 2.26/1.60
% 2.26/1.60 Simplification rules
% 2.26/1.60 ----------------------
% 2.26/1.60 #Subsume : 0
% 2.26/1.60 #Demod : 1
% 2.26/1.60 #Tautology : 0
% 2.26/1.60 #SimpNegUnit : 0
% 2.26/1.60 #BackRed : 0
% 2.26/1.60
% 2.26/1.60 #Partial instantiations: 0
% 2.26/1.60 #Strategies tried : 1
% 2.26/1.60
% 2.26/1.60 Timing (in seconds)
% 2.26/1.60 ----------------------
% 2.26/1.60 Preprocessing : 0.38
% 2.26/1.60 Parsing : 0.21
% 2.26/1.60 CNF conversion : 0.02
% 2.26/1.60 Main loop : 0.14
% 2.26/1.60 Inferencing : 0.08
% 2.26/1.60 Reduction : 0.03
% 2.26/1.60 Demodulation : 0.02
% 2.26/1.60 BG Simplification : 0.01
% 2.26/1.60 Subsumption : 0.02
% 2.26/1.60 Abstraction : 0.00
% 2.26/1.60 MUC search : 0.00
% 2.26/1.60 Cooper : 0.00
% 2.26/1.60 Total : 0.57
% 2.26/1.60 Index Insertion : 0.00
% 2.26/1.60 Index Deletion : 0.00
% 2.26/1.60 Index Matching : 0.00
% 2.26/1.60 BG Taut test : 0.00
%------------------------------------------------------------------------------