%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : DAT315^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 07:48:14 AM UTC 2026
% Result : Theorem 3.56s 2.13s
% Output : Refutation 3.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 18 unt; 0 typ; 2 def)
% Number of atoms : 22 ( 21 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 197 ( 10 ~; 1 |; 0 &; 186 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 2 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 30 ( 0 ^; 28 !; 0 ?; 30 :)
% ( 0 !>; 0 ?*; 0 @-; 2 @+)
% Comments :
%------------------------------------------------------------------------------
thf('type/nums/num_type',type,
'type/nums/num': $tType ).
thf(skt1_type,type,
skt1: $tType ).
thf('const/nums/SUC_decl',type,
'const/nums/SUC': 'type/nums/num' > 'type/nums/num' ).
thf('const/nums/NUMERAL_decl',type,
'const/nums/NUMERAL': 'type/nums/num' > 'type/nums/num' ).
thf('const/nums/BIT1_decl',type,
'const/nums/BIT1': 'type/nums/num' > 'type/nums/num' ).
thf('const/nums/_0_decl',type,
'const/nums/_0': 'type/nums/num' ).
thf('const/lists/TL_decl',type,
'const/lists/TL':
!>[TA: $tType] : ( ( 'type/ind_types/list' @ TA ) > ( 'type/ind_types/list' @ TA ) ) ).
thf('const/lists/EL_decl',type,
'const/lists/EL':
!>[TA: $tType] : ( 'type/nums/num' > ( 'type/ind_types/list' @ TA ) > TA ) ).
thf('const/arith/+_decl',type,
'const/arith/+': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' ).
thf(sk1_decl,type,
sk1: 'type/ind_types/list' @ skt1 ).
thf(sk2_decl,type,
sk2: 'type/nums/num' ).
thf(sk1_def,definition,
( sk1
= ( @+[A: 'type/ind_types/list' @ skt1] :
~ ! [B: 'type/nums/num'] :
( ( 'const/lists/EL' @ skt1 @ B @ ( 'const/lists/TL' @ skt1 @ A ) )
= ( 'const/lists/EL' @ skt1 @ ( 'const/arith/+' @ B @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) @ A ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: 'type/nums/num'] :
( ( 'const/lists/EL' @ skt1 @ A @ ( 'const/lists/TL' @ skt1 @ sk1 ) )
!= ( 'const/lists/EL' @ skt1 @ ( 'const/arith/+' @ A @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) @ sk1 ) ) ) ) ).
thf(3,axiom,
! [TA: $tType,A: 'type/nums/num',B: 'type/ind_types/list' @ TA] :
( ( 'const/lists/EL' @ TA @ ( 'const/nums/SUC' @ A ) @ B )
= ( 'const/lists/EL' @ TA @ A @ ( 'const/lists/TL' @ TA @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/lists/EL_1') ).
thf(8,plain,
! [TA: $tType,A: 'type/nums/num',B: 'type/ind_types/list' @ TA] :
( ( 'const/lists/EL' @ TA @ ( 'const/nums/SUC' @ A ) @ B )
= ( 'const/lists/EL' @ TA @ A @ ( 'const/lists/TL' @ TA @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(9,plain,
! [TA: $tType,B: 'type/ind_types/list' @ TA,A: 'type/nums/num'] :
( ( 'const/lists/EL' @ TA @ ( 'const/nums/SUC' @ A ) @ B )
= ( 'const/lists/EL' @ TA @ A @ ( 'const/lists/TL' @ TA @ B ) ) ),
inference(cnf,[status(esa)],[8]) ).
thf(10,plain,
! [TA: $tType,B: 'type/ind_types/list' @ TA,A: 'type/nums/num'] :
( ( 'const/lists/EL' @ TA @ ( 'const/nums/SUC' @ A ) @ B )
= ( 'const/lists/EL' @ TA @ A @ ( 'const/lists/TL' @ TA @ B ) ) ),
inference(lifteq,[status(thm)],[9]) ).
thf(1,conjecture,
! [TA: $tType,A: 'type/ind_types/list' @ TA,B: 'type/nums/num'] :
( ( 'const/lists/EL' @ TA @ B @ ( 'const/lists/TL' @ TA @ A ) )
= ( 'const/lists/EL' @ TA @ ( 'const/arith/+' @ B @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/lists/EL_TL_') ).
thf(2,negated_conjecture,
~ ! [TA: $tType,A: 'type/ind_types/list' @ TA,B: 'type/nums/num'] :
( ( 'const/lists/EL' @ TA @ B @ ( 'const/lists/TL' @ TA @ A ) )
= ( 'const/lists/EL' @ TA @ ( 'const/arith/+' @ B @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) @ A ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ! [TA: $tType,A: 'type/ind_types/list' @ TA,B: 'type/nums/num'] :
( ( 'const/lists/EL' @ TA @ B @ ( 'const/lists/TL' @ TA @ A ) )
= ( 'const/lists/EL' @ TA @ ( 'const/arith/+' @ B @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
( ( 'const/lists/EL' @ skt1 @ sk2 @ ( 'const/lists/TL' @ skt1 @ sk1 ) )
!= ( 'const/lists/EL' @ skt1 @ ( 'const/arith/+' @ sk2 @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) @ sk1 ) ),
inference(cnf,[status(esa)],[5]) ).
thf(7,plain,
( ( 'const/lists/EL' @ skt1 @ ( 'const/arith/+' @ sk2 @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) @ sk1 )
!= ( 'const/lists/EL' @ skt1 @ sk2 @ ( 'const/lists/TL' @ skt1 @ sk1 ) ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(4,axiom,
! [A: 'type/nums/num'] :
( ( 'const/nums/SUC' @ A )
= ( 'const/arith/+' @ A @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/arith/ADD1_') ).
thf(11,plain,
! [A: 'type/nums/num'] :
( ( 'const/nums/SUC' @ A )
= ( 'const/arith/+' @ A @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(12,plain,
! [A: 'type/nums/num'] :
( ( 'const/nums/SUC' @ A )
= ( 'const/arith/+' @ A @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ),
inference(cnf,[status(esa)],[11]) ).
thf(13,plain,
! [A: 'type/nums/num'] :
( ( 'const/arith/+' @ A @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) )
= ( 'const/nums/SUC' @ A ) ),
inference(lifteq,[status(thm)],[12]) ).
thf(15,plain,
( ( 'const/lists/EL' @ skt1 @ ( 'const/nums/SUC' @ sk2 ) @ sk1 )
!= ( 'const/lists/EL' @ skt1 @ sk2 @ ( 'const/lists/TL' @ skt1 @ sk1 ) ) ),
inference(rewrite,[status(thm)],[7,13]) ).
thf(17,plain,
! [B: 'type/ind_types/list' @ skt1,A: 'type/nums/num'] :
( ( ( 'const/lists/EL' @ skt1 @ A @ ( 'const/lists/TL' @ skt1 @ B ) )
!= ( 'const/lists/EL' @ skt1 @ sk2 @ ( 'const/lists/TL' @ skt1 @ sk1 ) ) )
| ( ( 'const/lists/EL' @ skt1 @ ( 'const/nums/SUC' @ A ) @ B )
!= ( 'const/lists/EL' @ skt1 @ ( 'const/nums/SUC' @ sk2 ) @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[10,15]) ).
thf(18,plain,
( ( 'const/lists/EL' @ skt1 @ sk2 @ ( 'const/lists/TL' @ skt1 @ sk1 ) )
!= ( 'const/lists/EL' @ skt1 @ sk2 @ ( 'const/lists/TL' @ skt1 @ sk1 ) ) ),
inference(pattern_uni,[status(thm)],[17:[bind(A,$thf( sk2 )),bind(B,$thf( sk1 ))]]) ).
thf(19,plain,
$false,
inference(simp,[status(thm)],[18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT315^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.07 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.11/0.20 % Computer : n016.cluster.edu
% 0.11/0.20 % Model : x86_64 x86_64
% 0.11/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.20 % Memory : 8046.5625MB
% 0.11/0.20 % OS : Linux 6.8.0-71-generic
% 0.11/0.21 % CPULimit : 300
% 0.11/0.21 % WCLimit : 300
% 0.11/0.21 % DateTime : Tue Sep 29 18:30:19 UTC 2026
% 0.11/0.21 % CPUTime :
% 0.11/0.21 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.86/0.79 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.17/0.97 % [INFO] Parsing done (183ms).
% 1.17/0.99 % [INFO] Running in sequential loop mode.
% 1.76/1.39 % [INFO] eprover registered as external prover.
% 1.96/1.40 % [INFO] Scanning for conjecture ...
% 2.11/1.50 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 2.11/1.54 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 2.11/1.55 % [INFO] Problem is higher-order (TPTP THF).
% 2.11/1.55 % [INFO] Type checking passed.
% 2.11/1.56 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 3.56/2.13 % [INFO] Killing All external provers ...
% 3.56/2.13 % Time passed: 1775ms (effective reasoning time: 1134ms)
% 3.56/2.13 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 3.56/2.13 % Axioms used in derivation (2): thm/lists/EL_1, thm/arith/ADD1_
% 3.56/2.13 % No. of inferences in proof: 17
% 3.56/2.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1775 ms resp. 1134 ms w/o parsing
% 3.56/2.16 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.56/2.16 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------