TSTP Solution File: SWV122+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SWV122+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n001.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 : Fri May 19 12:13:57 EDT 2023
% Result : Theorem 4.86s 2.22s
% Output : Refutation 5.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 11
% Syntax : Number of formulae : 14 ( 2 unt; 10 typ; 0 def)
% Number of atoms : 62 ( 12 equ; 0 cnn)
% Maximal formula atoms : 30 ( 15 avg)
% Number of connectives : 276 ( 2 ~; 0 |; 44 &; 216 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 9 con; 0-3 aty)
% Number of variables : 24 ( 0 ^; 24 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(leq_type,type,
leq: $i > $i > $o ).
thf(n0_type,type,
n0: $i ).
thf(minus_type,type,
minus: $i > $i > $i ).
thf(n6_type,type,
n6: $i ).
thf(n1_type,type,
n1: $i ).
thf(a_select3_type,type,
a_select3: $i > $i > $i > $i ).
thf(q_ds1_filter_type,type,
q_ds1_filter: $i ).
thf(n3_type,type,
n3: $i ).
thf(r_ds1_filter_type,type,
r_ds1_filter: $i ).
thf(pminus_ds1_filter_type,type,
pminus_ds1_filter: $i ).
thf(1,conjecture,
( ( ! [A: $i,B: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ n0 @ B )
& ( leq @ A @ ( minus @ n6 @ n1 ) )
& ( leq @ B @ ( minus @ n6 @ n1 ) ) )
=> ( ( a_select3 @ q_ds1_filter @ A @ B )
= ( a_select3 @ q_ds1_filter @ B @ A ) ) )
& ! [A: $i,B: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ n0 @ B )
& ( leq @ A @ ( minus @ n3 @ n1 ) )
& ( leq @ B @ ( minus @ n3 @ n1 ) ) )
=> ( ( a_select3 @ r_ds1_filter @ A @ B )
= ( a_select3 @ r_ds1_filter @ B @ A ) ) )
& ! [A: $i,B: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ n0 @ B )
& ( leq @ A @ ( minus @ n6 @ n1 ) )
& ( leq @ B @ ( minus @ n6 @ n1 ) ) )
=> ( ( a_select3 @ pminus_ds1_filter @ A @ B )
= ( a_select3 @ pminus_ds1_filter @ B @ A ) ) ) )
=> ( ! [A: $i,B: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ n0 @ B )
& ( leq @ A @ ( minus @ n6 @ n1 ) )
& ( leq @ B @ ( minus @ n6 @ n1 ) ) )
=> ( ( a_select3 @ q_ds1_filter @ A @ B )
= ( a_select3 @ q_ds1_filter @ B @ A ) ) )
& ! [A: $i,B: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ n0 @ B )
& ( leq @ A @ ( minus @ n3 @ n1 ) )
& ( leq @ B @ ( minus @ n3 @ n1 ) ) )
=> ( ( a_select3 @ r_ds1_filter @ A @ B )
= ( a_select3 @ r_ds1_filter @ B @ A ) ) )
& ! [A: $i,B: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ n0 @ B )
& ( leq @ A @ ( minus @ n6 @ n1 ) )
& ( leq @ B @ ( minus @ n6 @ n1 ) ) )
=> ( ( a_select3 @ pminus_ds1_filter @ A @ B )
= ( a_select3 @ pminus_ds1_filter @ B @ A ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0015) ).
thf(2,negated_conjecture,
~ ( ( ! [A: $i,B: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ n0 @ B )
& ( leq @ A @ ( minus @ n6 @ n1 ) )
& ( leq @ B @ ( minus @ n6 @ n1 ) ) )
=> ( ( a_select3 @ q_ds1_filter @ A @ B )
= ( a_select3 @ q_ds1_filter @ B @ A ) ) )
& ! [A: $i,B: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ n0 @ B )
& ( leq @ A @ ( minus @ n3 @ n1 ) )
& ( leq @ B @ ( minus @ n3 @ n1 ) ) )
=> ( ( a_select3 @ r_ds1_filter @ A @ B )
= ( a_select3 @ r_ds1_filter @ B @ A ) ) )
& ! [A: $i,B: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ n0 @ B )
& ( leq @ A @ ( minus @ n6 @ n1 ) )
& ( leq @ B @ ( minus @ n6 @ n1 ) ) )
=> ( ( a_select3 @ pminus_ds1_filter @ A @ B )
= ( a_select3 @ pminus_ds1_filter @ B @ A ) ) ) )
=> ( ! [A: $i,B: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ n0 @ B )
& ( leq @ A @ ( minus @ n6 @ n1 ) )
& ( leq @ B @ ( minus @ n6 @ n1 ) ) )
=> ( ( a_select3 @ q_ds1_filter @ A @ B )
= ( a_select3 @ q_ds1_filter @ B @ A ) ) )
& ! [A: $i,B: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ n0 @ B )
& ( leq @ A @ ( minus @ n3 @ n1 ) )
& ( leq @ B @ ( minus @ n3 @ n1 ) ) )
=> ( ( a_select3 @ r_ds1_filter @ A @ B )
= ( a_select3 @ r_ds1_filter @ B @ A ) ) )
& ! [A: $i,B: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ n0 @ B )
& ( leq @ A @ ( minus @ n6 @ n1 ) )
& ( leq @ B @ ( minus @ n6 @ n1 ) ) )
=> ( ( a_select3 @ pminus_ds1_filter @ A @ B )
= ( a_select3 @ pminus_ds1_filter @ B @ A ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(94,plain,
~ $true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(95,plain,
$false,
inference(simp,[status(thm)],[94]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV122+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n001.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 19 02:46:21 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.97/0.90 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.62/1.09 % [INFO] Parsing done (186ms).
% 1.62/1.10 % [INFO] Running in sequential loop mode.
% 1.96/1.30 % [INFO] eprover registered as external prover.
% 1.96/1.30 % [INFO] cvc4 registered as external prover.
% 1.96/1.30 % [INFO] Scanning for conjecture ...
% 2.26/1.40 % [INFO] Found a conjecture and 93 axioms. Running axiom selection ...
% 2.51/1.46 % [INFO] Axiom selection finished. Selected 91 axioms (removed 2 axioms).
% 2.80/1.54 % [INFO] Problem is first-order (TPTP FOF).
% 2.88/1.56 % [INFO] Type checking passed.
% 2.88/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 ...
% 4.86/2.22 % [INFO] Killing All external provers ...
% 4.86/2.22 % Time passed: 1695ms (effective reasoning time: 1119ms)
% 4.86/2.22 % 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.86/2.22 % Axioms used in derivation (0):
% 4.86/2.22 % No. of inferences in proof: 4
% 4.86/2.22 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1695 ms resp. 1119 ms w/o parsing
% 5.27/2.26 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.27/2.26 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------