TSTP Solution File: SWW413-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWW413-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n014.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 : Thu Sep 29 20:58:33 EDT 2022
% Result : Unsatisfiable 0.21s 0.39s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 26
% Syntax : Number of formulae : 52 ( 18 unt; 8 typ; 0 def)
% Number of atoms : 143 ( 59 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 150 ( 54 ~; 76 |; 0 &)
% ( 20 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of FOOLs : 3 ( 3 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 114 ( 103 !; 0 ?; 114 :)
% Comments :
%------------------------------------------------------------------------------
tff(x3_type,type,
x3: $i ).
tff(x2_type,type,
x2: $i ).
tff(heap_type,type,
heap: $i > $o ).
tff(sep_type,type,
sep: ( $i * $i ) > $i ).
tff(emp_type,type,
emp: $i ).
tff(lseg_type,type,
lseg: ( $i * $i ) > $i ).
tff(nil_type,type,
nil: $i ).
tff(next_type,type,
next: ( $i * $i ) > $i ).
tff(1,plain,
( ( x2 = x3 )
<=> ( x3 = x2 ) ),
inference(commutativity,[status(thm)],]) ).
tff(2,plain,
( ( x3 = x2 )
<=> ( x2 = x3 ) ),
inference(symmetry,[status(thm)],[1]) ).
tff(3,plain,
( ( x3 != x2 )
<=> ( x2 != x3 ) ),
inference(monotonicity,[status(thm)],[2]) ).
tff(4,plain,
( ( x3 != x2 )
<=> ( x3 != x2 ) ),
inference(rewrite,[status(thm)],]) ).
tff(5,axiom,
x3 != x2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_3) ).
tff(6,plain,
x3 != x2,
inference(modus_ponens,[status(thm)],[5,4]) ).
tff(7,plain,
x2 != x3,
inference(modus_ponens,[status(thm)],[6,3]) ).
tff(8,plain,
^ [Sigma: $i,S: $i,T: $i] :
refl(
( ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) )
<=> ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ) )),
inference(bind,[status(th)],]) ).
tff(9,plain,
( ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) )
<=> ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ) ),
inference(quant_intro,[status(thm)],[8]) ).
tff(10,plain,
( ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) )
<=> ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(11,axiom,
! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',associative_commutative) ).
tff(12,plain,
! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ),
inference(modus_ponens,[status(thm)],[11,10]) ).
tff(13,plain,
! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ),
inference(skolemize,[status(sab)],[12]) ).
tff(14,plain,
! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ),
inference(modus_ponens,[status(thm)],[13,9]) ).
tff(15,plain,
( ~ ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) )
| ( sep(lseg(x3,nil),sep(next(x2,x3),emp)) = sep(next(x2,x3),sep(lseg(x3,nil),emp)) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(16,plain,
sep(lseg(x3,nil),sep(next(x2,x3),emp)) = sep(next(x2,x3),sep(lseg(x3,nil),emp)),
inference(unit_resolution,[status(thm)],[15,14]) ).
tff(17,plain,
sep(next(x2,x3),sep(lseg(x3,nil),emp)) = sep(lseg(x3,nil),sep(next(x2,x3),emp)),
inference(symmetry,[status(thm)],[16]) ).
tff(18,plain,
( heap(sep(next(x2,x3),sep(lseg(x3,nil),emp)))
<=> heap(sep(lseg(x3,nil),sep(next(x2,x3),emp))) ),
inference(monotonicity,[status(thm)],[17]) ).
tff(19,plain,
( heap(sep(lseg(x3,nil),sep(next(x2,x3),emp)))
<=> heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))) ),
inference(symmetry,[status(thm)],[18]) ).
tff(20,plain,
( heap(sep(lseg(x3,nil),sep(next(x2,x3),emp)))
<=> heap(sep(lseg(x3,nil),sep(next(x2,x3),emp))) ),
inference(rewrite,[status(thm)],]) ).
tff(21,axiom,
heap(sep(lseg(x3,nil),sep(next(x2,x3),emp))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_7) ).
tff(22,plain,
heap(sep(lseg(x3,nil),sep(next(x2,x3),emp))),
inference(modus_ponens,[status(thm)],[21,20]) ).
tff(23,plain,
heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))),
inference(modus_ponens,[status(thm)],[22,19]) ).
tff(24,plain,
( ~ heap(sep(lseg(x2,nil),emp))
<=> ~ heap(sep(lseg(x2,nil),emp)) ),
inference(rewrite,[status(thm)],]) ).
tff(25,axiom,
~ heap(sep(lseg(x2,nil),emp)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conclusion_1) ).
tff(26,plain,
~ heap(sep(lseg(x2,nil),emp)),
inference(modus_ponens,[status(thm)],[25,24]) ).
tff(27,plain,
^ [Sigma: $i,Z: $i,Y: $i,X: $i] :
refl(
( ( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
<=> ( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ) )),
inference(bind,[status(th)],]) ).
tff(28,plain,
( ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
<=> ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ) ),
inference(quant_intro,[status(thm)],[27]) ).
tff(29,plain,
( ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
<=> ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(30,plain,
^ [Sigma: $i,Z: $i,Y: $i,X: $i] :
rewrite(
( ( ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))
| ( X = Y )
| heap(sep(lseg(X,Z),Sigma)) )
<=> ( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ) )),
inference(bind,[status(th)],]) ).
tff(31,plain,
( ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))
| ( X = Y )
| heap(sep(lseg(X,Z),Sigma)) )
<=> ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ) ),
inference(quant_intro,[status(thm)],[30]) ).
tff(32,axiom,
! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))
| ( X = Y )
| heap(sep(lseg(X,Z),Sigma)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',unfolding_2) ).
tff(33,plain,
! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ),
inference(modus_ponens,[status(thm)],[32,31]) ).
tff(34,plain,
! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ),
inference(modus_ponens,[status(thm)],[33,29]) ).
tff(35,plain,
! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ),
inference(skolemize,[status(sab)],[34]) ).
tff(36,plain,
! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ),
inference(modus_ponens,[status(thm)],[35,28]) ).
tff(37,plain,
( ( ~ ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
| heap(sep(lseg(x2,nil),emp))
| ( x2 = x3 )
| ~ heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))) )
<=> ( ~ ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
| heap(sep(lseg(x2,nil),emp))
| ( x2 = x3 )
| ~ heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(38,plain,
( ( ( x2 = x3 )
| heap(sep(lseg(x2,nil),emp))
| ~ heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))) )
<=> ( heap(sep(lseg(x2,nil),emp))
| ( x2 = x3 )
| ~ heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(39,plain,
( ( ~ ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
| ( x2 = x3 )
| heap(sep(lseg(x2,nil),emp))
| ~ heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))) )
<=> ( ~ ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
| heap(sep(lseg(x2,nil),emp))
| ( x2 = x3 )
| ~ heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))) ) ),
inference(monotonicity,[status(thm)],[38]) ).
tff(40,plain,
( ( ~ ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
| ( x2 = x3 )
| heap(sep(lseg(x2,nil),emp))
| ~ heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))) )
<=> ( ~ ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
| heap(sep(lseg(x2,nil),emp))
| ( x2 = x3 )
| ~ heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))) ) ),
inference(transitivity,[status(thm)],[39,37]) ).
tff(41,plain,
( ~ ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
| ( x2 = x3 )
| heap(sep(lseg(x2,nil),emp))
| ~ heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))) ),
inference(quant_inst,[status(thm)],]) ).
tff(42,plain,
( ~ ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
( ( X = Y )
| heap(sep(lseg(X,Z),Sigma))
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
| heap(sep(lseg(x2,nil),emp))
| ( x2 = x3 )
| ~ heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))) ),
inference(modus_ponens,[status(thm)],[41,40]) ).
tff(43,plain,
( ( x2 = x3 )
| ~ heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))) ),
inference(unit_resolution,[status(thm)],[42,36,26]) ).
tff(44,plain,
$false,
inference(unit_resolution,[status(thm)],[43,23,7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW413-1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Sep 4 16:26:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.34 Usage: tptp [options] [-file:]file
% 0.12/0.34 -h, -? prints this message.
% 0.12/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.12/0.34 -m, -model generate model.
% 0.12/0.34 -p, -proof generate proof.
% 0.12/0.34 -c, -core generate unsat core of named formulas.
% 0.12/0.34 -st, -statistics display statistics.
% 0.12/0.34 -t:timeout set timeout (in second).
% 0.12/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.12/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.34 -<param>:<value> configuration parameter and value.
% 0.12/0.34 -o:<output-file> file to place output in.
% 0.21/0.39 % SZS status Unsatisfiable
% 0.21/0.39 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------