TSTP Solution File: COL116-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL116-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 : n031.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:35:08 EDT 2023
% Result : Unsatisfiable 2.53s 1.66s
% Output : CNFRefutation 2.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 11
% Syntax : Number of formulae : 14 ( 5 unt; 9 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 : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 4 >; 7 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-4 aty)
% Number of variables : 4 (; 4 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_in > c_Pair > tc_prod > c_Comb_Ocomb_Oop_A_D_D > #nlpp > v_z > v_yb > v_xb > tc_Comb_Ocomb > c_Comb_Oparcontract
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_z,type,
v_z: $i ).
tff(tc_prod,type,
tc_prod: ( $i * $i ) > $i ).
tff(c_in,type,
c_in: ( $i * $i * $i ) > $o ).
tff(v_yb,type,
v_yb: $i ).
tff(c_Comb_Oparcontract,type,
c_Comb_Oparcontract: $i ).
tff(c_Pair,type,
c_Pair: ( $i * $i * $i * $i ) > $i ).
tff(c_Comb_Ocomb_Oop_A_D_D,type,
c_Comb_Ocomb_Oop_A_D_D: ( $i * $i ) > $i ).
tff(tc_Comb_Ocomb,type,
tc_Comb_Ocomb: $i ).
tff(v_xb,type,
v_xb: $i ).
tff(f_30,axiom,
! [V_x] : c_in(c_Pair(V_x,V_x,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file(unknown,unknown) ).
tff(f_28,axiom,
! [V_U] : ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(v_xb,v_z),c_Comb_Ocomb_Oop_A_D_D(v_yb,v_z)),V_U,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file(unknown,unknown) ).
tff(c_4,plain,
! [V_x_2] : c_in(c_Pair(V_x_2,V_x_2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_6,plain,
! [V_U_4] : ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(v_xb,v_z),c_Comb_Ocomb_Oop_A_D_D(v_yb,v_z)),V_U_4,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_11,plain,
$false,
inference(resolution,[status(thm)],[c_4,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : COL116-2 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.15 % 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.37 % Computer : n031.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 18:37:00 EDT 2023
% 0.15/0.37 % CPUTime :
% 2.53/1.66 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.55/1.66
% 2.55/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.55/1.69
% 2.55/1.69 Inference rules
% 2.55/1.69 ----------------------
% 2.55/1.69 #Ref : 0
% 2.55/1.69 #Sup : 1
% 2.55/1.69 #Fact : 0
% 2.55/1.69 #Define : 0
% 2.55/1.69 #Split : 0
% 2.55/1.69 #Chain : 0
% 2.55/1.69 #Close : 0
% 2.55/1.69
% 2.55/1.69 Ordering : KBO
% 2.55/1.69
% 2.55/1.69 Simplification rules
% 2.55/1.69 ----------------------
% 2.55/1.69 #Subsume : 0
% 2.55/1.69 #Demod : 0
% 2.55/1.69 #Tautology : 0
% 2.55/1.69 #SimpNegUnit : 0
% 2.55/1.69 #BackRed : 0
% 2.55/1.69
% 2.55/1.69 #Partial instantiations: 0
% 2.55/1.69 #Strategies tried : 1
% 2.55/1.69
% 2.55/1.69 Timing (in seconds)
% 2.55/1.69 ----------------------
% 2.55/1.70 Preprocessing : 0.39
% 2.55/1.70 Parsing : 0.21
% 2.55/1.70 CNF conversion : 0.02
% 2.55/1.70 Main loop : 0.10
% 2.55/1.70 Inferencing : 0.05
% 2.55/1.70 Reduction : 0.02
% 2.55/1.70 Demodulation : 0.02
% 2.55/1.70 BG Simplification : 0.01
% 2.55/1.70 Subsumption : 0.02
% 2.55/1.70 Abstraction : 0.00
% 2.55/1.70 MUC search : 0.00
% 2.55/1.70 Cooper : 0.00
% 2.55/1.70 Total : 0.55
% 2.55/1.70 Index Insertion : 0.00
% 2.55/1.70 Index Deletion : 0.00
% 2.55/1.70 Index Matching : 0.00
% 2.55/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------