TSTP Solution File: SWW410-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWW410-1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 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 : Wed May 31 12:44:54 EDT 2023
% Result : Unsatisfiable 16.44s 2.46s
% Output : CNFRefutation 16.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 51 ( 15 unt; 0 def)
% Number of atoms : 99 ( 22 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 91 ( 43 ~; 44 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 70 (; 70 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [S,T,Sigma] : sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Sigma] : sep(lseg(X,X),Sigma) = Sigma,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Y,Z,Sigma] :
( ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))
| X = Y
| heap(sep(lseg(X,Z),Sigma)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [X,Y,Sigma] :
( ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))
| heap(sep(lseg(X,nil),Sigma)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X,Y,Z,W,Sigma] :
( ~ heap(sep(lseg(X,Y),sep(lseg(Y,Z),sep(lseg(Z,W),Sigma))))
| Z = W
| heap(sep(lseg(X,Z),sep(lseg(Z,W),Sigma))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,hypothesis,
x1 != x3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,hypothesis,
heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,negated_conjecture,
~ heap(sep(lseg(x3,nil),sep(lseg(x2,x3),emp))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,plain,
! [X0,X1,X2] : sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f19,plain,
! [X0,X1] : sep(lseg(X0,X0),X1) = X1,
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f28,plain,
! [X,Z,Sigma] :
( ! [Y] :
( ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))
| X = Y )
| heap(sep(lseg(X,Z),Sigma)) ),
inference(miniscoping,[status(esa)],[f8]) ).
fof(f29,plain,
! [X0,X1,X2,X3] :
( ~ heap(sep(next(X0,X1),sep(lseg(X1,X2),X3)))
| X0 = X1
| heap(sep(lseg(X0,X2),X3)) ),
inference(cnf_transformation,[status(esa)],[f28]) ).
fof(f30,plain,
! [X,Sigma] :
( ! [Y] : ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))
| heap(sep(lseg(X,nil),Sigma)) ),
inference(miniscoping,[status(esa)],[f9]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ~ heap(sep(lseg(X0,X1),sep(lseg(X1,nil),X2)))
| heap(sep(lseg(X0,nil),X2)) ),
inference(cnf_transformation,[status(esa)],[f30]) ).
fof(f34,plain,
! [X,Z,W,Sigma] :
( ! [Y] : ~ heap(sep(lseg(X,Y),sep(lseg(Y,Z),sep(lseg(Z,W),Sigma))))
| Z = W
| heap(sep(lseg(X,Z),sep(lseg(Z,W),Sigma))) ),
inference(miniscoping,[status(esa)],[f11]) ).
fof(f35,plain,
! [X0,X1,X2,X3,X4] :
( ~ heap(sep(lseg(X0,X1),sep(lseg(X1,X2),sep(lseg(X2,X3),X4))))
| X2 = X3
| heap(sep(lseg(X0,X2),sep(lseg(X2,X3),X4))) ),
inference(cnf_transformation,[status(esa)],[f34]) ).
fof(f38,plain,
x1 != x3,
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f40,plain,
heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f41,plain,
~ heap(sep(lseg(x3,nil),sep(lseg(x2,x3),emp))),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f52,plain,
! [X0,X1,X2,X3] : sep(X0,sep(X1,sep(X2,X3))) = sep(X2,sep(X0,sep(X1,X3))),
inference(paramodulation,[status(thm)],[f18,f18]) ).
fof(f59,plain,
~ heap(sep(lseg(x2,x3),sep(lseg(x3,nil),emp))),
inference(paramodulation,[status(thm)],[f18,f41]) ).
fof(f152,plain,
! [X0,X1,X2] :
( ~ heap(sep(lseg(X0,nil),sep(lseg(X1,X0),X2)))
| heap(sep(lseg(X1,nil),X2)) ),
inference(paramodulation,[status(thm)],[f18,f31]) ).
fof(f156,plain,
! [X0,X1,X2,X3] :
( ~ heap(sep(lseg(X0,X1),sep(X2,sep(lseg(X1,nil),X3))))
| heap(sep(lseg(X0,nil),sep(X2,X3))) ),
inference(paramodulation,[status(thm)],[f18,f31]) ).
fof(f160,plain,
! [X0,X1,X2,X3,X4] :
( ~ heap(sep(lseg(X0,X1),sep(lseg(X2,X0),sep(lseg(X1,X3),X4))))
| X1 = X3
| heap(sep(lseg(X2,X1),sep(lseg(X1,X3),X4))) ),
inference(paramodulation,[status(thm)],[f18,f35]) ).
fof(f238,plain,
! [X0,X1,X2] :
( ~ heap(sep(next(X0,X1),X2))
| X0 = X1
| heap(sep(lseg(X0,X1),X2)) ),
inference(paramodulation,[status(thm)],[f19,f29]) ).
fof(f771,plain,
! [X0,X1,X2,X3,X4] :
( ~ heap(sep(X0,sep(X1,sep(next(X2,X3),X4))))
| X2 = X3
| heap(sep(lseg(X2,X3),sep(X0,sep(X1,X4)))) ),
inference(paramodulation,[status(thm)],[f52,f238]) ).
fof(f11815,plain,
( spl0_6
<=> x1 = x3 ),
introduced(split_symbol_definition) ).
fof(f11816,plain,
( x1 = x3
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f11815]) ).
fof(f11818,plain,
( spl0_7
<=> heap(sep(lseg(x1,x3),sep(lseg(x2,x1),sep(lseg(x3,nil),emp)))) ),
introduced(split_symbol_definition) ).
fof(f11819,plain,
( heap(sep(lseg(x1,x3),sep(lseg(x2,x1),sep(lseg(x3,nil),emp))))
| ~ spl0_7 ),
inference(component_clause,[status(thm)],[f11818]) ).
fof(f11821,plain,
( x1 = x3
| heap(sep(lseg(x1,x3),sep(lseg(x2,x1),sep(lseg(x3,nil),emp)))) ),
inference(resolution,[status(thm)],[f771,f40]) ).
fof(f11822,plain,
( spl0_6
| spl0_7 ),
inference(split_clause,[status(thm)],[f11821,f11815,f11818]) ).
fof(f11911,plain,
( $false
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f11816,f38]) ).
fof(f11912,plain,
~ spl0_6,
inference(contradiction_clause,[status(thm)],[f11911]) ).
fof(f12059,plain,
( spl0_8
<=> x3 = nil ),
introduced(split_symbol_definition) ).
fof(f12060,plain,
( x3 = nil
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f12059]) ).
fof(f12062,plain,
( spl0_9
<=> heap(sep(lseg(x2,x3),sep(lseg(x3,nil),emp))) ),
introduced(split_symbol_definition) ).
fof(f12063,plain,
( heap(sep(lseg(x2,x3),sep(lseg(x3,nil),emp)))
| ~ spl0_9 ),
inference(component_clause,[status(thm)],[f12062]) ).
fof(f12065,plain,
( x3 = nil
| heap(sep(lseg(x2,x3),sep(lseg(x3,nil),emp)))
| ~ spl0_7 ),
inference(resolution,[status(thm)],[f11819,f160]) ).
fof(f12066,plain,
( spl0_8
| spl0_9
| ~ spl0_7 ),
inference(split_clause,[status(thm)],[f12065,f12059,f12062,f11818]) ).
fof(f12067,plain,
( heap(sep(lseg(x1,nil),sep(lseg(x2,x1),emp)))
| ~ spl0_7 ),
inference(resolution,[status(thm)],[f11819,f156]) ).
fof(f12080,plain,
( ~ heap(sep(lseg(x2,x3),sep(lseg(nil,nil),emp)))
| ~ spl0_8 ),
inference(backward_demodulation,[status(thm)],[f12060,f59]) ).
fof(f12081,plain,
( ~ heap(sep(lseg(nil,nil),sep(lseg(x2,x3),emp)))
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f18,f12080]) ).
fof(f12082,plain,
( ~ heap(sep(lseg(x2,x3),emp))
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f19,f12081]) ).
fof(f12083,plain,
( ~ heap(sep(lseg(x2,nil),emp))
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f12060,f12082]) ).
fof(f12090,plain,
( heap(sep(lseg(x2,nil),emp))
| ~ spl0_7 ),
inference(resolution,[status(thm)],[f12067,f152]) ).
fof(f12091,plain,
( $false
| ~ spl0_8
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f12090,f12083]) ).
fof(f12092,plain,
( ~ spl0_8
| ~ spl0_7 ),
inference(contradiction_clause,[status(thm)],[f12091]) ).
fof(f12099,plain,
( $false
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f59,f12063]) ).
fof(f12100,plain,
~ spl0_9,
inference(contradiction_clause,[status(thm)],[f12099]) ).
fof(f12101,plain,
$false,
inference(sat_refutation,[status(thm)],[f11822,f11912,f12066,f12092,f12100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW410-1 : TPTP v8.1.2. Released v5.2.0.
% 0.12/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n017.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 : Tue May 30 10:23:25 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.35 % Drodi V3.5.1
% 16.44/2.46 % Refutation found
% 16.44/2.46 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 16.44/2.46 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 16.44/2.50 % Elapsed time: 2.143546 seconds
% 16.44/2.50 % CPU time: 16.911957 seconds
% 16.44/2.50 % Memory used: 183.487 MB
%------------------------------------------------------------------------------