TSTP Solution File: SWW400-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW400-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 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 : Tue Aug 22 11:07:12 EDT 2023
% Result : Unsatisfiable 17.80s 9.06s
% Output : CNFRefutation 17.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 30 ( 14 unt; 8 typ; 0 def)
% Number of atoms : 34 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 10 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 31 (; 31 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ heap > sep > next > lseg > #nlpp > 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(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_127,axiom,
~ heap(sep(lseg(x1,nil),emp)),
file(unknown,unknown) ).
tff(f_124,axiom,
nil != x2,
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_125,axiom,
heap(sep(next(x2,nil),sep(lseg(x1,x2),emp))),
file(unknown,unknown) ).
tff(f_55,axiom,
! [X,Sigma] : ( sep(lseg(X,X),Sigma) = Sigma ),
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_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_30,plain,
~ heap(sep(lseg(x1,nil),emp)),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_26,plain,
x2 != nil,
inference(cnfTransformation,[status(thm)],[f_124]) ).
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_28,plain,
heap(sep(next(x2,nil),sep(lseg(x1,x2),emp))),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_31,plain,
heap(sep(lseg(x1,x2),sep(next(x2,nil),emp))),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_28]) ).
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_436,plain,
! [X_91,Z_92,Sigma_93,Y_94] :
( heap(sep(lseg(X_91,Z_92),Sigma_93))
| ( Y_94 = X_91 )
| ~ heap(sep(next(X_91,Y_94),sep(lseg(Y_94,Z_92),Sigma_93))) ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_1063,plain,
! [X_114,X_115,Sigma_116] :
( heap(sep(lseg(X_114,X_115),Sigma_116))
| ( X_115 = X_114 )
| ~ heap(sep(next(X_114,X_115),Sigma_116)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_436]) ).
tff(c_22640,plain,
! [X_398,X_399,T_400,Sigma_401] :
( heap(sep(lseg(X_398,X_399),sep(T_400,Sigma_401)))
| ( X_399 = X_398 )
| ~ heap(sep(T_400,sep(next(X_398,X_399),Sigma_401))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1063]) ).
tff(c_22765,plain,
( heap(sep(lseg(x2,nil),sep(lseg(x1,x2),emp)))
| ( x2 = nil ) ),
inference(resolution,[status(thm)],[c_31,c_22640]) ).
tff(c_22771,plain,
( heap(sep(lseg(x1,x2),sep(lseg(x2,nil),emp)))
| ( x2 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_22765]) ).
tff(c_22772,plain,
heap(sep(lseg(x1,x2),sep(lseg(x2,nil),emp))),
inference(negUnitSimplification,[status(thm)],[c_26,c_22771]) ).
tff(c_18,plain,
! [X_26,Sigma_28,Y_27] :
( heap(sep(lseg(X_26,nil),Sigma_28))
| ~ heap(sep(lseg(X_26,Y_27),sep(lseg(Y_27,nil),Sigma_28))) ),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_22778,plain,
heap(sep(lseg(x1,nil),emp)),
inference(resolution,[status(thm)],[c_22772,c_18]) ).
tff(c_22784,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_30,c_22778]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWW400-1 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.18/0.36 % Computer : n011.cluster.edu
% 0.18/0.36 % Model : x86_64 x86_64
% 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36 % Memory : 8042.1875MB
% 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36 % CPULimit : 300
% 0.18/0.36 % WCLimit : 300
% 0.18/0.36 % DateTime : Thu Aug 3 19:28:36 EDT 2023
% 0.18/0.36 % CPUTime :
% 17.80/9.06 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.89/9.07
% 17.89/9.07 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 17.89/9.09
% 17.89/9.09 Inference rules
% 17.89/9.09 ----------------------
% 17.89/9.09 #Ref : 0
% 17.89/9.09 #Sup : 6144
% 17.89/9.09 #Fact : 0
% 17.89/9.09 #Define : 0
% 17.89/9.09 #Split : 0
% 17.89/9.09 #Chain : 0
% 17.89/9.09 #Close : 0
% 17.89/9.09
% 17.89/9.09 Ordering : KBO
% 17.89/9.09
% 17.89/9.09 Simplification rules
% 17.89/9.09 ----------------------
% 17.89/9.09 #Subsume : 2635
% 17.89/9.09 #Demod : 224
% 17.89/9.09 #Tautology : 231
% 17.89/9.09 #SimpNegUnit : 2
% 17.89/9.09 #BackRed : 0
% 17.89/9.09
% 17.89/9.09 #Partial instantiations: 0
% 17.89/9.09 #Strategies tried : 1
% 17.89/9.09
% 17.89/9.09 Timing (in seconds)
% 17.89/9.09 ----------------------
% 17.89/9.10 Preprocessing : 0.57
% 17.89/9.10 Parsing : 0.29
% 17.89/9.10 CNF conversion : 0.03
% 17.89/9.10 Main loop : 7.44
% 17.89/9.10 Inferencing : 1.04
% 17.89/9.10 Reduction : 5.67
% 17.89/9.10 Demodulation : 5.49
% 17.89/9.10 BG Simplification : 0.11
% 17.89/9.10 Subsumption : 0.49
% 17.89/9.10 Abstraction : 0.13
% 17.89/9.10 MUC search : 0.00
% 17.89/9.10 Cooper : 0.00
% 17.89/9.10 Total : 8.06
% 17.89/9.10 Index Insertion : 0.00
% 17.89/9.10 Index Deletion : 0.00
% 17.89/9.10 Index Matching : 0.00
% 17.89/9.10 BG Taut test : 0.00
%------------------------------------------------------------------------------