TSTP Solution File: SWC359+1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SWC359+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n020.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:35:02 EDT 2024
% Result : Theorem 7.72s 3.50s
% Output : Refutation 7.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 21 ( 9 unt; 9 typ; 0 def)
% Number of atoms : 54 ( 10 equ; 0 cnn)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 124 ( 19 ~; 18 |; 12 &; 63 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 15 ( 0 ^ 12 !; 3 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(ssList_type,type,
ssList: $i > $o ).
thf(neq_type,type,
neq: $i > $i > $o ).
thf(nil_type,type,
nil: $i ).
thf(segmentP_type,type,
segmentP: $i > $i > $o ).
thf(equalelemsP_type,type,
equalelemsP: $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 )
| ~ ( segmentP @ D @ C )
| ~ ( equalelemsP @ C )
| ? [E: $i] :
( ( ssList @ E )
& ( neq @ C @ E )
& ( segmentP @ D @ E )
& ( segmentP @ E @ C )
& ( equalelemsP @ E ) )
| ( segmentP @ B @ A ) ) ) ) ) ),
file('/export/starexec/sandbox2/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 )
| ~ ( segmentP @ D @ C )
| ~ ( equalelemsP @ C )
| ? [E: $i] :
( ( ssList @ E )
& ( neq @ C @ E )
& ( segmentP @ D @ E )
& ( segmentP @ E @ C )
& ( equalelemsP @ E ) )
| ( segmentP @ B @ A ) ) ) ) ) ),
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 )
| ~ ( segmentP @ D @ C )
| ~ ( equalelemsP @ C )
| ? [E: $i] :
( ( ssList @ E )
& ( neq @ C @ E )
& ( segmentP @ D @ E )
& ( segmentP @ E @ C )
& ( equalelemsP @ E ) )
| ( segmentP @ B @ A ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(109,plain,
~ ( segmentP @ sk2 @ sk1 ),
inference(cnf,[status(esa)],[98]) ).
thf(107,plain,
segmentP @ sk4 @ sk3,
inference(cnf,[status(esa)],[98]) ).
thf(106,plain,
sk1 = sk3,
inference(cnf,[status(esa)],[98]) ).
thf(110,plain,
sk3 = sk1,
inference(lifteq,[status(thm)],[106]) ).
thf(108,plain,
sk2 = sk4,
inference(cnf,[status(esa)],[98]) ).
thf(111,plain,
sk4 = sk2,
inference(lifteq,[status(thm)],[108]) ).
thf(520,plain,
segmentP @ sk2 @ sk1,
inference(rewrite,[status(thm)],[107,110,111]) ).
thf(521,plain,
~ $true,
inference(rewrite,[status(thm)],[109,520]) ).
thf(522,plain,
$false,
inference(simp,[status(thm)],[521]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SWC359+1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.11 % Command : run_Leo-III %s %d
% 0.12/0.31 % Computer : n020.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Sun May 19 03:48:53 EDT 2024
% 0.12/0.32 % CPUTime :
% 1.02/0.95 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.59/1.21 % [INFO] Parsing done (260ms).
% 1.59/1.22 % [INFO] Running in sequential loop mode.
% 2.21/1.58 % [INFO] nitpick registered as external prover.
% 2.21/1.59 % [INFO] Scanning for conjecture ...
% 2.47/1.72 % [INFO] Found a conjecture (or negated_conjecture) and 95 axioms. Running axiom selection ...
% 2.79/1.82 % [INFO] Axiom selection finished. Selected 95 axioms (removed 0 axioms).
% 3.08/1.96 % [INFO] Problem is first-order (TPTP FOF).
% 3.21/1.99 % [INFO] Type checking passed.
% 3.21/1.99 % [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 ...
% 7.72/3.49 % [INFO] Killing All external provers ...
% 7.72/3.49 % Time passed: 3023ms (effective reasoning time: 2264ms)
% 7.72/3.49 % 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)>
% 7.72/3.49 % Axioms used in derivation (0):
% 7.72/3.49 % No. of inferences in proof: 12
% 7.72/3.50 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3023 ms resp. 2264 ms w/o parsing
% 7.72/3.52 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.72/3.52 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------