TSTP Solution File: SWW399-1 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SWW399-1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n011.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 : Mon Jun 24 18:25:04 EDT 2024
% Result : Unsatisfiable 92.17s 15.76s
% Output : Refutation 92.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 6
% Syntax : Number of formulae : 42 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 67 ( 39 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 364 ( 23 ~; 23 |; 0 &; 318 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 88 ( 0 ^ 88 !; 0 ?; 88 :)
% Comments :
%------------------------------------------------------------------------------
thf(heap_type,type,
heap: $i > $o ).
thf(sep_type,type,
sep: $i > $i > $i ).
thf(lseg_type,type,
lseg: $i > $i > $i ).
thf(x1_type,type,
x1: $i ).
thf(nil_type,type,
nil: $i ).
thf(emp_type,type,
emp: $i ).
thf(next_type,type,
next: $i > $i > $i ).
thf(2,axiom,
! [C: $i,B: $i,A: $i] :
( ( sep @ A @ ( sep @ B @ C ) )
= ( sep @ B @ ( sep @ A @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associative_commutative) ).
thf(17,plain,
! [C: $i,B: $i,A: $i] :
( ( sep @ A @ ( sep @ B @ C ) )
= ( sep @ B @ ( sep @ A @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(18,plain,
! [C: $i,B: $i,A: $i] :
( ( sep @ A @ ( sep @ B @ C ) )
= ( sep @ B @ ( sep @ A @ C ) ) ),
inference(lifteq,[status(thm)],[17]) ).
thf(3,axiom,
! [B: $i,A: $i] :
( ( sep @ ( lseg @ A @ A ) @ B )
= B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',normalization) ).
thf(19,plain,
! [B: $i,A: $i] :
( ( sep @ ( lseg @ A @ A ) @ B )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(20,plain,
! [B: $i,A: $i] :
( ( sep @ ( lseg @ A @ A ) @ B )
= B ),
inference(lifteq,[status(thm)],[19]) ).
thf(96,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( B
= ( sep @ D @ ( sep @ C @ E ) ) )
| ( ( sep @ ( lseg @ A @ A ) @ B )
!= ( sep @ C @ ( sep @ D @ E ) ) ) ),
inference(paramod_ordered,[status(thm)],[20,18]) ).
thf(97,plain,
! [C: $i,B: $i,A: $i] :
( ( sep @ B @ ( sep @ ( lseg @ A @ A ) @ C ) )
= ( sep @ B @ C ) ),
inference(pattern_uni,[status(thm)],[96:[bind(A,$thf( G )),bind(B,$thf( sep @ H @ I )),bind(C,$thf( lseg @ G @ G )),bind(D,$thf( H )),bind(E,$thf( I ))]]) ).
thf(114,plain,
! [C: $i,B: $i,A: $i] :
( ( sep @ B @ ( sep @ ( lseg @ A @ A ) @ C ) )
= ( sep @ B @ C ) ),
inference(simp,[status(thm)],[97]) ).
thf(199,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( sep @ B @ C )
= E )
| ( ( sep @ B @ ( sep @ ( lseg @ A @ A ) @ C ) )
!= ( sep @ ( lseg @ D @ D ) @ E ) ) ),
inference(paramod_ordered,[status(thm)],[114,20]) ).
thf(200,plain,
! [C: $i,B: $i,A: $i] :
( ( sep @ ( lseg @ A @ A ) @ B )
= ( sep @ ( lseg @ C @ C ) @ B ) ),
inference(pattern_uni,[status(thm)],[199:[bind(A,$thf( K )),bind(B,$thf( lseg @ G @ G )),bind(C,$thf( I )),bind(D,$thf( G )),bind(E,$thf( sep @ ( lseg @ K @ K ) @ I ))]]) ).
thf(215,plain,
! [C: $i,B: $i,A: $i] :
( ( sep @ ( lseg @ A @ A ) @ B )
= ( sep @ ( lseg @ C @ C ) @ B ) ),
inference(simp,[status(thm)],[200]) ).
thf(9630,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( sep @ ( lseg @ C @ C ) @ B )
= E )
| ( ( sep @ ( lseg @ A @ A ) @ B )
!= ( sep @ ( lseg @ D @ D ) @ E ) ) ),
inference(paramod_ordered,[status(thm)],[215,20]) ).
thf(9631,plain,
! [B: $i,A: $i] :
( ( sep @ ( lseg @ B @ B ) @ A )
= A ),
inference(pattern_uni,[status(thm)],[9630:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( A )),bind(E,$thf( B ))]]) ).
thf(10143,plain,
! [B: $i,A: $i] :
( ( sep @ ( lseg @ B @ B ) @ A )
= A ),
inference(simp,[status(thm)],[9631]) ).
thf(14,axiom,
heap @ ( sep @ ( next @ x1 @ nil ) @ emp ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_2) ).
thf(47,plain,
heap @ ( sep @ ( next @ x1 @ nil ) @ emp ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(91,plain,
! [C: $i,B: $i,A: $i] :
( ( heap @ ( sep @ A @ ( sep @ B @ C ) ) )
| ( ( sep @ B @ ( sep @ A @ C ) )
!= ( sep @ ( next @ x1 @ nil ) @ emp ) ) ),
inference(paramod_ordered,[status(thm)],[18,47]) ).
thf(112,plain,
! [C: $i,B: $i,A: $i] :
( ( heap @ ( sep @ A @ ( sep @ B @ C ) ) )
| ( B
!= ( next @ x1 @ nil ) )
| ( ( sep @ A @ C )
!= emp ) ),
inference(simp,[status(thm)],[91]) ).
thf(128,plain,
! [B: $i,A: $i] :
( ( heap @ ( sep @ A @ ( sep @ ( next @ x1 @ nil ) @ B ) ) )
| ( ( sep @ A @ B )
!= emp ) ),
inference(simp,[status(thm)],[112]) ).
thf(25396,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( heap @ ( sep @ C @ ( sep @ ( next @ x1 @ nil ) @ D ) ) )
| ( A != emp )
| ( ( sep @ ( lseg @ B @ B ) @ A )
!= ( sep @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[10143,128]) ).
thf(25397,plain,
! [B: $i,A: $i] :
( ( heap @ ( sep @ ( lseg @ B @ B ) @ ( sep @ ( next @ x1 @ nil ) @ A ) ) )
| ( A != emp ) ),
inference(pattern_uni,[status(thm)],[25396:[bind(A,$thf( A )),bind(B,$thf( F )),bind(C,$thf( lseg @ F @ F )),bind(D,$thf( A ))]]) ).
thf(25597,plain,
! [A: $i] : ( heap @ ( sep @ ( lseg @ A @ A ) @ ( sep @ ( next @ x1 @ nil ) @ emp ) ) ),
inference(simp,[status(thm)],[25397]) ).
thf(26428,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( heap @ ( sep @ B @ ( sep @ A @ C ) ) )
| ( ( sep @ A @ ( sep @ B @ C ) )
!= ( sep @ ( lseg @ D @ D ) @ ( sep @ ( next @ x1 @ nil ) @ emp ) ) ) ),
inference(paramod_ordered,[status(thm)],[18,25597]) ).
thf(26429,plain,
! [A: $i] : ( heap @ ( sep @ ( next @ x1 @ nil ) @ ( sep @ ( lseg @ A @ A ) @ emp ) ) ),
inference(pattern_uni,[status(thm)],[26428:[bind(A,$thf( lseg @ F @ F )),bind(B,$thf( next @ x1 @ nil )),bind(C,$thf( emp )),bind(D,$thf( F ))]]) ).
thf(26604,plain,
! [A: $i] : ( heap @ ( sep @ ( next @ x1 @ nil ) @ ( sep @ ( lseg @ A @ A ) @ emp ) ) ),
inference(simp,[status(thm)],[26429]) ).
thf(9,axiom,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( heap @ ( sep @ ( next @ A @ B ) @ ( sep @ ( lseg @ B @ C ) @ D ) ) )
| ( A = B )
| ( heap @ ( sep @ ( lseg @ A @ C ) @ D ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unfolding_2) ).
thf(34,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( heap @ ( sep @ ( next @ A @ B ) @ ( sep @ ( lseg @ B @ C ) @ D ) ) )
| ( A = B )
| ( heap @ ( sep @ ( lseg @ A @ C ) @ D ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(35,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( heap @ ( sep @ ( next @ A @ B ) @ ( sep @ ( lseg @ B @ C ) @ D ) ) )
| ( A = B )
| ( heap @ ( sep @ ( lseg @ A @ C ) @ D ) ) ),
inference(cnf,[status(esa)],[34]) ).
thf(36,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A = B )
| ~ ( heap @ ( sep @ ( next @ A @ B ) @ ( sep @ ( lseg @ B @ C ) @ D ) ) )
| ( heap @ ( sep @ ( lseg @ A @ C ) @ D ) ) ),
inference(lifteq,[status(thm)],[35]) ).
thf(31221,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( B = C )
| ( heap @ ( sep @ ( lseg @ B @ D ) @ E ) )
| ( ( heap @ ( sep @ ( next @ x1 @ nil ) @ ( sep @ ( lseg @ A @ A ) @ emp ) ) )
!= ( heap @ ( sep @ ( next @ B @ C ) @ ( sep @ ( lseg @ C @ D ) @ E ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[26604,36]) ).
thf(31222,plain,
( ( nil = x1 )
| ( heap @ ( sep @ ( lseg @ x1 @ nil ) @ emp ) ) ),
inference(pattern_uni,[status(thm)],[31221:[bind(A,$thf( nil )),bind(B,$thf( x1 )),bind(C,$thf( nil )),bind(D,$thf( nil )),bind(E,$thf( emp ))]]) ).
thf(1,negated_conjecture,
~ ( heap @ ( sep @ ( lseg @ x1 @ nil ) @ emp ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conclusion_1) ).
thf(15,plain,
~ ( heap @ ( sep @ ( lseg @ x1 @ nil ) @ emp ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(16,plain,
~ ( heap @ ( sep @ ( lseg @ x1 @ nil ) @ emp ) ),
inference(polarity_switch,[status(thm)],[15]) ).
thf(32279,plain,
( ( nil = x1 )
| $false ),
inference(rewrite,[status(thm)],[31222,16]) ).
thf(32280,plain,
nil = x1,
inference(simp,[status(thm)],[32279]) ).
thf(13,axiom,
nil != x1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_1) ).
thf(44,plain,
nil != x1,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(45,plain,
nil != x1,
inference(polarity_switch,[status(thm)],[44]) ).
thf(46,plain,
nil != x1,
inference(lifteq,[status(thm)],[45]) ).
thf(32281,plain,
$false,
inference(simplifyReflect,[status(thm)],[32280,46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : SWW399-1 : TPTP v8.2.0. Released v5.2.0.
% 0.07/0.09 % Command : run_Leo-III %s %d SAT
% 0.08/0.29 % Computer : n011.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Wed Jun 19 05:37:55 EDT 2024
% 0.08/0.29 % CPUTime :
% 0.89/0.91 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.27/1.07 % [INFO] Parsing done (162ms).
% 1.35/1.09 % [INFO] Running in sequential loop mode.
% 1.91/1.44 % [INFO] nitpick registered as external prover.
% 1.91/1.45 % [INFO] Scanning for conjecture ...
% 2.11/1.53 % [INFO] Found a conjecture (or negated_conjecture) and 13 axioms. Running axiom selection ...
% 2.11/1.56 % [INFO] Axiom selection finished. Selected 13 axioms (removed 0 axioms).
% 2.21/1.59 % [INFO] Problem is propositional (TPTP CNF).
% 2.21/1.60 % [INFO] Type checking passed.
% 2.21/1.61 % [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 ...
% 92.17/15.75 % [INFO] Killing All external provers ...
% 92.17/15.76 % Time passed: 15295ms (effective reasoning time: 14663ms)
% 92.17/15.76 % Axioms used in derivation (5): premise_2, associative_commutative, normalization, unfolding_2, premise_1
% 92.17/15.76 % No. of inferences in proof: 42
% 92.17/15.76 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 15295 ms resp. 14663 ms w/o parsing
% 92.17/15.78 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 92.17/15.78 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------