TSTP Solution File: SWV508-1.040 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV508-1.040 : 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 : n015.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 5.07s 1.03s
% Output : CNFRefutation 5.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV508-1.040 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35 % Computer : n015.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 : 600
% 0.13/0.35 % DateTime : Tue Jun 14 17:27:24 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 86 Number of unprocessed: 86
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.39 # The folding up rule is enabled...
% 0.13/0.39 # Local unification is enabled...
% 0.13/0.39 # Any saturation attempts will use folding labels...
% 0.13/0.39 # 86 beginning clauses after preprocessing and clausification
% 0.13/0.39 # Creating start rules for all 1 conjectures.
% 0.13/0.39 # There are 1 start rule candidates:
% 0.13/0.39 # Found 85 unit axioms.
% 0.13/0.39 # 1 start rule tableaux created.
% 0.13/0.39 # 1 extension rule candidate clauses
% 0.13/0.39 # 85 unit axiom clauses
% 0.13/0.39
% 0.13/0.39 # Requested 8, 32 cores available to the main process.
% 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.39 # Creating equality axioms
% 0.13/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.39 # Returning from population with 95 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.39 # We now have 95 tableaux to operate on
% 5.07/1.03 # 21083 Satisfiable branch
% 5.07/1.03 # Satisfiable branch found.
% 5.07/1.03 # There were 1 total branch saturation attempts.
% 5.07/1.03 # There were 0 of these attempts blocked.
% 5.07/1.03 # There were 0 deferred branch saturation attempts.
% 5.07/1.03 # There were 0 free duplicated saturations.
% 5.07/1.03 # There were 0 total successful branch saturations.
% 5.07/1.03 # There were 0 successful branch saturations in interreduction.
% 5.07/1.03 # There were 0 successful branch saturations on the branch.
% 5.07/1.03 # There were 0 successful branch saturations after the branch.
% 5.07/1.03 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.07/1.03 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.07/1.03 # Begin clausification derivation
% 5.07/1.03
% 5.07/1.03 # End clausification derivation
% 5.07/1.03 # Begin listing active clauses obtained from FOF to CNF conversion
% 5.07/1.03 cnf(i_0_169, hypothesis, (select(a_1449,i_1490)=e_1491)).
% 5.07/1.03 cnf(i_0_170, hypothesis, (select(a_1489,i_1490)=e_1492)).
% 5.07/1.03 cnf(i_0_171, hypothesis, (sk(a_1449,a_1489)=i_1490)).
% 5.07/1.03 cnf(i_0_89, hypothesis, (store(a1,n1,e1)=a_1410)).
% 5.07/1.03 cnf(i_0_90, hypothesis, (store(a_1410,n2,e2)=a_1411)).
% 5.07/1.03 cnf(i_0_91, hypothesis, (store(a_1411,n3,e3)=a_1412)).
% 5.07/1.03 cnf(i_0_92, hypothesis, (store(a_1412,n4,e4)=a_1413)).
% 5.07/1.03 cnf(i_0_93, hypothesis, (store(a_1413,n5,e5)=a_1414)).
% 5.07/1.03 cnf(i_0_94, hypothesis, (store(a_1414,n6,e6)=a_1415)).
% 5.07/1.03 cnf(i_0_95, hypothesis, (store(a_1415,n7,e7)=a_1416)).
% 5.07/1.03 cnf(i_0_96, hypothesis, (store(a_1416,n8,e8)=a_1417)).
% 5.07/1.03 cnf(i_0_97, hypothesis, (store(a_1417,n9,e9)=a_1418)).
% 5.07/1.03 cnf(i_0_98, hypothesis, (store(a_1418,n10,e10)=a_1419)).
% 5.07/1.03 cnf(i_0_99, hypothesis, (store(a_1419,n11,e11)=a_1420)).
% 5.07/1.03 cnf(i_0_100, hypothesis, (store(a_1420,n12,e12)=a_1421)).
% 5.07/1.03 cnf(i_0_101, hypothesis, (store(a_1421,n13,e13)=a_1422)).
% 5.07/1.03 cnf(i_0_102, hypothesis, (store(a_1422,n14,e14)=a_1423)).
% 5.07/1.03 cnf(i_0_103, hypothesis, (store(a_1423,n15,e15)=a_1424)).
% 5.07/1.03 cnf(i_0_104, hypothesis, (store(a_1424,n16,e16)=a_1425)).
% 5.07/1.03 cnf(i_0_105, hypothesis, (store(a_1425,n17,e17)=a_1426)).
% 5.07/1.03 cnf(i_0_106, hypothesis, (store(a_1426,n18,e18)=a_1427)).
% 5.07/1.03 cnf(i_0_107, hypothesis, (store(a_1427,n19,e19)=a_1428)).
% 5.07/1.03 cnf(i_0_108, hypothesis, (store(a_1428,n20,e20)=a_1429)).
% 5.07/1.03 cnf(i_0_109, hypothesis, (store(a_1429,n21,e21)=a_1430)).
% 5.07/1.03 cnf(i_0_110, hypothesis, (store(a_1430,n22,e22)=a_1431)).
% 5.07/1.03 cnf(i_0_111, hypothesis, (store(a_1431,n23,e23)=a_1432)).
% 5.07/1.03 cnf(i_0_112, hypothesis, (store(a_1432,n24,e24)=a_1433)).
% 5.07/1.03 cnf(i_0_113, hypothesis, (store(a_1433,n25,e25)=a_1434)).
% 5.07/1.03 cnf(i_0_114, hypothesis, (store(a_1434,n26,e26)=a_1435)).
% 5.07/1.03 cnf(i_0_115, hypothesis, (store(a_1435,n27,e27)=a_1436)).
% 5.07/1.03 cnf(i_0_116, hypothesis, (store(a_1436,n28,e28)=a_1437)).
% 5.07/1.03 cnf(i_0_117, hypothesis, (store(a_1437,n29,e29)=a_1438)).
% 5.07/1.03 cnf(i_0_118, hypothesis, (store(a_1438,n30,e30)=a_1439)).
% 5.07/1.03 cnf(i_0_119, hypothesis, (store(a_1439,n31,e31)=a_1440)).
% 5.07/1.03 cnf(i_0_120, hypothesis, (store(a_1440,n32,e32)=a_1441)).
% 5.07/1.03 cnf(i_0_121, hypothesis, (store(a_1441,n33,e33)=a_1442)).
% 5.07/1.03 cnf(i_0_122, hypothesis, (store(a_1442,n34,e34)=a_1443)).
% 5.07/1.03 cnf(i_0_123, hypothesis, (store(a_1443,n35,e35)=a_1444)).
% 5.07/1.03 cnf(i_0_124, hypothesis, (store(a_1444,n36,e36)=a_1445)).
% 5.07/1.03 cnf(i_0_125, hypothesis, (store(a_1445,n37,e37)=a_1446)).
% 5.07/1.03 cnf(i_0_126, hypothesis, (store(a_1446,n38,e38)=a_1447)).
% 5.07/1.03 cnf(i_0_127, hypothesis, (store(a_1447,n39,e39)=a_1448)).
% 5.07/1.03 cnf(i_0_128, hypothesis, (store(a_1448,n1,e1)=a_1449)).
% 5.07/1.03 cnf(i_0_129, hypothesis, (store(a1,n16,e16)=a_1450)).
% 5.07/1.03 cnf(i_0_130, hypothesis, (store(a_1450,n14,e14)=a_1451)).
% 5.07/1.03 cnf(i_0_131, hypothesis, (store(a_1451,n24,e24)=a_1452)).
% 5.07/1.03 cnf(i_0_132, hypothesis, (store(a_1452,n11,e11)=a_1453)).
% 5.07/1.03 cnf(i_0_133, hypothesis, (store(a_1453,n25,e25)=a_1454)).
% 5.07/1.03 cnf(i_0_134, hypothesis, (store(a_1454,n17,e17)=a_1455)).
% 5.07/1.03 cnf(i_0_135, hypothesis, (store(a_1455,n7,e7)=a_1456)).
% 5.07/1.03 cnf(i_0_136, hypothesis, (store(a_1456,n32,e32)=a_1457)).
% 5.07/1.03 cnf(i_0_137, hypothesis, (store(a_1457,n6,e6)=a_1458)).
% 5.07/1.03 cnf(i_0_138, hypothesis, (store(a_1458,n18,e18)=a_1459)).
% 5.07/1.03 cnf(i_0_139, hypothesis, (store(a_1459,n37,e37)=a_1460)).
% 5.07/1.03 cnf(i_0_140, hypothesis, (store(a_1460,n31,e31)=a_1461)).
% 5.07/1.03 cnf(i_0_141, hypothesis, (store(a_1461,n13,e13)=a_1462)).
% 5.07/1.03 cnf(i_0_142, hypothesis, (store(a_1462,n12,e12)=a_1463)).
% 5.07/1.03 cnf(i_0_143, hypothesis, (store(a_1463,n36,e36)=a_1464)).
% 5.07/1.03 cnf(i_0_144, hypothesis, (store(a_1464,n20,e20)=a_1465)).
% 5.07/1.03 cnf(i_0_145, hypothesis, (store(a_1465,n35,e35)=a_1466)).
% 5.07/1.03 cnf(i_0_146, hypothesis, (store(a_1466,n23,e23)=a_1467)).
% 5.07/1.03 cnf(i_0_147, hypothesis, (store(a_1467,n26,e26)=a_1468)).
% 5.07/1.03 cnf(i_0_148, hypothesis, (store(a_1468,n21,e21)=a_1469)).
% 5.07/1.03 cnf(i_0_149, hypothesis, (store(a_1469,n27,e27)=a_1470)).
% 5.07/1.03 cnf(i_0_150, hypothesis, (store(a_1470,n10,e10)=a_1471)).
% 5.07/1.03 cnf(i_0_151, hypothesis, (store(a_1471,n22,e22)=a_1472)).
% 5.07/1.03 cnf(i_0_152, hypothesis, (store(a_1472,n8,e8)=a_1473)).
% 5.07/1.03 cnf(i_0_153, hypothesis, (store(a_1473,n33,e33)=a_1474)).
% 5.07/1.03 cnf(i_0_154, hypothesis, (store(a_1474,n2,e2)=a_1475)).
% 5.07/1.03 cnf(i_0_155, hypothesis, (store(a_1475,n40,e40)=a_1476)).
% 5.07/1.03 cnf(i_0_156, hypothesis, (store(a_1476,n38,e38)=a_1477)).
% 5.07/1.03 cnf(i_0_157, hypothesis, (store(a_1477,n39,e39)=a_1478)).
% 5.07/1.03 cnf(i_0_158, hypothesis, (store(a_1478,n1,e1)=a_1479)).
% 5.07/1.03 cnf(i_0_159, hypothesis, (store(a_1479,n9,e9)=a_1480)).
% 5.07/1.03 cnf(i_0_160, hypothesis, (store(a_1480,n3,e3)=a_1481)).
% 5.07/1.03 cnf(i_0_161, hypothesis, (store(a_1481,n5,e5)=a_1482)).
% 5.07/1.03 cnf(i_0_162, hypothesis, (store(a_1482,n4,e4)=a_1483)).
% 5.07/1.03 cnf(i_0_163, hypothesis, (store(a_1483,n30,e30)=a_1484)).
% 5.07/1.03 cnf(i_0_164, hypothesis, (store(a_1484,n15,e15)=a_1485)).
% 5.07/1.03 cnf(i_0_165, hypothesis, (store(a_1485,n34,e34)=a_1486)).
% 5.07/1.03 cnf(i_0_166, hypothesis, (store(a_1486,n28,e28)=a_1487)).
% 5.07/1.03 cnf(i_0_167, hypothesis, (store(a_1487,n29,e29)=a_1488)).
% 5.07/1.03 cnf(i_0_168, hypothesis, (store(a_1488,n19,e19)=a_1489)).
% 5.07/1.03 cnf(i_0_87, plain, (select(store(X1,X2,X3),X2)=X3)).
% 5.07/1.03 cnf(i_0_172, negated_conjecture, (e_1491!=e_1492)).
% 5.07/1.03 cnf(i_0_88, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 5.07/1.03 cnf(i_0_178, plain, (X5=X5)).
% 5.07/1.03 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 5.07/1.03 # Begin printing tableau
% 5.07/1.03 # Found 6 steps
% 5.07/1.03 cnf(i_0_169, hypothesis, (select(a_1449,i_1490)=e_1491), inference(start_rule)).
% 5.07/1.03 cnf(i_0_185, plain, (select(a_1449,i_1490)=e_1491), inference(extension_rule, [i_0_182])).
% 5.07/1.03 cnf(i_0_284, plain, (select(a_1449,i_1490)!=e_1491), inference(closure_rule, [i_0_169])).
% 5.07/1.03 cnf(i_0_285, plain, (select(a_1449,i_1490)!=e_1491), inference(closure_rule, [i_0_169])).
% 5.07/1.03 cnf(i_0_282, plain, (store(select(a_1449,i_1490),select(a_1449,i_1490),select(a_1449,i_1490))=store(e_1491,e_1491,e_1491)), inference(extension_rule, [i_0_183])).
% 5.07/1.03 cnf(i_0_364, plain, (select(a_1449,i_1490)!=e_1491), inference(closure_rule, [i_0_169])).
% 5.07/1.03 # End printing tableau
% 5.07/1.03 # SZS output end
% 5.07/1.03 # Branches closed with saturation will be marked with an "s"
% 5.07/1.04 # Child (21083) has found a proof.
% 5.07/1.04
% 5.07/1.04 # Proof search is over...
% 5.07/1.04 # Freeing feature tree
%------------------------------------------------------------------------------