%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : KRS178+1 : TPTP v9.0.0. Bugfixed v5.4.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 : n013.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 : Wed Apr 9 07:08:10 PM UTC 2025
% Result : Theorem 3.51s 1.85s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 11 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 7 ( 3 ~; 2 |; 0 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 31 ( 31 usr; 20 con; 0-2 aty)
% Number of variables : 10 ( 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ status > xora > nota > nevera > model > mighta > isa > #nlpp > not > #skF_6 > #skF_20 > #skF_18 > #skF_17 > #skF_11 > #skF_15 > #skF_25 > #skF_19 > #skF_3 > #skF_16 > #skF_26 > #skF_14 > #skF_13 > #skF_10 > #skF_8 > #skF_21 > #skF_30 > #skF_22 > #skF_29 > #skF_28 > #skF_2 > #skF_24 > #skF_27 > #skF_23 > #skF_7 > #skF_1 > #skF_9 > #skF_5 > #skF_12 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': $i ).
tff('#skF_18',type,
'#skF_18': $i ).
tff('#skF_17',type,
'#skF_17': $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff('#skF_15',type,
'#skF_15': $i ).
tff('#skF_25',type,
'#skF_25': $i ).
tff(isa,type,
isa: ( $i * $i ) > $o ).
tff('#skF_19',type,
'#skF_19': $i ).
tff(status,type,
status: ( $i * $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff(xora,type,
xora: ( $i * $i ) > $o ).
tff('#skF_26',type,
'#skF_26': $i ).
tff('#skF_14',type,
'#skF_14': $i ).
tff(nota,type,
nota: ( $i * $i ) > $o ).
tff(model,type,
model: ( $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff(not,type,
not: $i > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff('#skF_21',type,
'#skF_21': $i ).
tff('#skF_30',type,
'#skF_30': $i ).
tff('#skF_22',type,
'#skF_22': $i ).
tff(mighta,type,
mighta: ( $i * $i ) > $o ).
tff('#skF_29',type,
'#skF_29': $i ).
tff('#skF_28',type,
'#skF_28': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(nevera,type,
nevera: ( $i * $i ) > $o ).
tff('#skF_24',type,
'#skF_24': $i ).
tff('#skF_27',type,
'#skF_27': $i ).
tff('#skF_23',type,
'#skF_23': $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_64,axiom,
! [S1,S2] :
( ! [Ax,C] :
( status(Ax,C,S1)
=> status(Ax,C,S2) )
<=> isa(S1,S2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',isa) ).
tff(f_160,negated_conjecture,
~ ! [S1] : isa(S1,S1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',isa_reflexive) ).
tff(c_12,plain,
! [S1_9,S2_10] :
( status('#skF_3'(S1_9,S2_10),'#skF_4'(S1_9,S2_10),S1_9)
| isa(S1_9,S2_10) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_165,plain,
! [S1_96,S2_97] :
( ~ status('#skF_3'(S1_96,S2_97),'#skF_4'(S1_96,S2_97),S2_97)
| isa(S1_96,S2_97) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_170,plain,
! [S1_9] : isa(S1_9,S1_9),
inference(resolution,[status(thm)],[c_12,c_165]) ).
tff(c_80,plain,
~ isa('#skF_30','#skF_30'),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_173,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_170,c_80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS178+1 : TPTP v9.0.0. Bugfixed v5.4.0.
% 0.06/0.13 % 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.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Apr 8 03:01:32 EDT 2025
% 0.13/0.34 % CPUTime :
% 3.51/1.85 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.51/1.85
% 3.51/1.85 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------