TSTP Solution File: SWW417-1 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SWW417-1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n009.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:06 EDT 2024
% Result : Unsatisfiable 88.25s 14.87s
% Output : Refutation 88.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 62 ( 32 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 400 ( 22 ~; 22 |; 0 &; 356 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 74 ( 0 ^ 74 !; 0 ?; 74 :)
% 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(x2_type,type,
x2: $i ).
thf(3,axiom,
! [B: $i,A: $i] :
( ( sep @ ( lseg @ A @ A ) @ B )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',normalization) ).
thf(20,plain,
! [B: $i,A: $i] :
( ( sep @ ( lseg @ A @ A ) @ B )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(21,plain,
! [B: $i,A: $i] :
( ( sep @ ( lseg @ A @ A ) @ B )
= B ),
inference(lifteq,[status(thm)],[20]) ).
thf(2,axiom,
! [C: $i,B: $i,A: $i] :
( ( sep @ A @ ( sep @ B @ C ) )
= ( sep @ B @ ( sep @ A @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associative_commutative) ).
thf(18,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(19,plain,
! [C: $i,B: $i,A: $i] :
( ( sep @ A @ ( sep @ B @ C ) )
= ( sep @ B @ ( sep @ A @ C ) ) ),
inference(lifteq,[status(thm)],[18]) ).
thf(113,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( sep @ D @ ( sep @ B @ ( sep @ A @ C ) ) )
= ( sep @ E @ ( sep @ D @ F ) ) )
| ( ( sep @ A @ ( sep @ B @ C ) )
!= ( sep @ E @ F ) ) ),
inference(paramod_ordered,[status(thm)],[19,19]) ).
thf(114,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( sep @ B @ ( sep @ C @ ( sep @ A @ D ) ) )
= ( sep @ A @ ( sep @ B @ ( sep @ C @ D ) ) ) ),
inference(pattern_uni,[status(thm)],[113:[bind(A,$thf( A )),bind(B,$thf( G )),bind(C,$thf( H )),bind(D,$thf( D )),bind(E,$thf( A )),bind(F,$thf( sep @ G @ H ))]]) ).
thf(138,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( sep @ B @ ( sep @ C @ ( sep @ A @ D ) ) )
= ( sep @ A @ ( sep @ B @ ( sep @ C @ D ) ) ) ),
inference(simp,[status(thm)],[114]) ).
thf(15,axiom,
heap @ ( sep @ ( lseg @ x2 @ nil ) @ ( sep @ ( next @ x1 @ x2 ) @ emp ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_3) ).
thf(51,plain,
heap @ ( sep @ ( lseg @ x2 @ nil ) @ ( sep @ ( next @ x1 @ x2 ) @ emp ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(111,plain,
! [C: $i,B: $i,A: $i] :
( ( heap @ ( sep @ ( lseg @ x2 @ nil ) @ ( sep @ A @ ( sep @ B @ C ) ) ) )
| ( ( sep @ B @ ( sep @ A @ C ) )
!= ( sep @ ( next @ x1 @ x2 ) @ emp ) ) ),
inference(paramod_ordered,[status(thm)],[19,51]) ).
thf(130,plain,
! [C: $i,B: $i,A: $i] :
( ( heap @ ( sep @ ( lseg @ x2 @ nil ) @ ( sep @ A @ ( sep @ B @ C ) ) ) )
| ( B
!= ( next @ x1 @ x2 ) )
| ( ( sep @ A @ C )
!= emp ) ),
inference(simp,[status(thm)],[111]) ).
thf(135,plain,
! [B: $i,A: $i] :
( ( heap @ ( sep @ ( lseg @ x2 @ nil ) @ ( sep @ A @ ( sep @ ( next @ x1 @ x2 ) @ B ) ) ) )
| ( ( sep @ A @ B )
!= emp ) ),
inference(simp,[status(thm)],[130]) ).
thf(28369,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( heap @ ( sep @ ( lseg @ x2 @ nil ) @ ( sep @ C @ ( sep @ ( next @ x1 @ x2 ) @ D ) ) ) )
| ( B != emp )
| ( ( sep @ ( lseg @ A @ A ) @ B )
!= ( sep @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[21,135]) ).
thf(28370,plain,
! [B: $i,A: $i] :
( ( heap @ ( sep @ ( lseg @ x2 @ nil ) @ ( sep @ ( lseg @ B @ B ) @ ( sep @ ( next @ x1 @ x2 ) @ A ) ) ) )
| ( A != emp ) ),
inference(pattern_uni,[status(thm)],[28369:[bind(A,$thf( F )),bind(B,$thf( B )),bind(C,$thf( lseg @ F @ F )),bind(D,$thf( B ))]]) ).
thf(28797,plain,
! [A: $i] : ( heap @ ( sep @ ( lseg @ x2 @ nil ) @ ( sep @ ( lseg @ A @ A ) @ ( sep @ ( next @ x1 @ x2 ) @ emp ) ) ) ),
inference(simp,[status(thm)],[28370]) ).
thf(31047,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( heap @ ( sep @ A @ ( sep @ B @ ( sep @ C @ D ) ) ) )
| ( ( sep @ B @ ( sep @ C @ ( sep @ A @ D ) ) )
!= ( sep @ ( lseg @ x2 @ nil ) @ ( sep @ ( lseg @ E @ E ) @ ( sep @ ( next @ x1 @ x2 ) @ emp ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[138,28797]) ).
thf(31048,plain,
! [A: $i] : ( heap @ ( sep @ ( next @ x1 @ x2 ) @ ( sep @ ( lseg @ x2 @ nil ) @ ( sep @ ( lseg @ A @ A ) @ emp ) ) ) ),
inference(pattern_uni,[status(thm)],[31047:[bind(A,$thf( next @ x1 @ x2 )),bind(B,$thf( lseg @ x2 @ nil )),bind(C,$thf( lseg @ I @ I )),bind(D,$thf( emp )),bind(E,$thf( I ))]]) ).
thf(31648,plain,
! [A: $i] : ( heap @ ( sep @ ( next @ x1 @ x2 ) @ ( sep @ ( lseg @ x2 @ nil ) @ ( sep @ ( lseg @ A @ A ) @ emp ) ) ) ),
inference(simp,[status(thm)],[31048]) ).
thf(37590,plain,
! [C: $i,B: $i,A: $i] :
( ( heap @ ( sep @ ( next @ x1 @ x2 ) @ ( sep @ ( lseg @ x2 @ nil ) @ B ) ) )
| ( ( sep @ ( lseg @ A @ A ) @ B )
!= ( sep @ ( lseg @ C @ C ) @ emp ) ) ),
inference(paramod_ordered,[status(thm)],[21,31648]) ).
thf(37591,plain,
heap @ ( sep @ ( next @ x1 @ x2 ) @ ( sep @ ( lseg @ x2 @ nil ) @ emp ) ),
inference(pattern_uni,[status(thm)],[37590:[bind(A,$thf( A )),bind(B,$thf( emp )),bind(C,$thf( A ))]]) ).
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/sandbox/benchmark/theBenchmark.p',unfolding_2) ).
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(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(36,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)],[35]) ).
thf(37,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)],[36]) ).
thf(38153,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A = B )
| ( heap @ ( sep @ ( lseg @ A @ C ) @ D ) )
| ( ( heap @ ( sep @ ( next @ x1 @ x2 ) @ ( sep @ ( lseg @ x2 @ nil ) @ emp ) ) )
!= ( heap @ ( sep @ ( next @ A @ B ) @ ( sep @ ( lseg @ B @ C ) @ D ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[37591,37]) ).
thf(38154,plain,
( ( x2 = x1 )
| ( heap @ ( sep @ ( lseg @ x1 @ nil ) @ emp ) ) ),
inference(pattern_uni,[status(thm)],[38153:[bind(A,$thf( x1 )),bind(B,$thf( x2 )),bind(C,$thf( nil )),bind(D,$thf( emp ))]]) ).
thf(1,negated_conjecture,
~ ( heap @ ( sep @ ( lseg @ x1 @ nil ) @ emp ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conclusion_1) ).
thf(16,plain,
~ ( heap @ ( sep @ ( lseg @ x1 @ nil ) @ emp ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(17,plain,
~ ( heap @ ( sep @ ( lseg @ x1 @ nil ) @ emp ) ),
inference(polarity_switch,[status(thm)],[16]) ).
thf(38667,plain,
( ( x2 = x1 )
| $false ),
inference(rewrite,[status(thm)],[38154,17]) ).
thf(38668,plain,
x2 = x1,
inference(simp,[status(thm)],[38667]) ).
thf(14,axiom,
x2 != x1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_2) ).
thf(48,plain,
x2 != x1,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(49,plain,
x2 != x1,
inference(polarity_switch,[status(thm)],[48]) ).
thf(50,plain,
x2 != x1,
inference(lifteq,[status(thm)],[49]) ).
thf(38669,plain,
$false,
inference(simplifyReflect,[status(thm)],[38668,50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW417-1 : TPTP v8.2.0. Released v5.2.0.
% 0.03/0.12 % Command : run_Leo-III %s %d SAT
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jun 19 04:53:10 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.99/0.91 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.35/1.04 % [INFO] Parsing done (125ms).
% 1.35/1.05 % [INFO] Running in sequential loop mode.
% 1.77/1.25 % [INFO] nitpick registered as external prover.
% 1.77/1.26 % [INFO] Scanning for conjecture ...
% 1.98/1.31 % [INFO] Found a conjecture (or negated_conjecture) and 14 axioms. Running axiom selection ...
% 1.98/1.33 % [INFO] Axiom selection finished. Selected 14 axioms (removed 0 axioms).
% 1.98/1.35 % [INFO] Problem is propositional (TPTP CNF).
% 1.98/1.36 % [INFO] Type checking passed.
% 1.98/1.36 % [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 ...
% 88.25/14.87 % [INFO] Killing All external provers ...
% 88.25/14.87 % Time passed: 14348ms (effective reasoning time: 13817ms)
% 88.25/14.87 % Axioms used in derivation (5): premise_2, associative_commutative, normalization, premise_3, unfolding_2
% 88.25/14.87 % No. of inferences in proof: 38
% 88.25/14.87 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 14348 ms resp. 13817 ms w/o parsing
% 88.25/14.89 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 88.25/14.89 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------