TSTP Solution File: SWV508-1.030 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV508-1.030 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%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 : 600s
% DateTime : Wed Jul 20 18:21:33 EDT 2022
% Result : Satisfiable 1.57s 0.57s
% Output : CNFRefutation 1.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV508-1.030 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%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 : 600
% 0.12/0.34 % DateTime : Tue Jun 14 16:55:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 66 Number of unprocessed: 66
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.38 # The folding up rule is enabled...
% 0.19/0.38 # Local unification is enabled...
% 0.19/0.38 # Any saturation attempts will use folding labels...
% 0.19/0.38 # 66 beginning clauses after preprocessing and clausification
% 0.19/0.38 # Creating start rules for all 1 conjectures.
% 0.19/0.38 # There are 1 start rule candidates:
% 0.19/0.38 # Found 65 unit axioms.
% 0.19/0.38 # 1 start rule tableaux created.
% 0.19/0.38 # 1 extension rule candidate clauses
% 0.19/0.38 # 65 unit axiom clauses
% 0.19/0.38
% 0.19/0.38 # Requested 8, 32 cores available to the main process.
% 0.19/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.38 # Creating equality axioms
% 0.19/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.38 # Returning from population with 75 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.38 # We now have 75 tableaux to operate on
% 1.57/0.56 # 1947 Satisfiable branch
% 1.57/0.57 # Satisfiable branch found.
% 1.57/0.57 # There were 1 total branch saturation attempts.
% 1.57/0.57 # There were 0 of these attempts blocked.
% 1.57/0.57 # There were 0 deferred branch saturation attempts.
% 1.57/0.57 # There were 0 free duplicated saturations.
% 1.57/0.57 # There were 0 total successful branch saturations.
% 1.57/0.57 # There were 0 successful branch saturations in interreduction.
% 1.57/0.57 # There were 0 successful branch saturations on the branch.
% 1.57/0.57 # There were 0 successful branch saturations after the branch.
% 1.57/0.57 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.57/0.57 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.57/0.57 # Begin clausification derivation
% 1.57/0.57
% 1.57/0.57 # End clausification derivation
% 1.57/0.57 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.57/0.57 cnf(i_0_129, hypothesis, (select(a_1098,i_1129)=e_1130)).
% 1.57/0.57 cnf(i_0_130, hypothesis, (select(a_1128,i_1129)=e_1131)).
% 1.57/0.57 cnf(i_0_131, hypothesis, (sk(a_1098,a_1128)=i_1129)).
% 1.57/0.57 cnf(i_0_69, hypothesis, (store(a1,n1,e1)=a_1069)).
% 1.57/0.57 cnf(i_0_70, hypothesis, (store(a_1069,n2,e2)=a_1070)).
% 1.57/0.57 cnf(i_0_71, hypothesis, (store(a_1070,n3,e3)=a_1071)).
% 1.57/0.57 cnf(i_0_72, hypothesis, (store(a_1071,n4,e4)=a_1072)).
% 1.57/0.57 cnf(i_0_73, hypothesis, (store(a_1072,n5,e5)=a_1073)).
% 1.57/0.57 cnf(i_0_74, hypothesis, (store(a_1073,n6,e6)=a_1074)).
% 1.57/0.57 cnf(i_0_75, hypothesis, (store(a_1074,n7,e7)=a_1075)).
% 1.57/0.57 cnf(i_0_76, hypothesis, (store(a_1075,n8,e8)=a_1076)).
% 1.57/0.57 cnf(i_0_77, hypothesis, (store(a_1076,n9,e9)=a_1077)).
% 1.57/0.57 cnf(i_0_78, hypothesis, (store(a_1077,n10,e10)=a_1078)).
% 1.57/0.57 cnf(i_0_79, hypothesis, (store(a_1078,n11,e11)=a_1079)).
% 1.57/0.57 cnf(i_0_80, hypothesis, (store(a_1079,n12,e12)=a_1080)).
% 1.57/0.57 cnf(i_0_81, hypothesis, (store(a_1080,n13,e13)=a_1081)).
% 1.57/0.57 cnf(i_0_82, hypothesis, (store(a_1081,n14,e14)=a_1082)).
% 1.57/0.57 cnf(i_0_83, hypothesis, (store(a_1082,n15,e15)=a_1083)).
% 1.57/0.57 cnf(i_0_84, hypothesis, (store(a_1083,n16,e16)=a_1084)).
% 1.57/0.57 cnf(i_0_85, hypothesis, (store(a_1084,n17,e17)=a_1085)).
% 1.57/0.57 cnf(i_0_86, hypothesis, (store(a_1085,n18,e18)=a_1086)).
% 1.57/0.57 cnf(i_0_87, hypothesis, (store(a_1086,n19,e19)=a_1087)).
% 1.57/0.57 cnf(i_0_88, hypothesis, (store(a_1087,n20,e20)=a_1088)).
% 1.57/0.57 cnf(i_0_89, hypothesis, (store(a_1088,n21,e21)=a_1089)).
% 1.57/0.57 cnf(i_0_90, hypothesis, (store(a_1089,n22,e22)=a_1090)).
% 1.57/0.57 cnf(i_0_91, hypothesis, (store(a_1090,n23,e23)=a_1091)).
% 1.57/0.57 cnf(i_0_92, hypothesis, (store(a_1091,n24,e24)=a_1092)).
% 1.57/0.57 cnf(i_0_93, hypothesis, (store(a_1092,n25,e25)=a_1093)).
% 1.57/0.57 cnf(i_0_94, hypothesis, (store(a_1093,n26,e26)=a_1094)).
% 1.57/0.57 cnf(i_0_95, hypothesis, (store(a_1094,n27,e27)=a_1095)).
% 1.57/0.57 cnf(i_0_96, hypothesis, (store(a_1095,n28,e28)=a_1096)).
% 1.57/0.57 cnf(i_0_97, hypothesis, (store(a_1096,n29,e29)=a_1097)).
% 1.57/0.57 cnf(i_0_98, hypothesis, (store(a_1097,n1,e1)=a_1098)).
% 1.57/0.57 cnf(i_0_99, hypothesis, (store(a1,n13,e13)=a_1099)).
% 1.57/0.57 cnf(i_0_100, hypothesis, (store(a_1099,n1,e1)=a_1100)).
% 1.57/0.57 cnf(i_0_101, hypothesis, (store(a_1100,n19,e19)=a_1101)).
% 1.57/0.57 cnf(i_0_102, hypothesis, (store(a_1101,n4,e4)=a_1102)).
% 1.57/0.57 cnf(i_0_103, hypothesis, (store(a_1102,n9,e9)=a_1103)).
% 1.57/0.57 cnf(i_0_104, hypothesis, (store(a_1103,n30,e30)=a_1104)).
% 1.57/0.57 cnf(i_0_105, hypothesis, (store(a_1104,n2,e2)=a_1105)).
% 1.57/0.57 cnf(i_0_106, hypothesis, (store(a_1105,n15,e15)=a_1106)).
% 1.57/0.57 cnf(i_0_107, hypothesis, (store(a_1106,n25,e25)=a_1107)).
% 1.57/0.57 cnf(i_0_108, hypothesis, (store(a_1107,n18,e18)=a_1108)).
% 1.57/0.57 cnf(i_0_109, hypothesis, (store(a_1108,n20,e20)=a_1109)).
% 1.57/0.57 cnf(i_0_110, hypothesis, (store(a_1109,n8,e8)=a_1110)).
% 1.57/0.57 cnf(i_0_111, hypothesis, (store(a_1110,n21,e21)=a_1111)).
% 1.57/0.57 cnf(i_0_112, hypothesis, (store(a_1111,n6,e6)=a_1112)).
% 1.57/0.57 cnf(i_0_113, hypothesis, (store(a_1112,n11,e11)=a_1113)).
% 1.57/0.57 cnf(i_0_114, hypothesis, (store(a_1113,n14,e14)=a_1114)).
% 1.57/0.57 cnf(i_0_115, hypothesis, (store(a_1114,n29,e29)=a_1115)).
% 1.57/0.57 cnf(i_0_116, hypothesis, (store(a_1115,n5,e5)=a_1116)).
% 1.57/0.57 cnf(i_0_117, hypothesis, (store(a_1116,n26,e26)=a_1117)).
% 1.57/0.57 cnf(i_0_118, hypothesis, (store(a_1117,n22,e22)=a_1118)).
% 1.57/0.57 cnf(i_0_119, hypothesis, (store(a_1118,n27,e27)=a_1119)).
% 1.57/0.57 cnf(i_0_120, hypothesis, (store(a_1119,n3,e3)=a_1120)).
% 1.57/0.57 cnf(i_0_121, hypothesis, (store(a_1120,n12,e12)=a_1121)).
% 1.57/0.57 cnf(i_0_122, hypothesis, (store(a_1121,n16,e16)=a_1122)).
% 1.57/0.57 cnf(i_0_123, hypothesis, (store(a_1122,n28,e28)=a_1123)).
% 1.57/0.57 cnf(i_0_124, hypothesis, (store(a_1123,n17,e17)=a_1124)).
% 1.57/0.57 cnf(i_0_125, hypothesis, (store(a_1124,n23,e23)=a_1125)).
% 1.57/0.57 cnf(i_0_126, hypothesis, (store(a_1125,n24,e24)=a_1126)).
% 1.57/0.57 cnf(i_0_127, hypothesis, (store(a_1126,n7,e7)=a_1127)).
% 1.57/0.57 cnf(i_0_128, hypothesis, (store(a_1127,n10,e10)=a_1128)).
% 1.57/0.57 cnf(i_0_67, plain, (select(store(X1,X2,X3),X2)=X3)).
% 1.57/0.57 cnf(i_0_132, negated_conjecture, (e_1130!=e_1131)).
% 1.57/0.57 cnf(i_0_68, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 1.57/0.57 cnf(i_0_138, plain, (X5=X5)).
% 1.57/0.57 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.57/0.57 # Begin printing tableau
% 1.57/0.57 # Found 6 steps
% 1.57/0.57 cnf(i_0_129, hypothesis, (select(a_1098,i_1129)=e_1130), inference(start_rule)).
% 1.57/0.57 cnf(i_0_145, plain, (select(a_1098,i_1129)=e_1130), inference(extension_rule, [i_0_143])).
% 1.57/0.57 cnf(i_0_228, plain, (select(a_1098,i_1129)!=e_1130), inference(closure_rule, [i_0_129])).
% 1.57/0.57 cnf(i_0_226, plain, (select(select(a_1098,i_1129),select(a_1098,i_1129))=select(e_1130,e_1130)), inference(extension_rule, [i_0_142])).
% 1.57/0.57 cnf(i_0_308, plain, (select(a_1098,i_1129)!=e_1130), inference(closure_rule, [i_0_129])).
% 1.57/0.57 cnf(i_0_309, plain, (select(a_1098,i_1129)!=e_1130), inference(closure_rule, [i_0_129])).
% 1.57/0.57 # End printing tableau
% 1.57/0.57 # SZS output end
% 1.57/0.57 # Branches closed with saturation will be marked with an "s"
% 1.57/0.57 # Child (1947) has found a proof.
% 1.57/0.57
% 1.57/0.57 # Proof search is over...
% 1.57/0.57 # Freeing feature tree
%------------------------------------------------------------------------------