TSTP Solution File: SYN345-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN345-1 : TPTP v8.1.2. Released v1.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 : n018.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:10:32 EDT 2023
% Result : Unsatisfiable 2.62s 1.64s
% Output : CNFRefutation 2.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 43 ( 19 unt; 4 typ; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 65 ( 31 ~; 34 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 44 (; 44 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > z > #nlpp > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(f,type,
f: ( $i * $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(z,type,
z: ( $i * $i ) > $i ).
tff(f_86,axiom,
! [Y1] :
( ~ f(b,b,Y1)
| ~ f(a,a,b)
| ~ f(a,b,b) ),
file(unknown,unknown) ).
tff(f_48,axiom,
! [Y1,Y2] :
( f(b,Y1,Y2)
| f(a,a,b)
| ~ f(a,b,b) ),
file(unknown,unknown) ).
tff(f_62,axiom,
! [Y1,Y2] :
( f(Y1,Y2,z(Y1,Y2))
| f(a,a,b)
| f(a,b,b) ),
file(unknown,unknown) ).
tff(f_77,axiom,
! [Y1] :
( ~ f(b,b,Y1)
| f(a,a,b)
| f(a,b,b) ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [Y1,Y2] :
( ~ f(Y1,z(Y1,Y2),z(Y1,Y2))
| f(a,a,b)
| ~ f(a,b,b) ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [Y1] :
( f(a,b,Y1)
| ~ f(a,a,b)
| f(a,b,b) ),
file(unknown,unknown) ).
tff(f_70,axiom,
! [Y1,Y2] :
( f(Y1,Y2,z(Y1,Y2))
| ~ f(a,a,b)
| ~ f(a,b,b) ),
file(unknown,unknown) ).
tff(c_16,plain,
! [Y1_13] :
( ~ f(a,b,b)
| ~ f(a,a,b)
| ~ f(b,b,Y1_13) ),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_17,plain,
~ f(a,a,b),
inference(splitLeft,[status(thm)],[c_16]) ).
tff(c_6,plain,
! [Y1_4,Y2_5] :
( ~ f(a,b,b)
| f(a,a,b)
| f(b,Y1_4,Y2_5) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_21,plain,
! [Y1_4,Y2_5] :
( ~ f(a,b,b)
| f(b,Y1_4,Y2_5) ),
inference(negUnitSimplification,[status(thm)],[c_17,c_6]) ).
tff(c_22,plain,
~ f(a,b,b),
inference(splitLeft,[status(thm)],[c_21]) ).
tff(c_10,plain,
! [Y1_8,Y2_9] :
( f(a,b,b)
| f(a,a,b)
| f(Y1_8,Y2_9,z(Y1_8,Y2_9)) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_26,plain,
! [Y1_15,Y2_16] : f(Y1_15,Y2_16,z(Y1_15,Y2_16)),
inference(negUnitSimplification,[status(thm)],[c_17,c_22,c_10]) ).
tff(c_14,plain,
! [Y1_12] :
( f(a,b,b)
| f(a,a,b)
| ~ f(b,b,Y1_12) ),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_18,plain,
! [Y1_12] :
( f(a,b,b)
| ~ f(b,b,Y1_12) ),
inference(negUnitSimplification,[status(thm)],[c_17,c_14]) ).
tff(c_19,plain,
! [Y1_12] : ~ f(b,b,Y1_12),
inference(splitLeft,[status(thm)],[c_18]) ).
tff(c_31,plain,
$false,
inference(resolution,[status(thm)],[c_26,c_19]) ).
tff(c_32,plain,
! [Y1_4,Y2_5] : f(b,Y1_4,Y2_5),
inference(splitRight,[status(thm)],[c_21]) ).
tff(c_36,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_32,c_19]) ).
tff(c_37,plain,
f(a,b,b),
inference(splitRight,[status(thm)],[c_18]) ).
tff(c_39,plain,
! [Y1_4,Y2_5] :
( f(a,a,b)
| f(b,Y1_4,Y2_5) ),
inference(demodulation,[status(thm),theory(equality)],[c_37,c_6]) ).
tff(c_40,plain,
! [Y1_4,Y2_5] : f(b,Y1_4,Y2_5),
inference(negUnitSimplification,[status(thm)],[c_17,c_39]) ).
tff(c_8,plain,
! [Y1_6,Y2_7] :
( ~ f(a,b,b)
| f(a,a,b)
| ~ f(Y1_6,z(Y1_6,Y2_7),z(Y1_6,Y2_7)) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_49,plain,
! [Y1_6,Y2_7] :
( f(a,a,b)
| ~ f(Y1_6,z(Y1_6,Y2_7),z(Y1_6,Y2_7)) ),
inference(demodulation,[status(thm),theory(equality)],[c_37,c_8]) ).
tff(c_51,plain,
! [Y1_19,Y2_20] : ~ f(Y1_19,z(Y1_19,Y2_20),z(Y1_19,Y2_20)),
inference(negUnitSimplification,[status(thm)],[c_17,c_49]) ).
tff(c_56,plain,
$false,
inference(resolution,[status(thm)],[c_40,c_51]) ).
tff(c_58,plain,
f(a,a,b),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_2,plain,
! [Y1_1] :
( f(a,b,b)
| ~ f(a,a,b)
| f(a,b,Y1_1) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_60,plain,
! [Y1_1] :
( f(a,b,b)
| f(a,b,Y1_1) ),
inference(demodulation,[status(thm),theory(equality)],[c_58,c_2]) ).
tff(c_61,plain,
f(a,b,b),
inference(splitLeft,[status(thm)],[c_60]) ).
tff(c_12,plain,
! [Y1_10,Y2_11] :
( ~ f(a,b,b)
| ~ f(a,a,b)
| f(Y1_10,Y2_11,z(Y1_10,Y2_11)) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_70,plain,
! [Y1_22,Y2_23] : f(Y1_22,Y2_23,z(Y1_22,Y2_23)),
inference(demodulation,[status(thm),theory(equality)],[c_58,c_61,c_12]) ).
tff(c_57,plain,
! [Y1_13] :
( ~ f(a,b,b)
| ~ f(b,b,Y1_13) ),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_63,plain,
! [Y1_13] : ~ f(b,b,Y1_13),
inference(demodulation,[status(thm),theory(equality)],[c_61,c_57]) ).
tff(c_75,plain,
$false,
inference(resolution,[status(thm)],[c_70,c_63]) ).
tff(c_76,plain,
! [Y1_1] : f(a,b,Y1_1),
inference(splitRight,[status(thm)],[c_60]) ).
tff(c_77,plain,
~ f(a,b,b),
inference(splitRight,[status(thm)],[c_60]) ).
tff(c_80,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_76,c_77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN345-1 : TPTP v8.1.2. Released v1.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 : n018.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 17:26:20 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.62/1.64 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.62/1.64
% 2.62/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.75/1.68
% 2.75/1.68 Inference rules
% 2.75/1.68 ----------------------
% 2.75/1.68 #Ref : 0
% 2.75/1.68 #Sup : 3
% 2.75/1.68 #Fact : 0
% 2.75/1.68 #Define : 0
% 2.75/1.68 #Split : 4
% 2.75/1.68 #Chain : 0
% 2.75/1.68 #Close : 0
% 2.75/1.68
% 2.75/1.68 Ordering : KBO
% 2.75/1.68
% 2.75/1.68 Simplification rules
% 2.75/1.68 ----------------------
% 2.75/1.68 #Subsume : 7
% 2.75/1.68 #Demod : 16
% 2.75/1.68 #Tautology : 2
% 2.75/1.68 #SimpNegUnit : 8
% 2.75/1.68 #BackRed : 1
% 2.75/1.68
% 2.75/1.68 #Partial instantiations: 0
% 2.75/1.68 #Strategies tried : 1
% 2.75/1.68
% 2.75/1.68 Timing (in seconds)
% 2.75/1.68 ----------------------
% 2.75/1.68 Preprocessing : 0.42
% 2.75/1.68 Parsing : 0.24
% 2.75/1.68 CNF conversion : 0.02
% 2.75/1.69 Main loop : 0.17
% 2.75/1.69 Inferencing : 0.05
% 2.75/1.69 Reduction : 0.04
% 2.75/1.69 Demodulation : 0.03
% 2.75/1.69 BG Simplification : 0.02
% 2.75/1.69 Subsumption : 0.05
% 2.75/1.69 Abstraction : 0.01
% 2.75/1.69 MUC search : 0.00
% 2.75/1.69 Cooper : 0.00
% 2.75/1.69 Total : 0.66
% 2.75/1.69 Index Insertion : 0.00
% 2.75/1.69 Index Deletion : 0.00
% 2.75/1.69 Index Matching : 0.00
% 2.75/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------