TSTP Solution File: LCL953_8 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL953_8 : TPTP v8.2.0. Released v8.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 : n001.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 10:49:18 EDT 2023
% Result : Theorem 4.65s 2.21s
% Output : CNFRefutation 4.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL953_8 : TPTP v8.2.0. Released v8.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.14/0.35 % Computer : n001.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 14:29:40 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.65/2.21 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.65/2.21
% 4.65/2.21 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.65/2.23 %$ in > disjoint > empty > #nlpp > singleton > #skF_9 > #skF_15 > #skF_1 > #skF_8 > #skF_10 > #skF_11 > #skF_5 > #skF_14 > #skF_6 > #skF_13 > #skF_4 > #skF_2 > #skF_7 > #skF_12 > #skF_3
% 4.65/2.23
% 4.65/2.23 %Foreground sorts:
% 4.65/2.23 tff($ki_world, type, $ki_world: $tType ).
% 4.65/2.23
% 4.65/2.23 %Background operators:
% 4.65/2.23
% 4.65/2.23
% 4.65/2.23 %Foreground operators:
% 4.65/2.23 tff('#skF_9', type, '#skF_9': $ki_world).
% 4.65/2.23 tff('#skF_15', type, '#skF_15': $ki_world).
% 4.65/2.23 tff('#skF_1', type, '#skF_1': $ki_world > $i).
% 4.65/2.23 tff(singleton, type, singleton: $i > $i).
% 4.65/2.23 tff('#skF_8', type, '#skF_8': ($i * $i * $ki_world * $ki_world * $ki_world) > $ki_world).
% 4.65/2.23 tff('#skF_10', type, '#skF_10': $i).
% 4.65/2.23 tff('#skF_11', type, '#skF_11': $ki_world).
% 4.65/2.23 tff(disjoint, type, disjoint: ($ki_world * $i * $i) > $o).
% 4.65/2.23 tff('#skF_5', type, '#skF_5': $i).
% 4.65/2.23 tff('#skF_14', type, '#skF_14': $ki_world > $ki_world).
% 4.65/2.23 tff('#skF_6', type, '#skF_6': $i).
% 4.65/2.23 tff('#skF_13', type, '#skF_13': $ki_world).
% 4.65/2.23 tff('#skF_4', type, '#skF_4': ($i * $ki_world * $ki_world * $ki_world * $i * $ki_world) > $ki_world).
% 4.65/2.23 tff(in, type, in: ($ki_world * $i * $i) > $o).
% 4.65/2.23 tff('#skF_2', type, '#skF_2': ($ki_world * $i * $i * $ki_world * $ki_world) > $ki_world).
% 4.65/2.23 tff('#skF_7', type, '#skF_7': $ki_world > $ki_world).
% 4.65/2.23 tff(empty, type, empty: ($ki_world * $i) > $o).
% 4.65/2.23 tff('#skF_12', type, '#skF_12': $i).
% 4.65/2.23 tff('#skF_3', type, '#skF_3': ($i * $ki_world * $ki_world * $i * $ki_world) > $ki_world).
% 4.65/2.23
% 4.65/2.24 tff(f_160, negated_conjecture, ~(![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (![A]: ($ki_exists_in_world_$i(W, A) => (![W0:$ki_world]: ($ki_accessible(W, W0) => (![B]: ($ki_exists_in_world_$i(W0, B) => (![W1:$ki_world]: ($ki_accessible(W0, W1) => ((![W2:$ki_world]: ($ki_accessible(W1, W2) => ~(![W3:$ki_world]: ($ki_accessible(W2, W3) => in(W3, A, B))))) => (![W2:$ki_world]: ($ki_accessible(W1, W2) => disjoint(W2, singleton(A), B)))))))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', verify)).
% 4.65/2.24 tff(f_131, axiom, (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (![A]: ($ki_exists_in_world_$i(W, A) => (![W0:$ki_world]: ($ki_accessible(W, W0) => (![B]: ($ki_exists_in_world_$i(W0, B) => (![W1:$ki_world]: ($ki_accessible(W0, W1) => ((![W2:$ki_world]: ($ki_accessible(W1, W2) => ~(![W3:$ki_world]: ($ki_accessible(W2, W3) => in(W3, A, B))))) => (![W2:$ki_world]: ($ki_accessible(W1, W2) => disjoint(W2, singleton(A), B)))))))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', l28_zfmisc_1)).
% 4.65/2.24 tff(c_44, plain, ($ki_accessible($ki_local_world, '#skF_9')), inference(cnfTransformation, [status(thm)], [f_160])).
% 4.65/2.24 tff(c_40, plain, ($ki_accessible('#skF_9', '#skF_11')), inference(cnfTransformation, [status(thm)], [f_160])).
% 4.65/2.24 tff(c_42, plain, ($ki_exists_in_world_$i('#skF_9', '#skF_10')), inference(cnfTransformation, [status(thm)], [f_160])).
% 4.65/2.24 tff(c_36, plain, ($ki_accessible('#skF_11', '#skF_13')), inference(cnfTransformation, [status(thm)], [f_160])).
% 4.65/2.24 tff(c_38, plain, ($ki_exists_in_world_$i('#skF_11', '#skF_12')), inference(cnfTransformation, [status(thm)], [f_160])).
% 4.65/2.24 tff(c_34, plain, ($ki_accessible('#skF_13', '#skF_15')), inference(cnfTransformation, [status(thm)], [f_160])).
% 4.65/2.24 tff(c_98, plain, (![W_609:$ki_world, B_608, W1_610:$ki_world, A_606, W0_611:$ki_world, W2_607:$ki_world]: ($ki_accessible(W1_610, '#skF_8'(A_606, B_608, W_609, W1_610, W0_611)) | disjoint(W2_607, singleton(A_606), B_608) | ~$ki_accessible(W1_610, W2_607) | ~$ki_accessible(W0_611, W1_610) | ~$ki_exists_in_world_$i(W0_611, B_608) | ~$ki_accessible(W_609, W0_611) | ~$ki_exists_in_world_$i(W_609, A_606) | ~$ki_accessible($ki_local_world, W_609))), inference(cnfTransformation, [status(thm)], [f_131])).
% 4.65/2.24 tff(c_169, plain, (![A_633, B_634, W_635:$ki_world, W0_636:$ki_world]: ($ki_accessible('#skF_13', '#skF_8'(A_633, B_634, W_635, '#skF_13', W0_636)) | disjoint('#skF_15', singleton(A_633), B_634) | ~$ki_accessible(W0_636, '#skF_13') | ~$ki_exists_in_world_$i(W0_636, B_634) | ~$ki_accessible(W_635, W0_636) | ~$ki_exists_in_world_$i(W_635, A_633) | ~$ki_accessible($ki_local_world, W_635))), inference(resolution, [status(thm)], [c_34, c_98])).
% 4.65/2.24 tff(c_32, plain, (~disjoint('#skF_15', singleton('#skF_10'), '#skF_12')), inference(cnfTransformation, [status(thm)], [f_160])).
% 4.65/2.24 tff(c_179, plain, (![W_635:$ki_world, W0_636:$ki_world]: ($ki_accessible('#skF_13', '#skF_8'('#skF_10', '#skF_12', W_635, '#skF_13', W0_636)) | ~$ki_accessible(W0_636, '#skF_13') | ~$ki_exists_in_world_$i(W0_636, '#skF_12') | ~$ki_accessible(W_635, W0_636) | ~$ki_exists_in_world_$i(W_635, '#skF_10') | ~$ki_accessible($ki_local_world, W_635))), inference(resolution, [status(thm)], [c_169, c_32])).
% 4.65/2.24 tff(c_48, plain, (![W2_570:$ki_world]: ($ki_accessible(W2_570, '#skF_14'(W2_570)) | ~$ki_accessible('#skF_13', W2_570))), inference(cnfTransformation, [status(thm)], [f_160])).
% 4.65/2.24 tff(c_222, plain, (![W_667:$ki_world, W0_669:$ki_world, B_666, W2_665:$ki_world, W3_663:$ki_world, A_664, W1_668:$ki_world]: (in(W3_663, A_664, B_666) | ~$ki_accessible('#skF_8'(A_664, B_666, W_667, W1_668, W0_669), W3_663) | disjoint(W2_665, singleton(A_664), B_666) | ~$ki_accessible(W1_668, W2_665) | ~$ki_accessible(W0_669, W1_668) | ~$ki_exists_in_world_$i(W0_669, B_666) | ~$ki_accessible(W_667, W0_669) | ~$ki_exists_in_world_$i(W_667, A_664) | ~$ki_accessible($ki_local_world, W_667))), inference(cnfTransformation, [status(thm)], [f_131])).
% 4.65/2.24 tff(c_447, plain, (![B_761, W1_759:$ki_world, W_760:$ki_world, W0_758:$ki_world, W2_762:$ki_world, A_763]: (in('#skF_14'('#skF_8'(A_763, B_761, W_760, W1_759, W0_758)), A_763, B_761) | disjoint(W2_762, singleton(A_763), B_761) | ~$ki_accessible(W1_759, W2_762) | ~$ki_accessible(W0_758, W1_759) | ~$ki_exists_in_world_$i(W0_758, B_761) | ~$ki_accessible(W_760, W0_758) | ~$ki_exists_in_world_$i(W_760, A_763) | ~$ki_accessible($ki_local_world, W_760) | ~$ki_accessible('#skF_13', '#skF_8'(A_763, B_761, W_760, W1_759, W0_758)))), inference(resolution, [status(thm)], [c_48, c_222])).
% 4.65/2.24 tff(c_578, plain, (![A_786, B_787, W_788:$ki_world, W0_789:$ki_world]: (in('#skF_14'('#skF_8'(A_786, B_787, W_788, '#skF_13', W0_789)), A_786, B_787) | disjoint('#skF_15', singleton(A_786), B_787) | ~$ki_accessible(W0_789, '#skF_13') | ~$ki_exists_in_world_$i(W0_789, B_787) | ~$ki_accessible(W_788, W0_789) | ~$ki_exists_in_world_$i(W_788, A_786) | ~$ki_accessible($ki_local_world, W_788) | ~$ki_accessible('#skF_13', '#skF_8'(A_786, B_787, W_788, '#skF_13', W0_789)))), inference(resolution, [status(thm)], [c_34, c_447])).
% 4.65/2.24 tff(c_46, plain, (![W2_570:$ki_world]: (~in('#skF_14'(W2_570), '#skF_10', '#skF_12') | ~$ki_accessible('#skF_13', W2_570))), inference(cnfTransformation, [status(thm)], [f_160])).
% 4.65/2.24 tff(c_582, plain, (![W0_789:$ki_world, W_788:$ki_world]: (disjoint('#skF_15', singleton('#skF_10'), '#skF_12') | ~$ki_accessible(W0_789, '#skF_13') | ~$ki_exists_in_world_$i(W0_789, '#skF_12') | ~$ki_accessible(W_788, W0_789) | ~$ki_exists_in_world_$i(W_788, '#skF_10') | ~$ki_accessible($ki_local_world, W_788) | ~$ki_accessible('#skF_13', '#skF_8'('#skF_10', '#skF_12', W_788, '#skF_13', W0_789)))), inference(resolution, [status(thm)], [c_578, c_46])).
% 4.65/2.24 tff(c_586, plain, (![W0_790:$ki_world, W_791:$ki_world]: (~$ki_accessible(W0_790, '#skF_13') | ~$ki_exists_in_world_$i(W0_790, '#skF_12') | ~$ki_accessible(W_791, W0_790) | ~$ki_exists_in_world_$i(W_791, '#skF_10') | ~$ki_accessible($ki_local_world, W_791) | ~$ki_accessible('#skF_13', '#skF_8'('#skF_10', '#skF_12', W_791, '#skF_13', W0_790)))), inference(negUnitSimplification, [status(thm)], [c_32, c_582])).
% 4.65/2.24 tff(c_615, plain, (![W0_792:$ki_world, W_793:$ki_world]: (~$ki_accessible(W0_792, '#skF_13') | ~$ki_exists_in_world_$i(W0_792, '#skF_12') | ~$ki_accessible(W_793, W0_792) | ~$ki_exists_in_world_$i(W_793, '#skF_10') | ~$ki_accessible($ki_local_world, W_793))), inference(resolution, [status(thm)], [c_179, c_586])).
% 4.65/2.24 tff(c_617, plain, (![W_793:$ki_world]: (~$ki_accessible('#skF_11', '#skF_13') | ~$ki_accessible(W_793, '#skF_11') | ~$ki_exists_in_world_$i(W_793, '#skF_10') | ~$ki_accessible($ki_local_world, W_793))), inference(resolution, [status(thm)], [c_38, c_615])).
% 4.65/2.24 tff(c_660, plain, (![W_804:$ki_world]: (~$ki_accessible(W_804, '#skF_11') | ~$ki_exists_in_world_$i(W_804, '#skF_10') | ~$ki_accessible($ki_local_world, W_804))), inference(demodulation, [status(thm), theory('equality')], [c_36, c_617])).
% 4.65/2.24 tff(c_663, plain, (~$ki_accessible('#skF_9', '#skF_11') | ~$ki_accessible($ki_local_world, '#skF_9')), inference(resolution, [status(thm)], [c_42, c_660])).
% 4.65/2.24 tff(c_667, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_44, c_40, c_663])).
% 4.65/2.24 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.65/2.24
% 4.65/2.24 Inference rules
% 4.65/2.24 ----------------------
% 4.65/2.24 #Ref : 0
% 4.65/2.24 #Sup : 172
% 4.65/2.24 #Fact : 0
% 4.65/2.24 #Define : 0
% 4.65/2.24 #Split : 2
% 4.65/2.24 #Chain : 0
% 4.65/2.24 #Close : 0
% 4.65/2.24
% 4.65/2.24 Ordering : KBO
% 4.65/2.24
% 4.65/2.24 Simplification rules
% 4.65/2.24 ----------------------
% 4.65/2.24 #Subsume : 2
% 4.65/2.24 #Demod : 4
% 4.65/2.24 #Tautology : 0
% 4.65/2.24 #SimpNegUnit : 2
% 4.65/2.24 #BackRed : 0
% 4.65/2.24
% 4.65/2.24 #Partial instantiations: 0
% 4.65/2.24 #Strategies tried : 1
% 4.65/2.24
% 4.65/2.24 Timing (in seconds)
% 4.65/2.24 ----------------------
% 4.65/2.25 Preprocessing : 0.59
% 4.65/2.25 Parsing : 0.34
% 4.65/2.25 CNF conversion : 0.07
% 4.65/2.25 Main loop : 0.62
% 4.65/2.25 Inferencing : 0.25
% 4.65/2.25 Reduction : 0.15
% 4.65/2.25 Demodulation : 0.11
% 4.65/2.25 BG Simplification : 0.03
% 4.65/2.25 Subsumption : 0.15
% 4.65/2.25 Abstraction : 0.02
% 4.65/2.25 MUC search : 0.00
% 4.65/2.25 Cooper : 0.00
% 4.65/2.25 Total : 1.25
% 4.65/2.25 Index Insertion : 0.00
% 4.65/2.25 Index Deletion : 0.00
% 4.65/2.25 Index Matching : 0.00
% 4.65/2.25 BG Taut test : 0.00
%------------------------------------------------------------------------------