TSTP Solution File: SYN256-1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : SYN256-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n016.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 7 11:01:22 EDT 2024
% Result : Unsatisfiable 231.35s 41.60s
% Output : Refutation 231.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 17
% Syntax : Number of formulae : 44 ( 16 unt; 9 typ; 0 def)
% Number of atoms : 76 ( 4 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 202 ( 36 ~; 33 |; 0 &; 133 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 47 ( 0 ^ 47 !; 0 ?; 47 :)
% Comments :
%------------------------------------------------------------------------------
thf(n2_type,type,
n2: $i > $o ).
thf(c_type,type,
c: $i ).
thf(a_type,type,
a: $i ).
thf(r0_type,type,
r0: $i > $o ).
thf(p0_type,type,
p0: $i > $i > $o ).
thf(l0_type,type,
l0: $i > $o ).
thf(p1_type,type,
p1: $i > $i > $i > $o ).
thf(b_type,type,
b: $i ).
thf(s0_type,type,
s0: $i > $o ).
thf(182,axiom,
l0 @ a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_20) ).
thf(715,plain,
l0 @ a,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[182]) ).
thf(353,axiom,
p0 @ c @ b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_18) ).
thf(1039,plain,
p0 @ c @ b,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[353]) ).
thf(193,axiom,
! [B: $i,A: $i] :
( ( p1 @ A @ A @ B )
| ~ ( p0 @ B @ A )
| ~ ( r0 @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_074) ).
thf(735,plain,
! [B: $i,A: $i] :
( ( p1 @ A @ A @ B )
| ~ ( p0 @ B @ A )
| ~ ( r0 @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[193]) ).
thf(736,plain,
! [B: $i,A: $i] :
( ( p1 @ A @ A @ B )
| ~ ( p0 @ B @ A )
| ~ ( r0 @ A ) ),
inference(cnf,[status(esa)],[735]) ).
thf(18589,plain,
! [B: $i,A: $i] :
( ( p1 @ A @ A @ B )
| ~ ( r0 @ A )
| ( ( p0 @ c @ b )
!= ( p0 @ B @ A ) ) ),
inference(paramod_ordered,[status(thm)],[1039,736]) ).
thf(18590,plain,
( ( p1 @ b @ b @ c )
| ~ ( r0 @ b ) ),
inference(pattern_uni,[status(thm)],[18589:[bind(A,$thf( b )),bind(B,$thf( c ))]]) ).
thf(43,axiom,
r0 @ b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
thf(450,plain,
r0 @ b,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[43]) ).
thf(19143,plain,
( ( p1 @ b @ b @ c )
| ~ $true ),
inference(rewrite,[status(thm)],[18590,450]) ).
thf(19144,plain,
p1 @ b @ b @ c,
inference(simp,[status(thm)],[19143]) ).
thf(116,axiom,
! [D: $i,C: $i,B: $i,A: $i] :
( ( p1 @ A @ B @ A )
| ~ ( l0 @ C )
| ~ ( p1 @ B @ D @ A )
| ~ ( s0 @ b ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_071) ).
thf(587,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( p1 @ A @ B @ A )
| ~ ( l0 @ C )
| ~ ( p1 @ B @ D @ A )
| ~ ( s0 @ b ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[116]) ).
thf(588,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( p1 @ A @ B @ A )
| ~ ( l0 @ C )
| ~ ( p1 @ B @ D @ A )
| ~ ( s0 @ b ) ),
inference(cnf,[status(esa)],[587]) ).
thf(75,axiom,
s0 @ b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
thf(511,plain,
s0 @ b,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[75]) ).
thf(9176,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( p1 @ A @ B @ A )
| ~ ( l0 @ C )
| ~ ( p1 @ B @ D @ A )
| ~ $true ),
inference(rewrite,[status(thm)],[588,511]) ).
thf(9177,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( p1 @ A @ B @ A )
| ~ ( l0 @ C )
| ~ ( p1 @ B @ D @ A ) ),
inference(simp,[status(thm)],[9176]) ).
thf(19154,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( p1 @ A @ B @ A )
| ~ ( l0 @ C )
| ( ( p1 @ b @ b @ c )
!= ( p1 @ B @ D @ A ) ) ),
inference(paramod_ordered,[status(thm)],[19144,9177]) ).
thf(19155,plain,
! [A: $i] :
( ( p1 @ c @ b @ c )
| ~ ( l0 @ A ) ),
inference(pattern_uni,[status(thm)],[19154:[bind(A,$thf( c )),bind(B,$thf( b )),bind(C,$thf( C )),bind(D,$thf( b ))]]) ).
thf(19188,plain,
! [A: $i] :
( ( p1 @ c @ b @ c )
| ~ ( l0 @ A ) ),
inference(simp,[status(thm)],[19155]) ).
thf(26381,plain,
! [A: $i] :
( ( p1 @ c @ b @ c )
| ( ( l0 @ a )
!= ( l0 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[715,19188]) ).
thf(26382,plain,
p1 @ c @ b @ c,
inference(pattern_uni,[status(thm)],[26381:[bind(A,$thf( a ))]]) ).
thf(322,axiom,
! [C: $i,B: $i,A: $i] :
( ( n2 @ A )
| ~ ( p1 @ B @ C @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_137) ).
thf(979,plain,
! [C: $i,B: $i,A: $i] :
( ( n2 @ A )
| ~ ( p1 @ B @ C @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[322]) ).
thf(980,plain,
! [C: $i,B: $i,A: $i] :
( ( n2 @ A )
| ~ ( p1 @ B @ C @ A ) ),
inference(cnf,[status(esa)],[979]) ).
thf(36756,plain,
! [C: $i,B: $i,A: $i] :
( ( n2 @ A )
| ( ( p1 @ c @ b @ c )
!= ( p1 @ B @ C @ A ) ) ),
inference(paramod_ordered,[status(thm)],[26382,980]) ).
thf(36757,plain,
n2 @ c,
inference(pattern_uni,[status(thm)],[36756:[bind(A,$thf( c )),bind(B,$thf( c )),bind(C,$thf( b ))]]) ).
thf(1,negated_conjecture,
~ ( n2 @ c ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(370,plain,
~ ( n2 @ c ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(371,plain,
~ ( n2 @ c ),
inference(polarity_switch,[status(thm)],[370]) ).
thf(36859,plain,
$false,
inference(rewrite,[status(thm)],[36757,371]) ).
thf(36860,plain,
$false,
inference(simp,[status(thm)],[36859]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYN256-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.11 % Command : run_Leo-III %s %d
% 0.11/0.31 % Computer : n016.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 6 21:04:54 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.84/0.80 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.40/0.98 % [INFO] Parsing done (184ms).
% 1.40/0.99 % [INFO] Running in sequential loop mode.
% 2.06/1.20 % [INFO] nitpick registered as external prover.
% 2.06/1.20 % [INFO] Scanning for conjecture ...
% 2.32/1.29 % [INFO] Found a conjecture and 368 axioms. Running axiom selection ...
% 2.75/1.39 % [INFO] Axiom selection finished. Selected 368 axioms (removed 0 axioms).
% 2.93/1.50 % [INFO] Problem is propositional (TPTP CNF).
% 3.17/1.51 % [INFO] Type checking passed.
% 3.17/1.52 % [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 ...
% 231.14/41.59 % [INFO] Killing All external provers ...
% 231.35/41.60 % Time passed: 41150ms (effective reasoning time: 40601ms)
% 231.35/41.60 % 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)>
% 231.35/41.60 % Axioms used in derivation (7): rule_071, rule_074, axiom_5, axiom_18, axiom_9, axiom_20, rule_137
% 231.35/41.60 % No. of inferences in proof: 35
% 231.35/41.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 41150 ms resp. 40601 ms w/o parsing
% 231.35/41.62 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 231.35/41.62 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------