%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN081+1 : TPTP v9.0.0. Released v2.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 : n032.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 10:02:34 PM UTC 2025
% Result : Theorem 2.31s 1.60s
% Output : CNFRefutation 2.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 3 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 6 ( 5 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > #nlpp > f
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f,type,
f: $i > $i ).
tff(big_f,type,
big_f: $i > $o ).
tff(f_36,negated_conjecture,
~ ? [X] :
( big_f(X)
& ~ big_f(f(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel59) ).
tff(f_30,axiom,
! [X] :
( big_f(X)
<=> ~ big_f(f(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel59_1) ).
tff(c_6,plain,
! [X_2] :
( big_f(f(X_2))
| ~ big_f(X_2) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_8,plain,
! [X_4] :
( ~ big_f(f(X_4))
| ~ big_f(X_4) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_12,plain,
! [X_2] : ~ big_f(X_2),
inference(resolution,[status(thm)],[c_6,c_8]) ).
tff(c_4,plain,
! [X_1] :
( big_f(X_1)
| big_f(f(X_1)) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_15,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_12,c_12,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SYN081+1 : TPTP v9.0.0. Released v2.0.0.
% 0.02/0.09 % 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.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Wed Apr 9 06:56:15 EDT 2025
% 0.09/0.28 % CPUTime :
% 2.31/1.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.31/1.60
% 2.31/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------