%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SWV447^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n005.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 08:39:54 AM UTC 2026
% Result : Theorem 2.63s 1.32s
% Output : Refutation 2.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 8 ( 7 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 42 ( 2 ~; 0 |; 0 &; 40 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 3 ^; 11 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(nil_decl,type,
nil: $i ).
thf(cons_decl,type,
cons: $i > $i > $i ).
thf(map_decl,type,
map: ( $i > $i ) > $i > $i ).
thf(1,conjecture,
! [A: $i] :
( ( map
@ ^ [B: $i] : B
@ ( cons @ A @ nil ) )
= ( cons @ A @ nil ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test) ).
thf(2,negated_conjecture,
~ ! [A: $i] :
( ( map
@ ^ [B: $i] : B
@ ( cons @ A @ nil ) )
= ( cons @ A @ nil ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ! [A: $i] :
( ( map
@ ^ [B: $i] : B
@ ( cons @ A @ nil ) )
= ( cons @ A @ nil ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [A: $i > $i] :
( ( map @ A @ nil )
= nil ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
thf(8,plain,
! [A: $i > $i] :
( ( map @ A @ nil )
= nil ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: $i > $i,B: $i,C: $i] :
( ( map @ A @ ( cons @ B @ C ) )
= ( cons @ ( A @ B ) @ ( map @ A @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
thf(11,plain,
! [A: $i > $i,B: $i,C: $i] :
( ( map @ A @ ( cons @ B @ C ) )
= ( cons @ ( A @ B ) @ ( map @ A @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(14,plain,
$false,
inference(e,[status(thm)],[5,8,11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV447^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.10/0.20 % Computer : n005.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 16:04:31 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/0.21 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.68/0.54 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.03/0.64 % [INFO] Parsing done (96ms).
% 1.03/0.65 % [INFO] Running in sequential loop mode.
% 1.31/0.84 % [INFO] eprover registered as external prover.
% 1.31/0.84 % [INFO] Scanning for conjecture ...
% 1.31/0.89 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 1.56/0.90 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 1.56/0.91 % [INFO] Problem is higher-order (TPTP THF).
% 1.56/0.91 % [INFO] Type checking passed.
% 1.56/0.91 % [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 ...
% 2.63/1.32 % External prover 'e' found a proof!
% 2.63/1.32 % [INFO] Killing All external provers ...
% 2.63/1.32 % Time passed: 1014ms (effective reasoning time: 667ms)
% 2.63/1.32 % 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)>
% 2.63/1.32 % Axioms used in derivation (2): ax1, ax2
% 2.63/1.32 % No. of inferences in proof: 8
% 2.63/1.32 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1014 ms resp. 667 ms w/o parsing
% 2.63/1.36 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.63/1.36 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------