%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : KRS004-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 : n010.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:07:08 PM UTC 2025
% Result : Unsatisfiable 2.45s 1.58s
% Output : CNFRefutation 2.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 7 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 5 ( 5 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ d > c > #nlpp > exist
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(d,type,
d: $i > $o ).
tff(c,type,
c: $i > $o ).
tff(exist,type,
exist: $i ).
tff(f_27,axiom,
! [X1] :
( d(X1)
| ~ c(X1) ),
file(unknown,unknown) ).
tff(f_39,axiom,
! [X1] :
( ~ d(X1)
| ~ c(X1) ),
file(unknown,unknown) ).
tff(f_22,axiom,
c(exist),
file(unknown,unknown) ).
tff(c_10,plain,
! [X1_5] :
( ~ c(X1_5)
| d(X1_5) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_8,plain,
! [X1_3] :
( ~ c(X1_3)
| ~ d(X1_3) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_14,plain,
! [X1_5] : ~ c(X1_5),
inference(resolution,[status(thm)],[c_10,c_8]) ).
tff(c_2,plain,
c(exist),
inference(cnfTransformation,[status(thm)],[f_22]) ).
tff(c_16,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_14,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KRS004-1 : TPTP v9.0.0. Released v2.0.0.
% 0.04/0.14 % 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.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 8 02:53:17 EDT 2025
% 0.14/0.35 % CPUTime :
% 2.45/1.58 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.45/1.58
% 2.45/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------