TSTP Solution File: SWW410-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW410-1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n022.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 Aug 22 11:07:13 EDT 2023
% Result : Unsatisfiable 44.69s 33.36s
% Output : CNFRefutation 44.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of formulae : 42 ( 20 unt; 9 typ; 0 def)
% Number of atoms : 53 ( 18 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 18 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 61 (; 61 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ heap > sep > next > lseg > #nlpp > x3 > x2 > x1 > nil > emp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(lseg,type,
lseg: ( $i * $i ) > $i ).
tff(sep,type,
sep: ( $i * $i ) > $i ).
tff(x3,type,
x3: $i ).
tff(x1,type,
x1: $i ).
tff(heap,type,
heap: $i > $o ).
tff(emp,type,
emp: $i ).
tff(next,type,
next: ( $i * $i ) > $i ).
tff(nil,type,
nil: $i ).
tff(x2,type,
x2: $i ).
tff(f_55,axiom,
! [X,Sigma] : ( sep(lseg(X,X),Sigma) = Sigma ),
file(unknown,unknown) ).
tff(f_52,axiom,
! [S,T,Sigma] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ),
file(unknown,unknown) ).
tff(f_131,axiom,
~ heap(sep(lseg(x3,nil),sep(lseg(x2,x3),emp))),
file(unknown,unknown) ).
tff(f_126,axiom,
x1 != x3,
file(unknown,unknown) ).
tff(f_129,axiom,
heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))),
file(unknown,unknown) ).
tff(f_96,axiom,
! [X,Y,Z,Sigma] :
( ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))
| ( X = Y )
| heap(sep(lseg(X,Z),Sigma)) ),
file(unknown,unknown) ).
tff(f_118,axiom,
! [Sigma,W,Z,X,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))) ),
file(unknown,unknown) ).
tff(f_102,axiom,
! [X,Y,Sigma] :
( ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))
| heap(sep(lseg(X,nil),Sigma)) ),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_4,Sigma_5] : ( sep(lseg(X_4,X_4),Sigma_5) = Sigma_5 ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_2,plain,
! [T_2,S_1,Sigma_3] : ( sep(T_2,sep(S_1,Sigma_3)) = sep(S_1,sep(T_2,Sigma_3)) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_34,plain,
~ heap(sep(lseg(x3,nil),sep(lseg(x2,x3),emp))),
inference(cnfTransformation,[status(thm)],[f_131]) ).
tff(c_35,plain,
~ heap(sep(lseg(x2,x3),sep(lseg(x3,nil),emp))),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_34]) ).
tff(c_28,plain,
x3 != x1,
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_32,plain,
heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_53,plain,
! [T_49,S_50,Sigma_51] : ( sep(T_49,sep(S_50,Sigma_51)) = sep(S_50,sep(T_49,Sigma_51)) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_120,plain,
! [T_49,T_2,S_1,Sigma_3] : ( sep(T_49,sep(T_2,sep(S_1,Sigma_3))) = sep(S_1,sep(T_49,sep(T_2,Sigma_3))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_53]) ).
tff(c_1018,plain,
! [X_109,Z_110,Sigma_111,Y_112] :
( heap(sep(lseg(X_109,Z_110),Sigma_111))
| ( Y_112 = X_109 )
| ~ heap(sep(next(X_109,Y_112),sep(lseg(Y_112,Z_110),Sigma_111))) ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_1109,plain,
! [X_118,X_119,Sigma_120] :
( heap(sep(lseg(X_118,X_119),Sigma_120))
| ( X_119 = X_118 )
| ~ heap(sep(next(X_118,X_119),Sigma_120)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_1018]) ).
tff(c_61790,plain,
! [X_568,T_571,T_569,Sigma_570,X_572] :
( heap(sep(lseg(X_572,X_568),sep(T_571,sep(T_569,Sigma_570))))
| ( X_572 = X_568 )
| ~ heap(sep(T_571,sep(T_569,sep(next(X_572,X_568),Sigma_570)))) ),
inference(superposition,[status(thm),theory(equality)],[c_120,c_1109]) ).
tff(c_62104,plain,
( heap(sep(lseg(x1,x3),sep(lseg(x2,x1),sep(lseg(x3,nil),emp))))
| ( x3 = x1 ) ),
inference(resolution,[status(thm)],[c_32,c_61790]) ).
tff(c_62139,plain,
heap(sep(lseg(x1,x3),sep(lseg(x2,x1),sep(lseg(x3,nil),emp)))),
inference(negUnitSimplification,[status(thm)],[c_28,c_62104]) ).
tff(c_1126,plain,
! [W_125,Z_122,Sigma_123,Y_124,X_121] :
( heap(sep(lseg(X_121,Z_122),sep(lseg(Z_122,W_125),Sigma_123)))
| ( Z_122 = W_125 )
| ~ heap(sep(lseg(X_121,Y_124),sep(lseg(Y_124,Z_122),sep(lseg(Z_122,W_125),Sigma_123)))) ),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_1161,plain,
! [W_125,Z_122,Sigma_123,Y_124,X_121] :
( heap(sep(lseg(X_121,Z_122),sep(lseg(Z_122,W_125),Sigma_123)))
| ( Z_122 = W_125 )
| ~ heap(sep(lseg(Y_124,Z_122),sep(lseg(X_121,Y_124),sep(lseg(Z_122,W_125),Sigma_123)))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1126]) ).
tff(c_62154,plain,
( heap(sep(lseg(x2,x3),sep(lseg(x3,nil),emp)))
| ( x3 = nil ) ),
inference(resolution,[status(thm)],[c_62139,c_1161]) ).
tff(c_62170,plain,
x3 = nil,
inference(negUnitSimplification,[status(thm)],[c_35,c_62154]) ).
tff(c_62174,plain,
~ heap(sep(lseg(x2,nil),sep(lseg(nil,nil),emp))),
inference(demodulation,[status(thm),theory(equality)],[c_62170,c_62170,c_35]) ).
tff(c_62179,plain,
~ heap(sep(lseg(x2,nil),emp)),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_62174]) ).
tff(c_460,plain,
! [X_93,Sigma_94,Y_95] :
( heap(sep(lseg(X_93,nil),Sigma_94))
| ~ heap(sep(lseg(X_93,Y_95),sep(lseg(Y_95,nil),Sigma_94))) ),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_464,plain,
! [X_93,T_2,Sigma_3,Y_95] :
( heap(sep(lseg(X_93,nil),sep(T_2,Sigma_3)))
| ~ heap(sep(lseg(X_93,Y_95),sep(T_2,sep(lseg(Y_95,nil),Sigma_3)))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_460]) ).
tff(c_62171,plain,
heap(sep(lseg(x1,nil),sep(lseg(x2,x1),emp))),
inference(resolution,[status(thm)],[c_62139,c_464]) ).
tff(c_468,plain,
! [X_93,Sigma_3,Y_95] :
( heap(sep(lseg(X_93,nil),Sigma_3))
| ~ heap(sep(lseg(Y_95,nil),sep(lseg(X_93,Y_95),Sigma_3))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_460]) ).
tff(c_62188,plain,
heap(sep(lseg(x2,nil),emp)),
inference(resolution,[status(thm)],[c_62171,c_468]) ).
tff(c_62194,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_62179,c_62188]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW410-1 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 19:27:18 EDT 2023
% 0.13/0.34 % CPUTime :
% 44.69/33.36 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 44.69/33.36
% 44.69/33.36 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 44.69/33.39
% 44.69/33.39 Inference rules
% 44.69/33.39 ----------------------
% 44.69/33.39 #Ref : 0
% 44.69/33.39 #Sup : 16858
% 44.69/33.39 #Fact : 0
% 44.69/33.39 #Define : 0
% 44.69/33.39 #Split : 0
% 44.69/33.39 #Chain : 0
% 44.69/33.39 #Close : 0
% 44.69/33.39
% 44.69/33.39 Ordering : KBO
% 44.69/33.39
% 44.69/33.39 Simplification rules
% 44.69/33.39 ----------------------
% 44.69/33.39 #Subsume : 7131
% 44.69/33.39 #Demod : 1005
% 44.69/33.39 #Tautology : 623
% 44.69/33.39 #SimpNegUnit : 3
% 44.69/33.39 #BackRed : 5
% 44.69/33.39
% 44.69/33.39 #Partial instantiations: 0
% 44.69/33.39 #Strategies tried : 1
% 44.69/33.39
% 44.69/33.39 Timing (in seconds)
% 44.69/33.39 ----------------------
% 44.69/33.40 Preprocessing : 0.48
% 44.69/33.40 Parsing : 0.25
% 44.69/33.40 CNF conversion : 0.03
% 44.69/33.40 Main loop : 31.86
% 44.69/33.40 Inferencing : 2.36
% 44.69/33.40 Reduction : 27.57
% 44.69/33.40 Demodulation : 27.18
% 44.69/33.40 BG Simplification : 0.25
% 44.69/33.40 Subsumption : 1.39
% 44.69/33.40 Abstraction : 0.34
% 44.69/33.40 MUC search : 0.00
% 44.69/33.40 Cooper : 0.00
% 44.69/33.40 Total : 32.40
% 44.69/33.40 Index Insertion : 0.00
% 44.69/33.40 Index Deletion : 0.00
% 44.69/33.40 Index Matching : 0.00
% 44.69/33.40 BG Taut test : 0.00
%------------------------------------------------------------------------------