TSTP Solution File: PLA031-1.001 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PLA031-1.001 : 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 : n018.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 1.82s 2.04s
% Output : CNFRefutation 1.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PLA031-1.001 : TPTP v8.1.0. Released v3.5.0.
% 0.07/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 : n018.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 May 31 23:18:58 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.38 # No SInE strategy applied
% 0.20/0.38 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PS_S3S
% 0.20/0.38 # and selection function SelectNewComplexAHPExceptUniqMaxHorn.
% 0.20/0.38 #
% 0.20/0.38 # Presaturation interreduction done
% 0.20/0.38 # Number of axioms: 106 Number of unprocessed: 106
% 0.20/0.38 # Tableaux proof search.
% 0.20/0.38 # APR header successfully linked.
% 0.20/0.38 # Hello from C++
% 0.68/0.92 # The folding up rule is enabled...
% 0.68/0.92 # Local unification is enabled...
% 0.68/0.92 # Any saturation attempts will use folding labels...
% 0.68/0.92 # 106 beginning clauses after preprocessing and clausification
% 0.68/0.92 # Creating start rules for all 1 conjectures.
% 0.68/0.92 # There are 1 start rule candidates:
% 0.68/0.92 # Found 84 unit axioms.
% 0.68/0.92 # 1 start rule tableaux created.
% 0.68/0.92 # 22 extension rule candidate clauses
% 0.68/0.92 # 84 unit axiom clauses
% 0.68/0.92
% 0.68/0.92 # Requested 8, 32 cores available to the main process.
% 0.68/0.92 # There are not enough tableaux to fork, creating more from the initial 1
% 1.82/2.04 # There were 3 total branch saturation attempts.
% 1.82/2.04 # There were 0 of these attempts blocked.
% 1.82/2.04 # There were 0 deferred branch saturation attempts.
% 1.82/2.04 # There were 0 free duplicated saturations.
% 1.82/2.04 # There were 1 total successful branch saturations.
% 1.82/2.04 # There were 0 successful branch saturations in interreduction.
% 1.82/2.04 # There were 0 successful branch saturations on the branch.
% 1.82/2.04 # There were 1 successful branch saturations after the branch.
% 1.82/2.04 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.82/2.04 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.82/2.04 # Begin clausification derivation
% 1.82/2.04
% 1.82/2.04 # End clausification derivation
% 1.82/2.04 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.82/2.04 cnf(i_0_148, plain, (neq(s0,s1))).
% 1.82/2.04 cnf(i_0_211, plain, (s(s2,s2,s0,s1,s0,s2))).
% 1.82/2.04 cnf(i_0_130, plain, (neq(truck1,truck2))).
% 1.82/2.04 cnf(i_0_149, plain, (neq(s0,s2))).
% 1.82/2.04 cnf(i_0_155, plain, (neq(s1,s0))).
% 1.82/2.04 cnf(i_0_157, plain, (neq(s1,s2))).
% 1.82/2.04 cnf(i_0_163, plain, (neq(s2,s0))).
% 1.82/2.04 cnf(i_0_164, plain, (neq(s2,s1))).
% 1.82/2.04 cnf(i_0_205, plain, (link(s0,s1))).
% 1.82/2.04 cnf(i_0_131, plain, (neq(truck1,s0))).
% 1.82/2.04 cnf(i_0_207, plain, (link(s0,s2))).
% 1.82/2.04 cnf(i_0_132, plain, (neq(truck1,s1))).
% 1.82/2.04 cnf(i_0_133, plain, (neq(truck1,s2))).
% 1.82/2.04 cnf(i_0_206, plain, (link(s1,s0))).
% 1.82/2.04 cnf(i_0_209, plain, (link(s1,s2))).
% 1.82/2.04 cnf(i_0_208, plain, (link(s2,s0))).
% 1.82/2.04 cnf(i_0_210, plain, (link(s2,s1))).
% 1.82/2.04 cnf(i_0_139, plain, (neq(truck2,s0))).
% 1.82/2.04 cnf(i_0_134, plain, (neq(truck1,p1_0))).
% 1.82/2.04 cnf(i_0_140, plain, (neq(truck2,s1))).
% 1.82/2.04 cnf(i_0_135, plain, (neq(truck1,p2_0))).
% 1.82/2.04 cnf(i_0_136, plain, (neq(truck1,p2_1))).
% 1.82/2.04 cnf(i_0_137, plain, (neq(truck2,truck1))).
% 1.82/2.04 cnf(i_0_141, plain, (neq(truck2,s2))).
% 1.82/2.04 cnf(i_0_145, plain, (neq(s0,truck1))).
% 1.82/2.04 cnf(i_0_146, plain, (neq(s0,truck2))).
% 1.82/2.04 cnf(i_0_150, plain, (neq(s0,p1_0))).
% 1.82/2.04 cnf(i_0_151, plain, (neq(s0,p2_0))).
% 1.82/2.04 cnf(i_0_152, plain, (neq(s0,p2_1))).
% 1.82/2.04 cnf(i_0_142, plain, (neq(truck2,p1_0))).
% 1.82/2.04 cnf(i_0_153, plain, (neq(s1,truck1))).
% 1.82/2.04 cnf(i_0_143, plain, (neq(truck2,p2_0))).
% 1.82/2.04 cnf(i_0_144, plain, (neq(truck2,p2_1))).
% 1.82/2.04 cnf(i_0_154, plain, (neq(s1,truck2))).
% 1.82/2.04 cnf(i_0_158, plain, (neq(s1,p1_0))).
% 1.82/2.04 cnf(i_0_159, plain, (neq(s1,p2_0))).
% 1.82/2.04 cnf(i_0_160, plain, (neq(s1,p2_1))).
% 1.82/2.04 cnf(i_0_161, plain, (neq(s2,truck1))).
% 1.82/2.04 cnf(i_0_162, plain, (neq(s2,truck2))).
% 1.82/2.04 cnf(i_0_166, plain, (neq(s2,p1_0))).
% 1.82/2.04 cnf(i_0_167, plain, (neq(s2,p2_0))).
% 1.82/2.04 cnf(i_0_168, plain, (neq(s2,p2_1))).
% 1.82/2.04 cnf(i_0_169, plain, (neq(p1_0,truck1))).
% 1.82/2.04 cnf(i_0_170, plain, (neq(p1_0,truck2))).
% 1.82/2.04 cnf(i_0_171, plain, (neq(p1_0,s0))).
% 1.82/2.04 cnf(i_0_172, plain, (neq(p1_0,s1))).
% 1.82/2.04 cnf(i_0_173, plain, (neq(p1_0,s2))).
% 1.82/2.04 cnf(i_0_179, plain, (neq(p2_0,s0))).
% 1.82/2.04 cnf(i_0_180, plain, (neq(p2_0,s1))).
% 1.82/2.04 cnf(i_0_181, plain, (neq(p2_0,s2))).
% 1.82/2.04 cnf(i_0_187, plain, (neq(p2_1,s0))).
% 1.82/2.04 cnf(i_0_175, plain, (neq(p1_0,p2_0))).
% 1.82/2.04 cnf(i_0_188, plain, (neq(p2_1,s1))).
% 1.82/2.04 cnf(i_0_176, plain, (neq(p1_0,p2_1))).
% 1.82/2.04 cnf(i_0_177, plain, (neq(p2_0,truck1))).
% 1.82/2.04 cnf(i_0_178, plain, (neq(p2_0,truck2))).
% 1.82/2.04 cnf(i_0_182, plain, (neq(p2_0,p1_0))).
% 1.82/2.04 cnf(i_0_189, plain, (neq(p2_1,s2))).
% 1.82/2.04 cnf(i_0_195, plain, (path(s0,p1_0))).
% 1.82/2.04 cnf(i_0_199, plain, (path(s0,p2_0))).
% 1.82/2.04 cnf(i_0_193, plain, (path(s1,p1_0))).
% 1.82/2.04 cnf(i_0_203, plain, (path(s1,p2_1))).
% 1.82/2.04 cnf(i_0_184, plain, (neq(p2_0,p2_1))).
% 1.82/2.04 cnf(i_0_197, plain, (path(s2,p2_0))).
% 1.82/2.04 cnf(i_0_185, plain, (neq(p2_1,truck1))).
% 1.82/2.04 cnf(i_0_186, plain, (neq(p2_1,truck2))).
% 1.82/2.04 cnf(i_0_190, plain, (neq(p2_1,p1_0))).
% 1.82/2.04 cnf(i_0_191, plain, (neq(p2_1,p2_0))).
% 1.82/2.04 cnf(i_0_201, plain, (path(s2,p2_1))).
% 1.82/2.04 cnf(i_0_196, plain, (path(p1_0,s0))).
% 1.82/2.04 cnf(i_0_194, plain, (path(p1_0,s1))).
% 1.82/2.04 cnf(i_0_200, plain, (path(p2_0,s0))).
% 1.82/2.04 cnf(i_0_198, plain, (path(p2_0,s2))).
% 1.82/2.04 cnf(i_0_204, plain, (path(p2_1,s1))).
% 1.82/2.04 cnf(i_0_202, plain, (path(p2_1,s2))).
% 1.82/2.04 cnf(i_0_212, negated_conjecture, (~s(s2,s1,s2,s2,s2,s0))).
% 1.82/2.04 cnf(i_0_147, plain, (~neq(s0,s0))).
% 1.82/2.04 cnf(i_0_156, plain, (~neq(s1,s1))).
% 1.82/2.04 cnf(i_0_129, plain, (~neq(truck1,truck1))).
% 1.82/2.04 cnf(i_0_138, plain, (~neq(truck2,truck2))).
% 1.82/2.04 cnf(i_0_165, plain, (~neq(s2,s2))).
% 1.82/2.04 cnf(i_0_174, plain, (~neq(p1_0,p1_0))).
% 1.82/2.04 cnf(i_0_183, plain, (~neq(p2_0,p2_0))).
% 1.82/2.04 cnf(i_0_192, plain, (~neq(p2_1,p2_1))).
% 1.82/2.04 cnf(i_0_122, plain, (s(X1,X2,X3,X4,X5,X4)|~s(X1,X2,X3,truck2,X5,X4))).
% 1.82/2.04 cnf(i_0_120, plain, (s(X1,X2,X3,X4,X4,X5)|~s(X1,X2,X3,truck1,X4,X5))).
% 1.82/2.04 cnf(i_0_118, plain, (s(X1,X2,X3,X4,X5,X3)|~s(X1,X2,truck2,X4,X5,X3))).
% 1.82/2.04 cnf(i_0_116, plain, (s(X1,X2,X3,X4,X3,X5)|~s(X1,X2,truck1,X4,X3,X5))).
% 1.82/2.04 cnf(i_0_114, plain, (s(X1,X2,X3,X4,X5,X2)|~s(X1,truck2,X3,X4,X5,X2))).
% 1.82/2.04 cnf(i_0_112, plain, (s(X1,X2,X3,X4,X2,X5)|~s(X1,truck1,X3,X4,X2,X5))).
% 1.82/2.04 cnf(i_0_110, plain, (s(X1,X2,X3,X4,X5,X1)|~s(truck2,X2,X3,X4,X5,X1))).
% 1.82/2.04 cnf(i_0_108, plain, (s(X1,X2,X3,X4,X1,X5)|~s(truck1,X2,X3,X4,X1,X5))).
% 1.82/2.04 cnf(i_0_111, plain, (s(X1,truck1,X2,X3,X4,X5)|~s(X1,X4,X2,X3,X4,X5))).
% 1.82/2.04 cnf(i_0_113, plain, (s(X1,truck2,X2,X3,X4,X5)|~s(X1,X5,X2,X3,X4,X5))).
% 1.82/2.04 cnf(i_0_107, plain, (s(truck1,X1,X2,X3,X4,X5)|~s(X4,X1,X2,X3,X4,X5))).
% 1.82/2.04 cnf(i_0_109, plain, (s(truck2,X1,X2,X3,X4,X5)|~s(X5,X1,X2,X3,X4,X5))).
% 1.82/2.04 cnf(i_0_119, plain, (s(X1,X2,X3,truck1,X4,X5)|~neq(X3,truck1)|~s(X1,X2,X3,X4,X4,X5))).
% 1.82/2.04 cnf(i_0_121, plain, (s(X1,X2,X3,truck2,X4,X5)|~neq(X3,truck2)|~s(X1,X2,X3,X5,X4,X5))).
% 1.82/2.04 cnf(i_0_115, plain, (s(X1,X2,truck1,X3,X4,X5)|~neq(X3,truck1)|~s(X1,X2,X4,X3,X4,X5))).
% 1.82/2.04 cnf(i_0_117, plain, (s(X1,X2,truck2,X3,X4,X5)|~neq(X3,truck2)|~s(X1,X2,X5,X3,X4,X5))).
% 1.82/2.04 cnf(i_0_125, plain, (s(X1,X2,X3,truck1,X4,X5)|~link(X6,X4)|~s(X1,X2,X3,truck1,X6,X5))).
% 1.82/2.04 cnf(i_0_126, plain, (s(X1,X2,X3,truck2,X4,X5)|~link(X6,X5)|~s(X1,X2,X3,truck2,X4,X6))).
% 1.82/2.04 cnf(i_0_123, plain, (s(X1,X2,truck1,X3,X4,X5)|~link(X6,X4)|~s(X1,X2,truck1,X3,X6,X5))).
% 1.82/2.04 cnf(i_0_124, plain, (s(X1,X2,truck2,X3,X4,X5)|~link(X6,X5)|~s(X1,X2,truck2,X3,X4,X6))).
% 1.82/2.04 cnf(i_0_127, plain, (s(X1,X2,X3,X4,X5,X6)|~path(X7,X3)|~s(X1,X2,X7,X4,X5,X6))).
% 1.82/2.04 cnf(i_0_128, plain, (s(X1,X2,X3,X4,X5,X6)|~path(X7,X4)|~s(X1,X2,X3,X7,X5,X6))).
% 1.82/2.04 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.82/2.04 # Begin printing tableau
% 1.82/2.04 # Found 6 steps
% 1.82/2.04 cnf(i_0_212, negated_conjecture, (~s(s2,s1,s2,s2,s2,s0)), inference(start_rule)).
% 1.82/2.04 cnf(i_0_213, plain, (~s(s2,s1,s2,s2,s2,s0)), inference(extension_rule, [i_0_128])).
% 1.82/2.04 cnf(i_0_266, plain, (~path(p2_0,s2)), inference(closure_rule, [i_0_198])).
% 1.82/2.04 cnf(i_0_267, plain, (~s(s2,s1,s2,p2_0,s2,s0)), inference(extension_rule, [i_0_127])).
% 1.82/2.04 cnf(i_0_54175, plain, (~path(p2_0,s2)), inference(closure_rule, [i_0_198])).
% 1.82/2.04 cnf(i_0_54176, plain, (~s(s2,s1,p2_0,p2_0,s2,s0)), inference(etableau_closure_rule, [i_0_54176, ...])).
% 1.82/2.04 # End printing tableau
% 1.82/2.04 # SZS output end
% 1.82/2.04 # Branches closed with saturation will be marked with an "s"
% 1.82/2.04 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 1.82/2.04 # We now have 7 tableaux to operate on
% 1.82/2.04 # Found closed tableau during pool population.
% 1.82/2.04 # Proof search is over...
% 1.82/2.04 # Freeing feature tree
%------------------------------------------------------------------------------