%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SWV003-1 : TPTP v9.0.0. Released v1.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 : n019.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 09:29:18 PM UTC 2025
% Result : Unsatisfiable 3.52s 1.84s
% Output : CNFRefutation 3.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-1 aty)
% Number of variables : 7 ( 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_than > #nlpp > successor > predecessor > a > one > n > k > j > i
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(i,type,
i: $i ).
tff(j,type,
j: $i ).
tff(predecessor,type,
predecessor: $i > $i ).
tff(k,type,
k: $i ).
tff(less_than,type,
less_than: ( $i * $i ) > $o ).
tff(a,type,
a: $i > $i ).
tff(one,type,
one: $i ).
tff(n,type,
n: $i ).
tff(successor,type,
successor: $i > $i ).
tff(f_111,axiom,
~ less_than(k,i),
file(unknown,unknown) ).
tff(f_109,axiom,
less_than(k,j),
file(unknown,unknown) ).
tff(f_141,axiom,
less_than(j,i),
file(unknown,unknown) ).
tff(f_73,axiom,
! [X,Z,Y] :
( less_than(X,Z)
| ~ less_than(X,Y)
| ~ less_than(Y,Z) ),
file(unknown,unknown) ).
tff(c_30,plain,
~ less_than(k,i),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_28,plain,
less_than(k,j),
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_42,plain,
less_than(j,i),
inference(cnfTransformation,[status(thm)],[f_141]) ).
tff(c_190,plain,
! [Y_40,Z_41,X_42] :
( ~ less_than(Y_40,Z_41)
| ~ less_than(X_42,Y_40)
| less_than(X_42,Z_41) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_277,plain,
! [X_46] :
( ~ less_than(X_46,j)
| less_than(X_46,i) ),
inference(resolution,[status(thm)],[c_42,c_190]) ).
tff(c_292,plain,
less_than(k,i),
inference(resolution,[status(thm)],[c_28,c_277]) ).
tff(c_299,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_30,c_292]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV003-1 : TPTP v9.0.0. Released v1.0.0.
% 0.10/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.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Apr 9 02:35:47 EDT 2025
% 0.12/0.34 % CPUTime :
% 3.52/1.84 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.52/1.85
% 3.52/1.85 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------