TSTP Solution File: SWV405+1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : SWV405+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n006.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 7 10:58:06 EDT 2024
% Result : Theorem 4.65s 2.27s
% Output : Refutation 4.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 29 ( 11 unt; 10 typ; 0 def)
% Number of atoms : 37 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 125 ( 14 ~; 4 |; 2 &; 93 @)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 36 ( 0 ^ 32 !; 4 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(check_cpq_type,type,
check_cpq: $i > $o ).
thf(triple_type,type,
triple: $i > $i > $i > $i ).
thf(create_slb_type,type,
create_slb: $i ).
thf(pair_in_list_type,type,
pair_in_list: $i > $i > $i > $o ).
thf(less_than_type,type,
less_than: $i > $i > $o ).
thf(sk1_type,type,
sk1: $o ).
thf(sk4_type,type,
sk4: $i ).
thf(sk5_type,type,
sk5: $i ).
thf(sk6_type,type,
sk6: $i ).
thf(sk7_type,type,
sk7: $i ).
thf(1,conjecture,
! [A: $i,B: $i] :
( ( check_cpq @ ( triple @ A @ create_slb @ B ) )
<=> ! [C: $i,D: $i] :
( ( pair_in_list @ create_slb @ C @ D )
=> ( less_than @ D @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l41_co) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i] :
( ( check_cpq @ ( triple @ A @ create_slb @ B ) )
<=> ! [C: $i,D: $i] :
( ( pair_in_list @ create_slb @ C @ D )
=> ( less_than @ D @ C ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(44,plain,
~ ! [A: $i,B: $i] :
( ( ( check_cpq @ ( triple @ A @ create_slb @ B ) )
=> ! [C: $i,D: $i] :
( ( pair_in_list @ create_slb @ C @ D )
=> ( less_than @ D @ C ) ) )
& ( ! [C: $i,D: $i] :
( ( pair_in_list @ create_slb @ C @ D )
=> ( less_than @ D @ C ) )
=> ( check_cpq @ ( triple @ A @ create_slb @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(45,plain,
~ ( ( ? [A: $i,B: $i] : ( check_cpq @ ( triple @ A @ create_slb @ B ) )
=> ! [A: $i,B: $i] :
( ( pair_in_list @ create_slb @ A @ B )
=> ( less_than @ B @ A ) ) )
& ( ! [A: $i,B: $i] :
( ( pair_in_list @ create_slb @ A @ B )
=> ( less_than @ B @ A ) )
=> ! [A: $i,B: $i] : ( check_cpq @ ( triple @ A @ create_slb @ B ) ) ) ),
inference(miniscope,[status(thm)],[44]) ).
thf(46,plain,
( sk1
| ~ ( check_cpq @ ( triple @ sk6 @ create_slb @ sk7 ) ) ),
inference(cnf,[status(esa)],[45]) ).
thf(50,plain,
( ( pair_in_list @ create_slb @ sk4 @ sk5 )
| ~ sk1 ),
inference(cnf,[status(esa)],[45]) ).
thf(23,axiom,
! [A: $i,B: $i] :
~ ( pair_in_list @ create_slb @ A @ B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax22) ).
thf(115,plain,
! [A: $i,B: $i] :
~ ( pair_in_list @ create_slb @ A @ B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[23]) ).
thf(116,plain,
~ ? [A: $i,B: $i] : ( pair_in_list @ create_slb @ A @ B ),
inference(miniscope,[status(thm)],[115]) ).
thf(117,plain,
! [B: $i,A: $i] :
~ ( pair_in_list @ create_slb @ A @ B ),
inference(cnf,[status(esa)],[116]) ).
thf(196,plain,
( $false
| ~ sk1 ),
inference(rewrite,[status(thm)],[50,117]) ).
thf(197,plain,
~ sk1,
inference(simp,[status(thm)],[196]) ).
thf(198,plain,
( $false
| ~ ( check_cpq @ ( triple @ sk6 @ create_slb @ sk7 ) ) ),
inference(rewrite,[status(thm)],[46,197]) ).
thf(199,plain,
~ ( check_cpq @ ( triple @ sk6 @ create_slb @ sk7 ) ),
inference(simp,[status(thm)],[198]) ).
thf(29,axiom,
! [A: $i,B: $i] : ( check_cpq @ ( triple @ A @ create_slb @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax36) ).
thf(142,plain,
! [A: $i,B: $i] : ( check_cpq @ ( triple @ A @ create_slb @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[29]) ).
thf(143,plain,
! [B: $i,A: $i] : ( check_cpq @ ( triple @ A @ create_slb @ B ) ),
inference(cnf,[status(esa)],[142]) ).
thf(201,plain,
~ $true,
inference(rewrite,[status(thm)],[199,143]) ).
thf(202,plain,
$false,
inference(simp,[status(thm)],[201]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWV405+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.17 % Command : run_Leo-III %s %d
% 0.18/0.39 % Computer : n006.cluster.edu
% 0.18/0.39 % Model : x86_64 x86_64
% 0.18/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.39 % Memory : 8042.1875MB
% 0.18/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.39 % CPULimit : 300
% 0.18/0.39 % WCLimit : 300
% 0.18/0.39 % DateTime : Tue May 7 00:30:39 EDT 2024
% 0.18/0.39 % CPUTime :
% 0.91/0.83 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.21/0.96 % [INFO] Parsing done (134ms).
% 1.21/0.97 % [INFO] Running in sequential loop mode.
% 1.78/1.22 % [INFO] nitpick registered as external prover.
% 1.87/1.22 % [INFO] Scanning for conjecture ...
% 1.92/1.30 % [INFO] Found a conjecture and 41 axioms. Running axiom selection ...
% 2.09/1.36 % [INFO] Axiom selection finished. Selected 41 axioms (removed 0 axioms).
% 2.31/1.42 % [INFO] Problem is first-order (TPTP FOF).
% 2.31/1.43 % [INFO] Type checking passed.
% 2.31/1.44 % [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 ...
% 4.65/2.26 % [INFO] Killing All external provers ...
% 4.65/2.26 % Time passed: 1757ms (effective reasoning time: 1284ms)
% 4.65/2.26 % 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)>
% 4.65/2.26 % Axioms used in derivation (2): ax22, ax36
% 4.65/2.26 % No. of inferences in proof: 19
% 4.65/2.27 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1757 ms resp. 1284 ms w/o parsing
% 4.65/2.29 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.65/2.29 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------