TSTP Solution File: SET818-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET818-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 : n001.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:03 EDT 2023
% Result : Unsatisfiable 2.20s 1.60s
% Output : CNFRefutation 2.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of formulae : 9 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_in > #nlpp > v_x > tc_IntDef_Oint > c_emptyset
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c_emptyset,type,
c_emptyset: $i ).
tff(tc_IntDef_Oint,type,
tc_IntDef_Oint: $i ).
tff(c_in,type,
c_in: ( $i * $i * $i ) > $o ).
tff(v_x,type,
v_x: $i > $i ).
tff(f_30,axiom,
! [V_U] : c_in(v_x(V_U),V_U,tc_IntDef_Oint),
file(unknown,unknown) ).
tff(f_28,axiom,
! [V_a,T_a] : ~ c_in(V_a,c_emptyset,T_a),
file(unknown,unknown) ).
tff(c_6,plain,
! [V_U_6] : c_in(v_x(V_U_6),V_U_6,tc_IntDef_Oint),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_2,plain,
! [V_a_1,T_a_2] : ~ c_in(V_a_1,c_emptyset,T_a_2),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_11,plain,
$false,
inference(resolution,[status(thm)],[c_6,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET818-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.15/0.36 % Computer : n001.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 17:06:25 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.20/1.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.20/1.61
% 2.20/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.52/1.64
% 2.52/1.64 Inference rules
% 2.52/1.64 ----------------------
% 2.52/1.64 #Ref : 0
% 2.52/1.64 #Sup : 1
% 2.52/1.64 #Fact : 0
% 2.52/1.64 #Define : 0
% 2.52/1.64 #Split : 0
% 2.52/1.64 #Chain : 0
% 2.52/1.64 #Close : 0
% 2.52/1.64
% 2.52/1.64 Ordering : KBO
% 2.52/1.64
% 2.52/1.64 Simplification rules
% 2.52/1.64 ----------------------
% 2.52/1.64 #Subsume : 0
% 2.52/1.64 #Demod : 0
% 2.52/1.64 #Tautology : 0
% 2.52/1.64 #SimpNegUnit : 0
% 2.52/1.64 #BackRed : 0
% 2.52/1.64
% 2.52/1.64 #Partial instantiations: 0
% 2.52/1.64 #Strategies tried : 1
% 2.52/1.64
% 2.52/1.64 Timing (in seconds)
% 2.52/1.64 ----------------------
% 2.52/1.65 Preprocessing : 0.39
% 2.52/1.65 Parsing : 0.21
% 2.52/1.65 CNF conversion : 0.02
% 2.52/1.65 Main loop : 0.11
% 2.52/1.65 Inferencing : 0.05
% 2.52/1.65 Reduction : 0.02
% 2.52/1.65 Demodulation : 0.02
% 2.52/1.65 BG Simplification : 0.01
% 2.52/1.65 Subsumption : 0.02
% 2.52/1.65 Abstraction : 0.00
% 2.52/1.65 MUC search : 0.00
% 2.52/1.65 Cooper : 0.00
% 2.52/1.65 Total : 0.55
% 2.52/1.65 Index Insertion : 0.00
% 2.52/1.65 Index Deletion : 0.00
% 2.52/1.65 Index Matching : 0.00
% 2.52/1.65 BG Taut test : 0.00
%------------------------------------------------------------------------------