TSTP Solution File: SYO614-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYO614-1 : TPTP v8.1.2. Released v7.1.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 : n014.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:18:14 EDT 2023
% Result : Unsatisfiable 3.05s 1.88s
% Output : CNFRefutation 3.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 33 ( 10 unt; 7 typ; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 49 ( 29 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 44 (; 44 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ le > eq > max > #nlpp > s > f > a1 > a0
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a1,type,
a1: $i ).
tff(le,type,
le: ( $i * $i ) > $o ).
tff(s,type,
s: $i > $i ).
tff(f,type,
f: $i > $i ).
tff(a0,type,
a0: $i ).
tff(max,type,
max: ( $i * $i ) > $i ).
tff(eq,type,
eq: ( $i * $i ) > $o ).
tff(f_39,axiom,
! [A] :
( eq(f(A),a0)
| eq(f(A),a1) ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A] : le(A,A),
file(unknown,unknown) ).
tff(f_30,axiom,
! [A,B,C] :
( ~ le(max(A,B),C)
| le(A,C) ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [A0,A1] :
( ~ eq(f(A0),a1)
| ~ eq(f(A1),a1)
| ~ le(s(A0),A1) ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [A,B,C] :
( ~ le(max(A,B),C)
| le(B,C) ),
file(unknown,unknown) ).
tff(f_48,axiom,
! [A0,A1] :
( ~ eq(f(A0),a0)
| ~ eq(f(A1),a0)
| ~ le(s(A0),A1) ),
file(unknown,unknown) ).
tff(c_8,plain,
! [A_8] :
( eq(f(A_8),a1)
| eq(f(A_8),a0) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_2,plain,
! [A_1] : le(A_1,A_1),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_32,plain,
! [A_22,C_23,B_24] :
( le(A_22,C_23)
| ~ le(max(A_22,B_24),C_23) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_47,plain,
! [A_22,B_24] : le(A_22,max(A_22,B_24)),
inference(resolution,[status(thm)],[c_2,c_32]) ).
tff(c_178,plain,
! [A0_52,A1_53] :
( ~ le(s(A0_52),A1_53)
| ~ eq(f(A1_53),a1)
| ~ eq(f(A0_52),a1) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_349,plain,
! [A0_77,B_78] :
( ~ eq(f(max(s(A0_77),B_78)),a1)
| ~ eq(f(A0_77),a1) ),
inference(resolution,[status(thm)],[c_47,c_178]) ).
tff(c_361,plain,
! [A0_85,B_86] :
( ~ eq(f(A0_85),a1)
| eq(f(max(s(A0_85),B_86)),a0) ),
inference(resolution,[status(thm)],[c_8,c_349]) ).
tff(c_14,plain,
! [B_14,C_15,A_16] :
( le(B_14,C_15)
| ~ le(max(A_16,B_14),C_15) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_19,plain,
! [B_14,A_16] : le(B_14,max(A_16,B_14)),
inference(resolution,[status(thm)],[c_2,c_14]) ).
tff(c_82,plain,
! [A0_34,A1_35] :
( ~ le(s(A0_34),A1_35)
| ~ eq(f(A1_35),a0)
| ~ eq(f(A0_34),a0) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_111,plain,
! [A_16,A0_34] :
( ~ eq(f(max(A_16,s(A0_34))),a0)
| ~ eq(f(A0_34),a0) ),
inference(resolution,[status(thm)],[c_19,c_82]) ).
tff(c_369,plain,
! [A0_34,A0_85] :
( ~ eq(f(A0_34),a0)
| ~ eq(f(A0_85),a1) ),
inference(resolution,[status(thm)],[c_361,c_111]) ).
tff(c_379,plain,
! [A0_85] : ~ eq(f(A0_85),a1),
inference(splitLeft,[status(thm)],[c_369]) ).
tff(c_380,plain,
! [A_8] : eq(f(A_8),a0),
inference(negUnitSimplification,[status(thm)],[c_379,c_8]) ).
tff(c_109,plain,
! [A0_34,B_24] :
( ~ eq(f(max(s(A0_34),B_24)),a0)
| ~ eq(f(A0_34),a0) ),
inference(resolution,[status(thm)],[c_47,c_82]) ).
tff(c_390,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_109]) ).
tff(c_391,plain,
! [A0_34] : ~ eq(f(A0_34),a0),
inference(splitRight,[status(thm)],[c_369]) ).
tff(c_395,plain,
! [A_8] : eq(f(A_8),a1),
inference(negUnitSimplification,[status(thm)],[c_391,c_8]) ).
tff(c_227,plain,
! [A_16,A0_52] :
( ~ eq(f(max(A_16,s(A0_52))),a1)
| ~ eq(f(A0_52),a1) ),
inference(resolution,[status(thm)],[c_19,c_178]) ).
tff(c_405,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_395,c_395,c_227]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYO614-1 : TPTP v8.1.2. Released v7.1.0.
% 0.00/0.13 % 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.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 15:57:48 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.05/1.88 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.05/1.89
% 3.05/1.89 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.38/1.92
% 3.38/1.92 Inference rules
% 3.38/1.92 ----------------------
% 3.38/1.92 #Ref : 0
% 3.38/1.92 #Sup : 69
% 3.38/1.92 #Fact : 0
% 3.38/1.92 #Define : 0
% 3.38/1.92 #Split : 1
% 3.38/1.92 #Chain : 0
% 3.38/1.92 #Close : 0
% 3.38/1.92
% 3.38/1.92 Ordering : KBO
% 3.38/1.92
% 3.38/1.92 Simplification rules
% 3.38/1.92 ----------------------
% 3.38/1.92 #Subsume : 15
% 3.38/1.92 #Demod : 16
% 3.38/1.92 #Tautology : 1
% 3.38/1.92 #SimpNegUnit : 5
% 3.38/1.92 #BackRed : 13
% 3.38/1.92
% 3.38/1.92 #Partial instantiations: 0
% 3.38/1.92 #Strategies tried : 1
% 3.38/1.92
% 3.38/1.92 Timing (in seconds)
% 3.38/1.92 ----------------------
% 3.38/1.92 Preprocessing : 0.40
% 3.38/1.92 Parsing : 0.23
% 3.38/1.92 CNF conversion : 0.02
% 3.38/1.92 Main loop : 0.39
% 3.38/1.93 Inferencing : 0.17
% 3.38/1.93 Reduction : 0.09
% 3.38/1.93 Demodulation : 0.06
% 3.38/1.93 BG Simplification : 0.02
% 3.38/1.93 Subsumption : 0.10
% 3.38/1.93 Abstraction : 0.01
% 3.38/1.93 MUC search : 0.00
% 3.38/1.93 Cooper : 0.00
% 3.38/1.93 Total : 0.85
% 3.38/1.93 Index Insertion : 0.00
% 3.38/1.93 Index Deletion : 0.00
% 3.38/1.93 Index Matching : 0.00
% 3.38/1.93 BG Taut test : 0.00
%------------------------------------------------------------------------------