TSTP Solution File: SWV558-1.004 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV558-1.004 : TPTP v8.1.2. Released v4.0.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 : n016.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:05:06 EDT 2023
% Result : Unsatisfiable 4.14s 2.03s
% Output : CNFRefutation 4.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 44
% Syntax : Number of formulae : 107 ( 83 unt; 24 typ; 0 def)
% Number of atoms : 83 ( 82 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 22 con; 0-3 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ store > select > #nlpp > i4 > i3 > i2 > i1 > e_30 > e_28 > e_26 > e_24 > e_22 > e_20 > e_18 > e_16 > a_31 > a_29 > a_27 > a_25 > a_23 > a_21 > a_19 > a_17 > a2 > a1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a1,type,
a1: $i ).
tff(a_31,type,
a_31: $i ).
tff(e_28,type,
e_28: $i ).
tff(a_17,type,
a_17: $i ).
tff(a_21,type,
a_21: $i ).
tff(e_26,type,
e_26: $i ).
tff(store,type,
store: ( $i * $i * $i ) > $i ).
tff(a_23,type,
a_23: $i ).
tff(a_29,type,
a_29: $i ).
tff(a_27,type,
a_27: $i ).
tff(e_22,type,
e_22: $i ).
tff(e_20,type,
e_20: $i ).
tff(a2,type,
a2: $i ).
tff(i1,type,
i1: $i ).
tff(e_30,type,
e_30: $i ).
tff(i2,type,
i2: $i ).
tff(select,type,
select: ( $i * $i ) > $i ).
tff(e_18,type,
e_18: $i ).
tff(a_25,type,
a_25: $i ).
tff(e_24,type,
e_24: $i ).
tff(a_19,type,
a_19: $i ).
tff(e_16,type,
e_16: $i ).
tff(i4,type,
i4: $i ).
tff(i3,type,
i3: $i ).
tff(f_57,axiom,
a1 != a2,
file(unknown,unknown) ).
tff(f_39,axiom,
a_17 = store(a1,i1,e_16),
file(unknown,unknown) ).
tff(f_26,axiom,
! [A,I,E] : ( select(store(A,I,E),I) = E ),
file(unknown,unknown) ).
tff(f_41,axiom,
a_21 = store(a_17,i2,e_20),
file(unknown,unknown) ).
tff(f_51,axiom,
e_24 = select(a_23,i3),
file(unknown,unknown) ).
tff(f_32,axiom,
! [A,I] : ( store(A,I,select(A,I)) = A ),
file(unknown,unknown) ).
tff(f_43,axiom,
a_25 = store(a_21,i3,e_24),
file(unknown,unknown) ).
tff(f_45,axiom,
a_29 = store(a_25,i4,e_28),
file(unknown,unknown) ).
tff(f_55,axiom,
a_29 = a_31,
file(unknown,unknown) ).
tff(f_46,axiom,
a_31 = store(a_27,i4,e_30),
file(unknown,unknown) ).
tff(f_54,axiom,
e_30 = select(a_25,i4),
file(unknown,unknown) ).
tff(f_53,axiom,
e_28 = select(a_27,i4),
file(unknown,unknown) ).
tff(f_44,axiom,
a_27 = store(a_23,i3,e_26),
file(unknown,unknown) ).
tff(f_52,axiom,
e_26 = select(a_21,i3),
file(unknown,unknown) ).
tff(f_42,axiom,
a_23 = store(a_19,i2,e_22),
file(unknown,unknown) ).
tff(f_50,axiom,
e_22 = select(a_17,i2),
file(unknown,unknown) ).
tff(f_49,axiom,
e_20 = select(a_19,i2),
file(unknown,unknown) ).
tff(f_40,axiom,
a_19 = store(a2,i1,e_18),
file(unknown,unknown) ).
tff(f_48,axiom,
e_18 = select(a1,i1),
file(unknown,unknown) ).
tff(f_47,axiom,
e_16 = select(a2,i1),
file(unknown,unknown) ).
tff(c_46,plain,
a2 != a1,
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_12,plain,
store(a1,i1,e_16) = a_17,
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_116,plain,
! [A_19,I_20,E_21] : ( select(store(A_19,I_20,E_21),I_20) = E_21 ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_137,plain,
select(a_17,i1) = e_16,
inference(superposition,[status(thm),theory(equality)],[c_12,c_116]) ).
tff(c_16,plain,
store(a_17,i2,e_20) = a_21,
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_125,plain,
select(a_21,i2) = e_20,
inference(superposition,[status(thm),theory(equality)],[c_16,c_116]) ).
tff(c_36,plain,
select(a_23,i3) = e_24,
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_149,plain,
! [A_22,I_23] : ( store(A_22,I_23,select(A_22,I_23)) = A_22 ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_164,plain,
store(a_23,i3,e_24) = a_23,
inference(superposition,[status(thm),theory(equality)],[c_36,c_149]) ).
tff(c_20,plain,
store(a_21,i3,e_24) = a_25,
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_146,plain,
select(a_25,i3) = e_24,
inference(superposition,[status(thm),theory(equality)],[c_20,c_116]) ).
tff(c_24,plain,
store(a_25,i4,e_28) = a_29,
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_131,plain,
select(a_29,i4) = e_28,
inference(superposition,[status(thm),theory(equality)],[c_24,c_116]) ).
tff(c_44,plain,
a_31 = a_29,
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_26,plain,
store(a_27,i4,e_30) = a_31,
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_47,plain,
store(a_27,i4,e_30) = a_29,
inference(demodulation,[status(thm),theory(equality)],[c_44,c_26]) ).
tff(c_134,plain,
select(a_29,i4) = e_30,
inference(superposition,[status(thm),theory(equality)],[c_47,c_116]) ).
tff(c_288,plain,
e_30 = e_28,
inference(demodulation,[status(thm),theory(equality)],[c_131,c_134]) ).
tff(c_42,plain,
select(a_25,i4) = e_30,
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_173,plain,
store(a_25,i4,e_30) = a_25,
inference(superposition,[status(thm),theory(equality)],[c_42,c_149]) ).
tff(c_573,plain,
store(a_25,i4,e_28) = a_25,
inference(demodulation,[status(thm),theory(equality)],[c_288,c_173]) ).
tff(c_40,plain,
select(a_27,i4) = e_28,
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_185,plain,
store(a_27,i4,e_28) = a_27,
inference(superposition,[status(thm),theory(equality)],[c_40,c_149]) ).
tff(c_358,plain,
store(a_27,i4,e_28) = a_29,
inference(demodulation,[status(thm),theory(equality)],[c_288,c_47]) ).
tff(c_403,plain,
a_29 = a_27,
inference(demodulation,[status(thm),theory(equality)],[c_185,c_358]) ).
tff(c_405,plain,
store(a_25,i4,e_28) = a_27,
inference(demodulation,[status(thm),theory(equality)],[c_403,c_24]) ).
tff(c_618,plain,
a_27 = a_25,
inference(demodulation,[status(thm),theory(equality)],[c_573,c_405]) ).
tff(c_22,plain,
store(a_23,i3,e_26) = a_27,
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_128,plain,
select(a_27,i3) = e_26,
inference(superposition,[status(thm),theory(equality)],[c_22,c_116]) ).
tff(c_622,plain,
select(a_25,i3) = e_26,
inference(demodulation,[status(thm),theory(equality)],[c_618,c_128]) ).
tff(c_626,plain,
e_26 = e_24,
inference(demodulation,[status(thm),theory(equality)],[c_146,c_622]) ).
tff(c_38,plain,
select(a_21,i3) = e_26,
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_176,plain,
store(a_21,i3,e_26) = a_21,
inference(superposition,[status(thm),theory(equality)],[c_38,c_149]) ).
tff(c_640,plain,
store(a_21,i3,e_24) = a_21,
inference(demodulation,[status(thm),theory(equality)],[c_626,c_176]) ).
tff(c_653,plain,
a_25 = a_21,
inference(demodulation,[status(thm),theory(equality)],[c_640,c_20]) ).
tff(c_623,plain,
store(a_23,i3,e_26) = a_25,
inference(demodulation,[status(thm),theory(equality)],[c_618,c_22]) ).
tff(c_772,plain,
a_23 = a_21,
inference(demodulation,[status(thm),theory(equality)],[c_164,c_653,c_626,c_623]) ).
tff(c_18,plain,
store(a_19,i2,e_22) = a_23,
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_143,plain,
select(a_23,i2) = e_22,
inference(superposition,[status(thm),theory(equality)],[c_18,c_116]) ).
tff(c_774,plain,
select(a_21,i2) = e_22,
inference(demodulation,[status(thm),theory(equality)],[c_772,c_143]) ).
tff(c_778,plain,
e_22 = e_20,
inference(demodulation,[status(thm),theory(equality)],[c_125,c_774]) ).
tff(c_34,plain,
select(a_17,i2) = e_22,
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_167,plain,
store(a_17,i2,e_22) = a_17,
inference(superposition,[status(thm),theory(equality)],[c_34,c_149]) ).
tff(c_784,plain,
store(a_17,i2,e_20) = a_17,
inference(demodulation,[status(thm),theory(equality)],[c_778,c_167]) ).
tff(c_797,plain,
a_21 = a_17,
inference(demodulation,[status(thm),theory(equality)],[c_784,c_16]) ).
tff(c_32,plain,
select(a_19,i2) = e_20,
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_182,plain,
store(a_19,i2,e_20) = a_19,
inference(superposition,[status(thm),theory(equality)],[c_32,c_149]) ).
tff(c_775,plain,
store(a_19,i2,e_22) = a_21,
inference(demodulation,[status(thm),theory(equality)],[c_772,c_18]) ).
tff(c_890,plain,
a_19 = a_17,
inference(demodulation,[status(thm),theory(equality)],[c_797,c_182,c_778,c_775]) ).
tff(c_14,plain,
store(a2,i1,e_18) = a_19,
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_140,plain,
select(a_19,i1) = e_18,
inference(superposition,[status(thm),theory(equality)],[c_14,c_116]) ).
tff(c_892,plain,
select(a_17,i1) = e_18,
inference(demodulation,[status(thm),theory(equality)],[c_890,c_140]) ).
tff(c_896,plain,
e_18 = e_16,
inference(demodulation,[status(thm),theory(equality)],[c_137,c_892]) ).
tff(c_30,plain,
select(a1,i1) = e_18,
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_179,plain,
store(a1,i1,e_18) = a1,
inference(superposition,[status(thm),theory(equality)],[c_30,c_149]) ).
tff(c_902,plain,
store(a1,i1,e_16) = a1,
inference(demodulation,[status(thm),theory(equality)],[c_896,c_179]) ).
tff(c_28,plain,
select(a2,i1) = e_16,
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_170,plain,
store(a2,i1,e_16) = a2,
inference(superposition,[status(thm),theory(equality)],[c_28,c_149]) ).
tff(c_893,plain,
store(a2,i1,e_18) = a_17,
inference(demodulation,[status(thm),theory(equality)],[c_890,c_14]) ).
tff(c_915,plain,
a_17 = a2,
inference(demodulation,[status(thm),theory(equality)],[c_170,c_896,c_893]) ).
tff(c_928,plain,
store(a1,i1,e_16) = a2,
inference(demodulation,[status(thm),theory(equality)],[c_915,c_12]) ).
tff(c_1003,plain,
a2 = a1,
inference(demodulation,[status(thm),theory(equality)],[c_902,c_928]) ).
tff(c_1005,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_46,c_1003]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV558-1.004 : TPTP v8.1.2. Released v4.0.0.
% 0.13/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.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 23:06:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.14/2.03 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.20/2.04
% 4.20/2.04 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.20/2.07
% 4.20/2.07 Inference rules
% 4.20/2.07 ----------------------
% 4.20/2.07 #Ref : 0
% 4.20/2.07 #Sup : 318
% 4.20/2.07 #Fact : 0
% 4.20/2.07 #Define : 0
% 4.20/2.07 #Split : 0
% 4.20/2.07 #Chain : 0
% 4.20/2.07 #Close : 0
% 4.20/2.07
% 4.20/2.07 Ordering : KBO
% 4.20/2.07
% 4.20/2.07 Simplification rules
% 4.20/2.07 ----------------------
% 4.20/2.07 #Subsume : 0
% 4.20/2.07 #Demod : 110
% 4.20/2.07 #Tautology : 221
% 4.20/2.07 #SimpNegUnit : 1
% 4.20/2.07 #BackRed : 57
% 4.20/2.07
% 4.20/2.07 #Partial instantiations: 0
% 4.20/2.07 #Strategies tried : 1
% 4.20/2.07
% 4.20/2.07 Timing (in seconds)
% 4.20/2.07 ----------------------
% 4.20/2.08 Preprocessing : 0.47
% 4.20/2.08 Parsing : 0.25
% 4.20/2.08 CNF conversion : 0.03
% 4.20/2.08 Main loop : 0.54
% 4.20/2.08 Inferencing : 0.23
% 4.20/2.08 Reduction : 0.16
% 4.20/2.08 Demodulation : 0.12
% 4.20/2.08 BG Simplification : 0.03
% 4.20/2.08 Subsumption : 0.08
% 4.20/2.08 Abstraction : 0.03
% 4.20/2.08 MUC search : 0.00
% 4.20/2.08 Cooper : 0.00
% 4.20/2.08 Total : 1.07
% 4.20/2.08 Index Insertion : 0.00
% 4.20/2.08 Index Deletion : 0.00
% 4.20/2.08 Index Matching : 0.00
% 4.20/2.08 BG Taut test : 0.00
%------------------------------------------------------------------------------