%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : DAT019_1 : TPTP v9.0.0. Released v5.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 : n017.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:07:55 PM UTC 2025
% Result : Theorem 2.82s 1.65s
% Output : CNFRefutation 2.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 2 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 16 ( 0 atm; 0 fun; 11 num; 5 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 8 ( 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > remove > add > #nlpp > empty
%Foreground sorts:
tff(collection,type,
collection: $tType ).
%Background operators:
%Foreground operators:
tff(empty,type,
empty: collection ).
tff(in,type,
in: ( $int * collection ) > $o ).
tff(remove,type,
remove: ( $int * collection ) > collection ).
tff(add,type,
add: ( $int * collection ) > collection ).
tff(f_71,axiom,
! [Za: $int,X1: collection,X2a: $int] :
( ( in(Za,X1)
| ( Za = X2a ) )
<=> in(Za,add(X2a,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002_0.ax',ax4) ).
tff(f_82,negated_conjecture,
~ in(3,add(1,add(3,add(5,empty)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(c_24,plain,
! [X2_8a: $int,X1_7: collection] : in(X2_8a,add(X2_8a,X1_7)),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_23,plain,
! [Z_6a: $int,X1_7: collection,X2_8a: $int] :
( ~ in(Z_6a,X1_7)
| in(Z_6a,add(X2_8a,X1_7)) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_19,plain,
~ in(3,add(1,add(3,add(5,empty)))),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_37,plain,
~ in(3,add(3,add(5,empty))),
inference(resolution,[status(thm)],[c_23,c_19]) ).
tff(c_41,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : DAT019_1 : TPTP v9.0.0. Released v5.0.0.
% 0.06/0.13 % 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.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 7 18:15:25 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.82/1.65 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.82/1.65
% 2.82/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------