%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GEO498+1 : TPTP v9.0.0. Released v7.0.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 : Wed Apr 9 06:14:52 PM UTC 2025
% Result : Theorem 6.03s 2.43s
% Output : CNFRefutation 6.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-8 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-6 aty)
% Number of variables : 8 ( 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ s_ifs > s_fs > s_afs > s_kf > s_e3 > s_e > le > sameside > s_t > s_m > s_col > crossbar > ip > insert5 > insert > ins > ext > c63 > s > pointOffLine > #nlpp > xb > gamma > beta > alpha > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(s_ifs,type,
s_ifs: ( $i * $i * $i * $i * $i * $i * $i * $i ) > $o ).
tff(gamma,type,
gamma: $i ).
tff(s_t,type,
s_t: ( $i * $i * $i ) > $o ).
tff(sameside,type,
sameside: ( $i * $i * $i ) > $o ).
tff(s_e3,type,
s_e3: ( $i * $i * $i * $i * $i * $i ) > $o ).
tff(s_afs,type,
s_afs: ( $i * $i * $i * $i * $i * $i * $i * $i ) > $o ).
tff(crossbar,type,
crossbar: ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(insert,type,
insert: ( $i * $i * $i * $i ) > $i ).
tff(c63,type,
c63: ( $i * $i * $i ) > $i ).
tff(insert5,type,
insert5: ( $i * $i * $i * $i * $i ) > $i ).
tff(alpha,type,
alpha: $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(pointOffLine,type,
pointOffLine: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(ins,type,
ins: ( $i * $i * $i * $i ) > $i ).
tff(s_m,type,
s_m: ( $i * $i * $i ) > $o ).
tff(s_kf,type,
s_kf: ( $i * $i * $i * $i * $i * $i * $i ) > $o ).
tff(xb,type,
xb: $i ).
tff(s,type,
s: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(ip,type,
ip: ( $i * $i * $i * $i * $i ) > $i ).
tff(ext,type,
ext: ( $i * $i * $i * $i ) > $i ).
tff(s_fs,type,
s_fs: ( $i * $i * $i * $i * $i * $i * $i * $i ) > $o ).
tff(le,type,
le: ( $i * $i * $i * $i ) > $o ).
tff(s_col,type,
s_col: ( $i * $i * $i ) > $o ).
tff(beta,type,
beta: $i ).
tff(s_e,type,
s_e: ( $i * $i * $i * $i ) > $o ).
tff(f_893,negated_conjecture,
~ ! [Xa,Xp,Xr,Xq] :
( ( s(Xa,Xp) != Xr )
| ( s(Xa,Xq) != Xr )
| ( Xp = Xq ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_8) ).
tff(f_884,axiom,
! [Xa,Xp] : ( s(Xa,s(Xa,Xp)) = Xp ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_7) ).
tff(c_228,plain,
'#skF_2' != '#skF_4',
inference(cnfTransformation,[status(thm)],[f_893]) ).
tff(c_230,plain,
s('#skF_1','#skF_4') = '#skF_3',
inference(cnfTransformation,[status(thm)],[f_893]) ).
tff(c_374,plain,
! [Xa_453,Xp_454] : ( s(Xa_453,s(Xa_453,Xp_454)) = Xp_454 ),
inference(cnfTransformation,[status(thm)],[f_884]) ).
tff(c_389,plain,
s('#skF_1','#skF_3') = '#skF_4',
inference(superposition,[status(thm),theory(equality)],[c_230,c_374]) ).
tff(c_232,plain,
s('#skF_1','#skF_2') = '#skF_3',
inference(cnfTransformation,[status(thm)],[f_893]) ).
tff(c_392,plain,
s('#skF_1','#skF_3') = '#skF_2',
inference(superposition,[status(thm),theory(equality)],[c_232,c_374]) ).
tff(c_411,plain,
'#skF_2' = '#skF_4',
inference(demodulation,[status(thm),theory(equality)],[c_389,c_392]) ).
tff(c_412,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_228,c_411]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO498+1 : TPTP v9.0.0. Released v7.0.0.
% 0.12/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.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Apr 7 20:26:32 EDT 2025
% 0.20/0.34 % CPUTime :
% 6.03/2.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.03/2.43
% 6.03/2.43 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------