TSTP Solution File: SWC035+1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SWC035+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n017.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:33:47 EDT 2024
% Result : Theorem 7.27s 3.43s
% Output : Refutation 7.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 13 unt; 6 typ; 0 def)
% Number of atoms : 40 ( 27 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 52 ( 16 ~; 12 |; 0 &; 12 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 12 ( 0 ^ 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(ssList_type,type,
ssList: $i > $o ).
thf(nil_type,type,
nil: $i ).
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 )
=> ( ( nil != B )
| ( B != D )
| ( A != C )
| ( D != C )
| ( nil = A ) ) ) ) ) ),
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 )
=> ( ( nil != B )
| ( B != D )
| ( A != C )
| ( D != C )
| ( nil = 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 )
=> ( ( nil != B )
| ( B != D )
| ( A != C )
| ( D != C )
| ( nil = A ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(104,plain,
sk2 = sk4,
inference(cnf,[status(esa)],[98]) ).
thf(112,plain,
sk4 = sk2,
inference(lifteq,[status(thm)],[104]) ).
thf(107,plain,
sk4 = sk3,
inference(cnf,[status(esa)],[98]) ).
thf(110,plain,
sk4 = sk3,
inference(lifteq,[status(thm)],[107]) ).
thf(103,plain,
sk1 = sk3,
inference(cnf,[status(esa)],[98]) ).
thf(109,plain,
sk3 = sk1,
inference(lifteq,[status(thm)],[103]) ).
thf(504,plain,
sk4 = sk1,
inference(rewrite,[status(thm)],[110,109]) ).
thf(99,plain,
nil = sk2,
inference(cnf,[status(esa)],[98]) ).
thf(111,plain,
sk2 = nil,
inference(lifteq,[status(thm)],[99]) ).
thf(507,plain,
sk1 = nil,
inference(rewrite,[status(thm)],[112,504,111]) ).
thf(105,plain,
nil != sk1,
inference(cnf,[status(esa)],[98]) ).
thf(108,plain,
sk1 != nil,
inference(lifteq,[status(thm)],[105]) ).
thf(508,plain,
$false,
inference(simplifyReflect,[status(thm)],[507,108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC035+1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.12 % Command : run_Leo-III %s %d
% 0.11/0.33 % Computer : n017.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 03:52:39 EDT 2024
% 0.11/0.33 % CPUTime :
% 1.00/0.98 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.64/1.22 % [INFO] Parsing done (238ms).
% 1.64/1.23 % [INFO] Running in sequential loop mode.
% 2.16/1.61 % [INFO] nitpick registered as external prover.
% 2.16/1.62 % [INFO] Scanning for conjecture ...
% 2.50/1.74 % [INFO] Found a conjecture (or negated_conjecture) and 95 axioms. Running axiom selection ...
% 2.83/1.84 % [INFO] Axiom selection finished. Selected 95 axioms (removed 0 axioms).
% 3.22/1.98 % [INFO] Problem is first-order (TPTP FOF).
% 3.22/2.00 % [INFO] Type checking passed.
% 3.22/2.00 % [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.27/3.42 % [INFO] Killing All external provers ...
% 7.27/3.42 % Time passed: 2940ms (effective reasoning time: 2184ms)
% 7.27/3.42 % 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.27/3.43 % Axioms used in derivation (0):
% 7.27/3.43 % No. of inferences in proof: 16
% 7.27/3.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2940 ms resp. 2184 ms w/o parsing
% 7.27/3.45 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.27/3.45 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------