TSTP Solution File: PLA031-1.003 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PLA031-1.003 : TPTP v8.1.0. Released v3.5.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 : n028.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 : Mon Jul 18 16:56:43 EDT 2022
% Result : Unsatisfiable 133.05s 17.13s
% Output : CNFRefutation 133.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.16 % Problem : PLA031-1.003 : TPTP v8.1.0. Released v3.5.0.
% 0.10/0.17 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.38 % Computer : n028.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8042.1875MB
% 0.12/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 600
% 0.12/0.38 % DateTime : Tue May 31 20:49:21 EDT 2022
% 0.12/0.38 % CPUTime :
% 0.12/0.42 # No SInE strategy applied
% 0.12/0.42 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PS_S3S
% 0.12/0.42 # and selection function SelectNewComplexAHPExceptUniqMaxHorn.
% 0.12/0.42 #
% 0.12/0.42 # Presaturation interreduction done
% 0.12/0.42 # Number of axioms: 112 Number of unprocessed: 112
% 0.12/0.42 # Tableaux proof search.
% 0.12/0.42 # APR header successfully linked.
% 0.12/0.42 # Hello from C++
% 0.12/0.42 # The folding up rule is enabled...
% 0.12/0.42 # Local unification is enabled...
% 0.12/0.42 # Any saturation attempts will use folding labels...
% 0.12/0.42 # 112 beginning clauses after preprocessing and clausification
% 0.12/0.42 # Creating start rules for all 1 conjectures.
% 0.12/0.42 # There are 1 start rule candidates:
% 0.12/0.42 # Found 82 unit axioms.
% 0.12/0.42 # 1 start rule tableaux created.
% 0.12/0.42 # 30 extension rule candidate clauses
% 0.12/0.42 # 82 unit axiom clauses
% 0.12/0.42
% 0.12/0.42 # Requested 8, 32 cores available to the main process.
% 0.12/0.42 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.42 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.42 # We now have 12 tableaux to operate on
% 133.05/17.13 # There were 18 total branch saturation attempts.
% 133.05/17.13 # There were 0 of these attempts blocked.
% 133.05/17.13 # There were 0 deferred branch saturation attempts.
% 133.05/17.13 # There were 0 free duplicated saturations.
% 133.05/17.13 # There were 1 total successful branch saturations.
% 133.05/17.13 # There were 0 successful branch saturations in interreduction.
% 133.05/17.13 # There were 0 successful branch saturations on the branch.
% 133.05/17.13 # There were 1 successful branch saturations after the branch.
% 133.05/17.13 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 133.05/17.13 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 133.05/17.13 # Begin clausification derivation
% 133.05/17.13
% 133.05/17.13 # End clausification derivation
% 133.05/17.13 # Begin listing active clauses obtained from FOF to CNF conversion
% 133.05/17.13 cnf(i_0_162, plain, (neq(s0,s1))).
% 133.05/17.13 cnf(i_0_223, plain, (s(s1,s2,s2,s0,s2,s0,s1,s1))).
% 133.05/17.13 cnf(i_0_144, plain, (neq(truck1,truck2))).
% 133.05/17.13 cnf(i_0_163, plain, (neq(s0,s2))).
% 133.05/17.13 cnf(i_0_169, plain, (neq(s1,s0))).
% 133.05/17.13 cnf(i_0_171, plain, (neq(s1,s2))).
% 133.05/17.13 cnf(i_0_177, plain, (neq(s2,s0))).
% 133.05/17.13 cnf(i_0_178, plain, (neq(s2,s1))).
% 133.05/17.13 cnf(i_0_222, plain, (link(s0,s2))).
% 133.05/17.13 cnf(i_0_145, plain, (neq(truck1,s0))).
% 133.05/17.13 cnf(i_0_219, plain, (link(s1,s2))).
% 133.05/17.13 cnf(i_0_146, plain, (neq(truck1,s1))).
% 133.05/17.13 cnf(i_0_147, plain, (neq(truck1,s2))).
% 133.05/17.13 cnf(i_0_148, plain, (neq(truck1,p0_1))).
% 133.05/17.13 cnf(i_0_221, plain, (link(s2,s0))).
% 133.05/17.13 cnf(i_0_220, plain, (link(s2,s1))).
% 133.05/17.13 cnf(i_0_153, plain, (neq(truck2,s0))).
% 133.05/17.13 cnf(i_0_154, plain, (neq(truck2,s1))).
% 133.05/17.13 cnf(i_0_149, plain, (neq(truck1,p1_2))).
% 133.05/17.13 cnf(i_0_155, plain, (neq(truck2,s2))).
% 133.05/17.13 cnf(i_0_150, plain, (neq(truck1,p2_0))).
% 133.05/17.13 cnf(i_0_151, plain, (neq(truck2,truck1))).
% 133.05/17.13 cnf(i_0_156, plain, (neq(truck2,p0_1))).
% 133.05/17.13 cnf(i_0_157, plain, (neq(truck2,p1_2))).
% 133.05/17.13 cnf(i_0_159, plain, (neq(s0,truck1))).
% 133.05/17.13 cnf(i_0_160, plain, (neq(s0,truck2))).
% 133.05/17.13 cnf(i_0_164, plain, (neq(s0,p0_1))).
% 133.05/17.13 cnf(i_0_165, plain, (neq(s0,p1_2))).
% 133.05/17.13 cnf(i_0_166, plain, (neq(s0,p2_0))).
% 133.05/17.13 cnf(i_0_158, plain, (neq(truck2,p2_0))).
% 133.05/17.13 cnf(i_0_167, plain, (neq(s1,truck1))).
% 133.05/17.13 cnf(i_0_168, plain, (neq(s1,truck2))).
% 133.05/17.13 cnf(i_0_172, plain, (neq(s1,p0_1))).
% 133.05/17.13 cnf(i_0_173, plain, (neq(s1,p1_2))).
% 133.05/17.13 cnf(i_0_174, plain, (neq(s1,p2_0))).
% 133.05/17.13 cnf(i_0_175, plain, (neq(s2,truck1))).
% 133.05/17.13 cnf(i_0_176, plain, (neq(s2,truck2))).
% 133.05/17.13 cnf(i_0_180, plain, (neq(s2,p0_1))).
% 133.05/17.13 cnf(i_0_181, plain, (neq(s2,p1_2))).
% 133.05/17.13 cnf(i_0_182, plain, (neq(s2,p2_0))).
% 133.05/17.13 cnf(i_0_183, plain, (neq(p0_1,truck1))).
% 133.05/17.13 cnf(i_0_185, plain, (neq(p0_1,s0))).
% 133.05/17.13 cnf(i_0_184, plain, (neq(p0_1,truck2))).
% 133.05/17.13 cnf(i_0_186, plain, (neq(p0_1,s1))).
% 133.05/17.13 cnf(i_0_187, plain, (neq(p0_1,s2))).
% 133.05/17.13 cnf(i_0_189, plain, (neq(p0_1,p1_2))).
% 133.05/17.13 cnf(i_0_193, plain, (neq(p1_2,s0))).
% 133.05/17.13 cnf(i_0_194, plain, (neq(p1_2,s1))).
% 133.05/17.13 cnf(i_0_195, plain, (neq(p1_2,s2))).
% 133.05/17.13 cnf(i_0_201, plain, (neq(p2_0,s0))).
% 133.05/17.13 cnf(i_0_202, plain, (neq(p2_0,s1))).
% 133.05/17.13 cnf(i_0_190, plain, (neq(p0_1,p2_0))).
% 133.05/17.13 cnf(i_0_203, plain, (neq(p2_0,s2))).
% 133.05/17.13 cnf(i_0_191, plain, (neq(p1_2,truck1))).
% 133.05/17.13 cnf(i_0_192, plain, (neq(p1_2,truck2))).
% 133.05/17.13 cnf(i_0_196, plain, (neq(p1_2,p0_1))).
% 133.05/17.13 cnf(i_0_198, plain, (neq(p1_2,p2_0))).
% 133.05/17.13 cnf(i_0_207, plain, (path(s0,p0_1))).
% 133.05/17.13 cnf(i_0_217, plain, (path(s0,p2_0))).
% 133.05/17.13 cnf(i_0_209, plain, (path(s1,p0_1))).
% 133.05/17.13 cnf(i_0_211, plain, (path(s1,p1_2))).
% 133.05/17.13 cnf(i_0_213, plain, (path(s2,p1_2))).
% 133.05/17.13 cnf(i_0_199, plain, (neq(p2_0,truck1))).
% 133.05/17.13 cnf(i_0_215, plain, (path(s2,p2_0))).
% 133.05/17.13 cnf(i_0_200, plain, (neq(p2_0,truck2))).
% 133.05/17.13 cnf(i_0_204, plain, (neq(p2_0,p0_1))).
% 133.05/17.13 cnf(i_0_205, plain, (neq(p2_0,p1_2))).
% 133.05/17.13 cnf(i_0_208, plain, (path(p0_1,s0))).
% 133.05/17.13 cnf(i_0_210, plain, (path(p0_1,s1))).
% 133.05/17.13 cnf(i_0_212, plain, (path(p1_2,s1))).
% 133.05/17.13 cnf(i_0_214, plain, (path(p1_2,s2))).
% 133.05/17.13 cnf(i_0_218, plain, (path(p2_0,s0))).
% 133.05/17.13 cnf(i_0_216, plain, (path(p2_0,s2))).
% 133.05/17.13 cnf(i_0_161, plain, (~neq(s0,s0))).
% 133.05/17.13 cnf(i_0_170, plain, (~neq(s1,s1))).
% 133.05/17.13 cnf(i_0_179, plain, (~neq(s2,s2))).
% 133.05/17.13 cnf(i_0_143, plain, (~neq(truck1,truck1))).
% 133.05/17.13 cnf(i_0_152, plain, (~neq(truck2,truck2))).
% 133.05/17.13 cnf(i_0_188, plain, (~neq(p0_1,p0_1))).
% 133.05/17.13 cnf(i_0_197, plain, (~neq(p1_2,p1_2))).
% 133.05/17.13 cnf(i_0_206, plain, (~neq(p2_0,p2_0))).
% 133.05/17.13 cnf(i_0_224, negated_conjecture, (~s(s2,s2,s0,s2,s1,X1,s0,X2))).
% 133.05/17.13 cnf(i_0_136, plain, (s(X1,X2,X3,X4,X5,X6,X7,X6)|~s(X1,X2,X3,X4,X5,truck2,X7,X6))).
% 133.05/17.13 cnf(i_0_134, plain, (s(X1,X2,X3,X4,X5,X6,X6,X7)|~s(X1,X2,X3,X4,X5,truck1,X6,X7))).
% 133.05/17.13 cnf(i_0_132, plain, (s(X1,X2,X3,X4,X5,X6,X7,X5)|~s(X1,X2,X3,X4,truck2,X6,X7,X5))).
% 133.05/17.13 cnf(i_0_130, plain, (s(X1,X2,X3,X4,X5,X6,X5,X7)|~s(X1,X2,X3,X4,truck1,X6,X5,X7))).
% 133.05/17.13 cnf(i_0_128, plain, (s(X1,X2,X3,X4,X5,X6,X7,X4)|~s(X1,X2,X3,truck2,X5,X6,X7,X4))).
% 133.05/17.13 cnf(i_0_126, plain, (s(X1,X2,X3,X4,X5,X6,X4,X7)|~s(X1,X2,X3,truck1,X5,X6,X4,X7))).
% 133.05/17.13 cnf(i_0_124, plain, (s(X1,X2,X3,X4,X5,X6,X7,X3)|~s(X1,X2,truck2,X4,X5,X6,X7,X3))).
% 133.05/17.13 cnf(i_0_122, plain, (s(X1,X2,X3,X4,X5,X6,X3,X7)|~s(X1,X2,truck1,X4,X5,X6,X3,X7))).
% 133.05/17.13 cnf(i_0_120, plain, (s(X1,X2,X3,X4,X5,X6,X7,X2)|~s(X1,truck2,X3,X4,X5,X6,X7,X2))).
% 133.05/17.13 cnf(i_0_118, plain, (s(X1,X2,X3,X4,X5,X6,X2,X7)|~s(X1,truck1,X3,X4,X5,X6,X2,X7))).
% 133.05/17.13 cnf(i_0_116, plain, (s(X1,X2,X3,X4,X5,X6,X7,X1)|~s(truck2,X2,X3,X4,X5,X6,X7,X1))).
% 133.05/17.13 cnf(i_0_114, plain, (s(X1,X2,X3,X4,X5,X6,X1,X7)|~s(truck1,X2,X3,X4,X5,X6,X1,X7))).
% 133.05/17.13 cnf(i_0_125, plain, (s(X1,X2,X3,truck1,X4,X5,X6,X7)|~s(X1,X2,X3,X6,X4,X5,X6,X7))).
% 133.05/17.13 cnf(i_0_127, plain, (s(X1,X2,X3,truck2,X4,X5,X6,X7)|~s(X1,X2,X3,X7,X4,X5,X6,X7))).
% 133.05/17.13 cnf(i_0_121, plain, (s(X1,X2,truck1,X3,X4,X5,X6,X7)|~s(X1,X2,X6,X3,X4,X5,X6,X7))).
% 133.05/17.13 cnf(i_0_123, plain, (s(X1,X2,truck2,X3,X4,X5,X6,X7)|~s(X1,X2,X7,X3,X4,X5,X6,X7))).
% 133.05/17.13 cnf(i_0_117, plain, (s(X1,truck1,X2,X3,X4,X5,X6,X7)|~s(X1,X6,X2,X3,X4,X5,X6,X7))).
% 133.05/17.13 cnf(i_0_119, plain, (s(X1,truck2,X2,X3,X4,X5,X6,X7)|~s(X1,X7,X2,X3,X4,X5,X6,X7))).
% 133.05/17.13 cnf(i_0_113, plain, (s(truck1,X1,X2,X3,X4,X5,X6,X7)|~s(X6,X1,X2,X3,X4,X5,X6,X7))).
% 133.05/17.13 cnf(i_0_115, plain, (s(truck2,X1,X2,X3,X4,X5,X6,X7)|~s(X7,X1,X2,X3,X4,X5,X6,X7))).
% 133.05/17.13 cnf(i_0_133, plain, (s(X1,X2,X3,X4,X5,truck1,X6,X7)|~neq(X5,truck1)|~s(X1,X2,X3,X4,X5,X6,X6,X7))).
% 133.05/17.13 cnf(i_0_135, plain, (s(X1,X2,X3,X4,X5,truck2,X6,X7)|~neq(X5,truck2)|~s(X1,X2,X3,X4,X5,X7,X6,X7))).
% 133.05/17.13 cnf(i_0_139, plain, (s(X1,X2,X3,X4,X5,truck1,X6,X7)|~link(X8,X6)|~s(X1,X2,X3,X4,X5,truck1,X8,X7))).
% 133.05/17.13 cnf(i_0_129, plain, (s(X1,X2,X3,X4,truck1,X5,X6,X7)|~neq(X5,truck1)|~s(X1,X2,X3,X4,X6,X5,X6,X7))).
% 133.05/17.13 cnf(i_0_131, plain, (s(X1,X2,X3,X4,truck2,X5,X6,X7)|~neq(X5,truck2)|~s(X1,X2,X3,X4,X7,X5,X6,X7))).
% 133.05/17.13 cnf(i_0_140, plain, (s(X1,X2,X3,X4,X5,truck2,X6,X7)|~link(X8,X7)|~s(X1,X2,X3,X4,X5,truck2,X6,X8))).
% 133.05/17.13 cnf(i_0_137, plain, (s(X1,X2,X3,X4,truck1,X5,X6,X7)|~link(X8,X6)|~s(X1,X2,X3,X4,truck1,X5,X8,X7))).
% 133.05/17.13 cnf(i_0_138, plain, (s(X1,X2,X3,X4,truck2,X5,X6,X7)|~link(X8,X7)|~s(X1,X2,X3,X4,truck2,X5,X6,X8))).
% 133.05/17.13 cnf(i_0_141, plain, (s(X1,X2,X3,X4,X5,X6,X7,X8)|~path(X9,X5)|~s(X1,X2,X3,X4,X9,X6,X7,X8))).
% 133.05/17.13 cnf(i_0_142, plain, (s(X1,X2,X3,X4,X5,X6,X7,X8)|~path(X9,X6)|~s(X1,X2,X3,X4,X5,X9,X7,X8))).
% 133.05/17.13 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 133.05/17.13 # Begin printing tableau
% 133.05/17.13 # Found 7 steps
% 133.05/17.13 cnf(i_0_224, negated_conjecture, (~s(s2,s2,s0,s2,s1,s0,s0,X18)), inference(start_rule)).
% 133.05/17.13 cnf(i_0_225, plain, (~s(s2,s2,s0,s2,s1,s0,s0,X18)), inference(extension_rule, [i_0_141])).
% 133.05/17.13 cnf(i_0_291, plain, (~path(p0_1,s1)), inference(closure_rule, [i_0_210])).
% 133.05/17.13 cnf(i_0_292, plain, (~s(s2,s2,s0,s2,p0_1,s0,s0,X18)), inference(extension_rule, [i_0_134])).
% 133.05/17.13 cnf(i_0_330160, plain, (~s(s2,s2,s0,s2,p0_1,truck1,s0,X18)), inference(extension_rule, [i_0_141])).
% 133.05/17.13 cnf(i_0_697883, plain, (~path(s0,p0_1)), inference(closure_rule, [i_0_207])).
% 133.05/17.13 cnf(i_0_697884, plain, (~s(s2,s2,s0,s2,s0,truck1,s0,X18)), inference(etableau_closure_rule, [i_0_697884, ...])).
% 133.05/17.13 # End printing tableau
% 133.05/17.13 # SZS output end
% 133.05/17.13 # Branches closed with saturation will be marked with an "s"
% 133.05/17.14 # Child (6697) has found a proof.
% 133.05/17.14
% 133.05/17.14 # Proof search is over...
% 133.05/17.14 # Freeing feature tree
%------------------------------------------------------------------------------