TSTP Solution File: ITP209_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ITP209_1 : TPTP v8.1.2. Released v8.0.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 : n015.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:43:47 EDT 2023
% Result : Theorem 3.27s 1.78s
% Output : CNFRefutation 3.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 27
% Syntax : Number of formulae : 32 ( 8 unt; 24 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 16 ( 14 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 6 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
%$ syntax_ac_operator_a > pp > aa_a_fun_a_a > aa_a_a > #nlpp > fTrue > fFalse > f > c > b > a2 > #skF_7 > #skF_3 > #skF_2 > #skF_8 > #skF_9 > #skF_10 > #skF_1 > #skF_4 > #skF_6 > #skF_5
%Foreground sorts:
tff(fun_a_a,type,
fun_a_a: $tType ).
tff(fun_a_fun_a_a,type,
fun_a_fun_a_a: $tType ).
tff(bool,type,
bool: $tType ).
tff(a,type,
a: $tType ).
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': fun_a_fun_a_a > a ).
tff(fTrue,type,
fTrue: bool ).
tff(a2,type,
a2: a ).
tff(c,type,
c: a ).
tff('#skF_3',type,
'#skF_3': fun_a_fun_a_a > a ).
tff('#skF_2',type,
'#skF_2': fun_a_fun_a_a > a ).
tff(aa_a_a,type,
aa_a_a: ( fun_a_a * a ) > a ).
tff('#skF_8',type,
'#skF_8': fun_a_fun_a_a > a ).
tff('#skF_9',type,
'#skF_9': fun_a_fun_a_a > a ).
tff(syntax_ac_operator_a,type,
syntax_ac_operator_a: fun_a_fun_a_a > $o ).
tff('#skF_10',type,
'#skF_10': fun_a_fun_a_a > a ).
tff('#skF_1',type,
'#skF_1': fun_a_fun_a_a > a ).
tff(aa_a_fun_a_a,type,
aa_a_fun_a_a: ( fun_a_fun_a_a * a ) > fun_a_a ).
tff('#skF_4',type,
'#skF_4': fun_a_fun_a_a > a ).
tff(f,type,
f: fun_a_fun_a_a ).
tff(pp,type,
pp: bool > $o ).
tff('#skF_6',type,
'#skF_6': fun_a_fun_a_a > a ).
tff(fFalse,type,
fFalse: bool ).
tff('#skF_5',type,
'#skF_5': fun_a_fun_a_a > a ).
tff(b,type,
b: a ).
tff(f_38,axiom,
! [A: a,B: a] : ( aa_a_a(aa_a_fun_a_a(f,A),B) = aa_a_a(aa_a_fun_a_a(f,B),A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_commute) ).
tff(f_44,axiom,
! [A: a,B: a,C: a] : ( aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,A),B)),C) = aa_a_a(aa_a_fun_a_a(f,A),aa_a_a(aa_a_fun_a_a(f,B),C)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_right__assoc) ).
tff(f_90,negated_conjecture,
aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),b)),c) != aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),c)),b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(c_4,plain,
! [B_2: a,A_1: a] : ( aa_a_a(aa_a_fun_a_a(f,B_2),A_1) = aa_a_a(aa_a_fun_a_a(f,A_1),B_2) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_8,plain,
! [A_6: a,B_7: a,C_8: a] : ( aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,A_6),B_7)),C_8) = aa_a_a(aa_a_fun_a_a(f,A_6),aa_a_a(aa_a_fun_a_a(f,B_7),C_8)) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_30,plain,
aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),c)),b) != aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),b)),c),
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_31,plain,
aa_a_a(aa_a_fun_a_a(f,a2),aa_a_a(aa_a_fun_a_a(f,c),b)) != aa_a_a(aa_a_fun_a_a(f,a2),aa_a_a(aa_a_fun_a_a(f,b),c)),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_8,c_30]) ).
tff(c_33,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : ITP209_1 : TPTP v8.1.2. Released v8.0.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 : n015.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 19:09:44 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.27/1.78 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.27/1.78
% 3.27/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.27/1.80
% 3.27/1.80 Inference rules
% 3.27/1.80 ----------------------
% 3.27/1.80 #Ref : 0
% 3.27/1.80 #Sup : 0
% 3.27/1.80 #Fact : 0
% 3.27/1.80 #Define : 0
% 3.27/1.80 #Split : 0
% 3.27/1.80 #Chain : 0
% 3.27/1.80 #Close : 0
% 3.27/1.80
% 3.27/1.80 Ordering : KBO
% 3.27/1.80
% 3.27/1.80 Simplification rules
% 3.27/1.80 ----------------------
% 3.27/1.80 #Subsume : 14
% 3.27/1.80 #Demod : 3
% 3.27/1.80 #Tautology : 0
% 3.27/1.80 #SimpNegUnit : 0
% 3.27/1.80 #BackRed : 0
% 3.27/1.80
% 3.27/1.80 #Partial instantiations: 0
% 3.27/1.80 #Strategies tried : 1
% 3.27/1.80
% 3.27/1.80 Timing (in seconds)
% 3.27/1.80 ----------------------
% 3.27/1.81 Preprocessing : 0.58
% 3.27/1.81 Parsing : 0.32
% 3.27/1.81 CNF conversion : 0.03
% 3.27/1.81 Main loop : 0.08
% 3.27/1.81 Inferencing : 0.00
% 3.27/1.81 Reduction : 0.04
% 3.27/1.81 Demodulation : 0.04
% 3.27/1.81 BG Simplification : 0.02
% 3.27/1.81 Subsumption : 0.03
% 3.27/1.81 Abstraction : 0.01
% 3.27/1.81 MUC search : 0.00
% 3.27/1.81 Cooper : 0.00
% 3.27/1.81 Total : 0.70
% 3.27/1.81 Index Insertion : 0.00
% 3.27/1.81 Index Deletion : 0.00
% 3.27/1.81 Index Matching : 0.00
% 3.27/1.81 BG Taut test : 0.00
%------------------------------------------------------------------------------