TSTP Solution File: SWC208+1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SWC208+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n015.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 04:34:28 EDT 2024
% Result : Theorem 5.82s 2.47s
% Output : Refutation 5.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 13 unt; 8 typ; 0 def)
% Number of atoms : 69 ( 30 equ; 0 cnn)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 134 ( 31 ~; 26 |; 3 &; 62 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 12 ( 0 ^ 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(ssList_type,type,
ssList: $i > $o ).
thf(neq_type,type,
neq: $i > $i > $o ).
thf(nil_type,type,
nil: $i ).
thf(frontsegP_type,type,
frontsegP: $i > $i > $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(sk4_type,type,
sk4: $i ).
thf(1,conjecture,
! [A: $i] :
( ( ssList @ A )
=> ! [B: $i] :
( ( ssList @ B )
=> ! [C: $i] :
( ( ssList @ C )
=> ! [D: $i] :
( ( ssList @ D )
=> ( ( B != D )
| ( A != C )
| ~ ( neq @ B @ nil )
| ( neq @ A @ nil )
| ( ( ( nil != D )
| ( nil != C ) )
& ( ~ ( neq @ C @ nil )
| ~ ( frontsegP @ D @ C ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
thf(2,negated_conjecture,
~ ! [A: $i] :
( ( ssList @ A )
=> ! [B: $i] :
( ( ssList @ B )
=> ! [C: $i] :
( ( ssList @ C )
=> ! [D: $i] :
( ( ssList @ D )
=> ( ( B != D )
| ( A != C )
| ~ ( neq @ B @ nil )
| ( neq @ A @ nil )
| ( ( ( nil != D )
| ( nil != C ) )
& ( ~ ( neq @ C @ nil )
| ~ ( frontsegP @ D @ C ) ) ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(98,plain,
~ ! [A: $i] :
( ( ssList @ A )
=> ! [B: $i] :
( ( ssList @ B )
=> ! [C: $i] :
( ( ssList @ C )
=> ! [D: $i] :
( ( ssList @ D )
=> ( ( B != D )
| ( A != C )
| ~ ( neq @ B @ nil )
| ( neq @ A @ nil )
| ( ( ( nil != D )
| ( nil != C ) )
& ( ~ ( neq @ C @ nil )
| ~ ( frontsegP @ D @ C ) ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(104,plain,
~ ( neq @ sk1 @ nil ),
inference(cnf,[status(esa)],[98]) ).
thf(99,plain,
( ( nil = sk3 )
| ( neq @ sk3 @ nil ) ),
inference(cnf,[status(esa)],[98]) ).
thf(116,plain,
( ( sk3 = nil )
| ( neq @ sk3 @ nil ) ),
inference(lifteq,[status(thm)],[99]) ).
thf(106,plain,
sk1 = sk3,
inference(cnf,[status(esa)],[98]) ).
thf(113,plain,
sk3 = sk1,
inference(lifteq,[status(thm)],[106]) ).
thf(560,plain,
( ( sk1 = nil )
| ( neq @ sk1 @ nil ) ),
inference(rewrite,[status(thm)],[116,113]) ).
thf(102,plain,
neq @ sk2 @ nil,
inference(cnf,[status(esa)],[98]) ).
thf(509,plain,
( ( neq @ sk2 @ nil )
!= ( neq @ sk1 @ nil ) ),
inference(paramod_ordered,[status(thm)],[102,104]) ).
thf(510,plain,
( ( sk2 != sk1 )
| ( nil != nil ) ),
inference(simp,[status(thm)],[509]) ).
thf(511,plain,
sk2 != sk1,
inference(simp,[status(thm)],[510]) ).
thf(110,plain,
( ( nil = sk4 )
| ( neq @ sk3 @ nil ) ),
inference(cnf,[status(esa)],[98]) ).
thf(112,plain,
( ( sk4 = nil )
| ( neq @ sk3 @ nil ) ),
inference(lifteq,[status(thm)],[110]) ).
thf(109,plain,
sk2 = sk4,
inference(cnf,[status(esa)],[98]) ).
thf(114,plain,
sk4 = sk2,
inference(lifteq,[status(thm)],[109]) ).
thf(525,plain,
( ( sk2 = nil )
| ( neq @ sk1 @ nil ) ),
inference(rewrite,[status(thm)],[112,113,114]) ).
thf(538,plain,
( ( sk2 = nil )
| ( ( neq @ sk1 @ nil )
!= ( neq @ sk1 @ nil ) ) ),
inference(paramod_ordered,[status(thm)],[525,104]) ).
thf(539,plain,
sk2 = nil,
inference(pattern_uni,[status(thm)],[538:[]]) ).
thf(555,plain,
sk1 != nil,
inference(rewrite,[status(thm)],[511,539]) ).
thf(561,plain,
neq @ sk1 @ nil,
inference(simplifyReflect,[status(thm)],[560,555]) ).
thf(562,plain,
~ $true,
inference(rewrite,[status(thm)],[104,561]) ).
thf(563,plain,
$false,
inference(simp,[status(thm)],[562]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC208+1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n015.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Sun May 19 03:04:24 EDT 2024
% 0.16/0.37 % CPUTime :
% 1.07/0.93 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.56/1.11 % [INFO] Parsing done (183ms).
% 1.56/1.12 % [INFO] Running in sequential loop mode.
% 2.00/1.31 % [INFO] nitpick registered as external prover.
% 2.00/1.32 % [INFO] Scanning for conjecture ...
% 2.20/1.39 % [INFO] Found a conjecture (or negated_conjecture) and 95 axioms. Running axiom selection ...
% 2.20/1.45 % [INFO] Axiom selection finished. Selected 95 axioms (removed 0 axioms).
% 2.76/1.53 % [INFO] Problem is first-order (TPTP FOF).
% 2.76/1.54 % [INFO] Type checking passed.
% 2.76/1.55 % [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 ...
% 5.82/2.47 % [INFO] Killing All external provers ...
% 5.82/2.47 % Time passed: 1930ms (effective reasoning time: 1345ms)
% 5.82/2.47 % 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)>
% 5.82/2.47 % Axioms used in derivation (0):
% 5.82/2.47 % No. of inferences in proof: 24
% 5.82/2.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1930 ms resp. 1345 ms w/o parsing
% 5.82/2.49 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.82/2.49 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------