%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : LCL684+1.001 : TPTP v9.3.1. Released v4.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 : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 11:12:32 AM UTC 2026
% Result : Theorem 2.26s 1.46s
% Output : CNFRefutation 2.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 28 ( 17 ~; 9 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 8 ( 7 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r1 > p201 > p101 > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p101,type,
p101: $i > $o ).
tff(p201,type,
p201: $i > $o ).
tff(r1,type,
r1: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f_56,negated_conjecture,
~ ~ ? [X] :
~ ( ~ ! [Y] :
( ~ r1(X,Y)
| ! [X] :
( ~ r1(Y,X)
| ~ ( p201(X)
& p101(X) ) ) )
| ~ ( p201(X)
& p101(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
tff(f_28,axiom,
! [X] : r1(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
tff(c_8,plain,
p201('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_6,plain,
p101('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_2,plain,
! [X_1] : r1(X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_16,plain,
! [X_15,Y_16] :
( ~ p101(X_15)
| ~ p201(X_15)
| ~ r1(Y_16,X_15)
| ~ r1('#skF_1',Y_16) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_20,plain,
! [X_17] :
( ~ p101(X_17)
| ~ p201(X_17)
| ~ r1('#skF_1',X_17) ),
inference(resolution,[status(thm)],[c_2,c_16]) ).
tff(c_24,plain,
( ~ p101('#skF_1')
| ~ p201('#skF_1') ),
inference(resolution,[status(thm)],[c_2,c_20]) ).
tff(c_28,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_6,c_24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL684+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % 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.11/0.35 % Computer : n002.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Sat Sep 5 16:36:21 UTC 2026
% 0.11/0.35 % CPUTime :
% 2.26/1.46 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.26/1.47
% 2.26/1.47 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------