TSTP Solution File: SWV115+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SWV115+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:56 EDT 2023
% Result : Theorem 4.48s 2.03s
% Output : Refutation 4.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 14
% Syntax : Number of formulae : 17 ( 2 unt; 13 typ; 0 def)
% Number of atoms : 110 ( 20 equ; 0 cnn)
% Maximal formula atoms : 54 ( 27 avg)
% Number of connectives : 492 ( 2 ~; 0 |; 80 &; 384 @)
% ( 0 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 12 con; 0-3 aty)
% Number of variables : 40 ( 0 ^; 40 !; 0 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(leq_type,type,
leq: $i > $i > $o ).
thf(n0_type,type,
n0: $i ).
thf(pv5_type,type,
pv5: $i ).
thf(minus_type,type,
minus: $i > $i > $i ).
thf(n999_type,type,
n999: $i ).
thf(n1_type,type,
n1: $i ).
thf(n6_type,type,
n6: $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(id_ds1_filter_type,type,
id_ds1_filter: $i ).
thf(1,conjecture,
( ( ( leq @ n0 @ pv5 )
& ( leq @ pv5 @ ( minus @ n999 @ n1 ) )
& ! [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 @ pminus_ds1_filter @ A @ B )
= ( a_select3 @ pminus_ds1_filter @ B @ A ) ) )
& ! [A: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ A @ ( minus @ n6 @ n1 ) ) )
=> ! [B: $i] :
( ( ( leq @ n0 @ B )
& ( leq @ B @ ( minus @ n6 @ n1 ) ) )
=> ( ( a_select3 @ id_ds1_filter @ A @ B )
= ( a_select3 @ id_ds1_filter @ B @ A ) ) ) ) )
=> ( ( leq @ n0 @ pv5 )
& ( leq @ pv5 @ ( minus @ n999 @ n1 ) )
& ! [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 @ pminus_ds1_filter @ A @ B )
= ( a_select3 @ pminus_ds1_filter @ B @ A ) ) )
& ! [A: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ A @ ( minus @ n6 @ n1 ) ) )
=> ! [B: $i] :
( ( ( leq @ n0 @ B )
& ( leq @ B @ ( minus @ n6 @ n1 ) ) )
=> ( ( a_select3 @ id_ds1_filter @ A @ B )
= ( a_select3 @ id_ds1_filter @ B @ A ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0008) ).
thf(2,negated_conjecture,
~ ( ( ( leq @ n0 @ pv5 )
& ( leq @ pv5 @ ( minus @ n999 @ n1 ) )
& ! [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 @ pminus_ds1_filter @ A @ B )
= ( a_select3 @ pminus_ds1_filter @ B @ A ) ) )
& ! [A: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ A @ ( minus @ n6 @ n1 ) ) )
=> ! [B: $i] :
( ( ( leq @ n0 @ B )
& ( leq @ B @ ( minus @ n6 @ n1 ) ) )
=> ( ( a_select3 @ id_ds1_filter @ A @ B )
= ( a_select3 @ id_ds1_filter @ B @ A ) ) ) ) )
=> ( ( leq @ n0 @ pv5 )
& ( leq @ pv5 @ ( minus @ n999 @ n1 ) )
& ! [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 @ pminus_ds1_filter @ A @ B )
= ( a_select3 @ pminus_ds1_filter @ B @ A ) ) )
& ! [A: $i] :
( ( ( leq @ n0 @ A )
& ( leq @ A @ ( minus @ n6 @ n1 ) ) )
=> ! [B: $i] :
( ( ( leq @ n0 @ B )
& ( leq @ B @ ( minus @ n6 @ n1 ) ) )
=> ( ( a_select3 @ id_ds1_filter @ A @ B )
= ( a_select3 @ id_ds1_filter @ B @ A ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(102,plain,
~ $true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(103,plain,
$false,
inference(simp,[status(thm)],[102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV115+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.06/0.15 % Command : run_Leo-III %s %d
% 0.14/0.36 % Computer : n001.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 19 03:00:52 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.89/0.83 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.20/0.98 % [INFO] Parsing done (144ms).
% 1.46/0.99 % [INFO] Running in sequential loop mode.
% 1.80/1.17 % [INFO] eprover registered as external prover.
% 1.80/1.18 % [INFO] cvc4 registered as external prover.
% 1.80/1.18 % [INFO] Scanning for conjecture ...
% 2.15/1.28 % [INFO] Found a conjecture and 101 axioms. Running axiom selection ...
% 2.37/1.34 % [INFO] Axiom selection finished. Selected 99 axioms (removed 2 axioms).
% 2.47/1.41 % [INFO] Problem is first-order (TPTP FOF).
% 2.47/1.42 % [INFO] Type checking passed.
% 2.65/1.43 % [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.48/2.03 % [INFO] Killing All external provers ...
% 4.48/2.03 % Time passed: 1517ms (effective reasoning time: 1039ms)
% 4.48/2.03 % 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.48/2.03 % Axioms used in derivation (0):
% 4.48/2.03 % No. of inferences in proof: 4
% 4.48/2.03 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1517 ms resp. 1039 ms w/o parsing
% 4.84/2.07 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.84/2.07 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------