TSTP Solution File: SWV447^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SWV447^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n003.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 : Tue May 21 05:51:52 EDT 2024
% Result : Theorem 3.46s 1.95s
% Output : Refutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 16 unt; 4 typ; 0 def)
% Number of atoms : 18 ( 17 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 108 ( 8 ~; 1 |; 0 &; 99 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 7 ^ 22 !; 0 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(nil_type,type,
nil: $i ).
thf(cons_type,type,
cons: $i > $i > $i ).
thf(map_type,type,
map: ( $i > $i ) > $i > $i ).
thf(sk1_type,type,
sk1: $i ).
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(12,plain,
! [C: $i,B: $i,A: $i > $i] :
( ( map @ A @ ( cons @ B @ C ) )
= ( cons @ ( A @ B ) @ ( map @ A @ C ) ) ),
inference(cnf,[status(esa)],[11]) ).
thf(13,plain,
! [C: $i,B: $i,A: $i > $i] :
( ( map @ A @ ( cons @ B @ C ) )
= ( cons @ ( A @ B ) @ ( map @ A @ C ) ) ),
inference(lifteq,[status(thm)],[12]) ).
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(6,plain,
( ( map
@ ^ [A: $i] : A
@ ( cons @ sk1 @ nil ) )
!= ( cons @ sk1 @ nil ) ),
inference(cnf,[status(esa)],[5]) ).
thf(7,plain,
( ( map
@ ^ [A: $i] : A
@ ( cons @ sk1 @ nil ) )
!= ( cons @ sk1 @ nil ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(18,plain,
! [C: $i,B: $i,A: $i > $i] :
( ( ( cons @ ( A @ B ) @ ( map @ A @ C ) )
!= ( cons @ sk1 @ nil ) )
| ( ( map @ A @ ( cons @ B @ C ) )
!= ( map
@ ^ [D: $i] : D
@ ( cons @ sk1 @ nil ) ) ) ),
inference(paramod_ordered,[status(thm)],[13,7]) ).
thf(19,plain,
( ( cons @ sk1
@ ( map
@ ^ [A: $i] : A
@ nil ) )
!= ( cons @ sk1 @ nil ) ),
inference(pattern_uni,[status(thm)],[18:[bind(A,$thf( ^ [D: $i] : D )),bind(B,$thf( sk1 )),bind(C,$thf( nil ))]]) ).
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(9,plain,
! [A: $i > $i] :
( ( map @ A @ nil )
= nil ),
inference(cnf,[status(esa)],[8]) ).
thf(10,plain,
! [A: $i > $i] :
( ( map @ A @ nil )
= nil ),
inference(lifteq,[status(thm)],[9]) ).
thf(60,plain,
( ( cons @ sk1 @ nil )
!= ( cons @ sk1 @ nil ) ),
inference(rewrite,[status(thm)],[19,10]) ).
thf(61,plain,
$false,
inference(simp,[status(thm)],[60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV447^1 : TPTP v8.2.0. Released v3.7.0.
% 0.15/0.17 % Command : run_Leo-III %s %d
% 0.17/0.38 % Computer : n003.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 300
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Sun May 19 06:33:24 EDT 2024
% 0.17/0.38 % CPUTime :
% 0.99/0.89 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.24/1.00 % [INFO] Parsing done (106ms).
% 1.24/1.01 % [INFO] Running in sequential loop mode.
% 1.63/1.23 % [INFO] nitpick registered as external prover.
% 1.63/1.24 % [INFO] Scanning for conjecture ...
% 1.80/1.29 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 1.95/1.31 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 1.95/1.32 % [INFO] Problem is higher-order (TPTP THF).
% 1.95/1.32 % [INFO] Type checking passed.
% 1.95/1.32 % [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.46/1.95 % [INFO] Killing All external provers ...
% 3.46/1.95 % Time passed: 1403ms (effective reasoning time: 937ms)
% 3.46/1.95 % 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.46/1.95 % Axioms used in derivation (2): ax2, ax1
% 3.46/1.95 % No. of inferences in proof: 17
% 3.46/1.95 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1403 ms resp. 937 ms w/o parsing
% 3.62/1.99 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.62/1.99 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------