%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : DAT001_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/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 : 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 06:07:52 PM UTC 2025
% Result : Theorem 2.40s 1.60s
% Output : CNFRefutation 2.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 24 ( 16 ~; 6 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number arithmetic : 52 ( 7 atm; 0 fun; 39 num; 6 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 : 7 ( 2 usr; 6 con; 0-2 aty)
% Number of variables : 8 ( 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
%$ sorted > mycons > #nlpp > nil
%Foreground sorts:
tff(list,type,
list: $tType ).
%Background operators:
%Foreground operators:
tff(sorted,type,
sorted: list > $o ).
tff(nil,type,
nil: list ).
tff(mycons,type,
mycons: ( $int * list ) > list ).
tff(f_30,axiom,
! [Xa: $int] : sorted(mycons(Xa,nil)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_is_sorted) ).
tff(f_36,axiom,
! [Xa: $int,Ya: $int,R: list] :
( ( $less(Xa,Ya)
& sorted(mycons(Ya,R)) )
=> sorted(mycons(Xa,mycons(Ya,R))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',recursive_sort) ).
tff(f_38,negated_conjecture,
~ sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',check_list) ).
tff(c_10,plain,
! [X_1a: $int] : sorted(mycons(X_1a,nil)),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_9,plain,
! [X_2a: $int,Y_3a: $int,R_4: list] :
( sorted(mycons(X_2a,mycons(Y_3a,R_4)))
| ~ sorted(mycons(Y_3a,R_4))
| ~ $less(X_2a,Y_3a) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_8,plain,
~ sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_16,plain,
( ~ sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil)))))
| ~ $less(1,2) ),
inference(resolution,[status(thm)],[c_9,c_8]) ).
tff(c_18,plain,
~ sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil))))),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_16]) ).
tff(c_22,plain,
( ~ sorted(mycons(4,mycons(7,mycons(100,nil))))
| ~ $less(2,4) ),
inference(resolution,[status(thm)],[c_9,c_18]) ).
tff(c_24,plain,
~ sorted(mycons(4,mycons(7,mycons(100,nil)))),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_22]) ).
tff(c_28,plain,
( ~ sorted(mycons(7,mycons(100,nil)))
| ~ $less(4,7) ),
inference(resolution,[status(thm)],[c_9,c_24]) ).
tff(c_30,plain,
~ sorted(mycons(7,mycons(100,nil))),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_28]) ).
tff(c_33,plain,
( ~ sorted(mycons(100,nil))
| ~ $less(7,100) ),
inference(resolution,[status(thm)],[c_9,c_30]) ).
tff(c_36,plain,
~ $less(7,100),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_33]) ).
tff(c_39,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : DAT001_1 : TPTP v9.0.0. Released v5.0.0.
% 0.02/0.09 % 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.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 : Mon Apr 7 18:14:31 EDT 2025
% 0.09/0.28 % CPUTime :
% 2.40/1.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.40/1.60
% 2.40/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------