%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PLA031-1.002 : 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 : n021.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 8.88s 1.48s % Output : CNFRefutation 8.88s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : PLA031-1.002 : TPTP v8.1.0. Released v3.5.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n021.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Tue May 31 23:09:00 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PS_S3S % 0.13/0.37 # and selection function SelectNewComplexAHPExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 91 Number of unprocessed: 91 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 91 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 65 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 26 extension rule candidate clauses % 0.13/0.37 # 65 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 12 tableaux to operate on % 8.88/1.48 # There were 2 total branch saturation attempts. % 8.88/1.48 # There were 0 of these attempts blocked. % 8.88/1.48 # There were 0 deferred branch saturation attempts. % 8.88/1.48 # There were 0 free duplicated saturations. % 8.88/1.48 # There were 1 total successful branch saturations. % 8.88/1.48 # There were 0 successful branch saturations in interreduction. % 8.88/1.48 # There were 0 successful branch saturations on the branch. % 8.88/1.48 # There were 1 successful branch saturations after the branch. % 8.88/1.48 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.88/1.48 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.88/1.48 # Begin clausification derivation % 8.88/1.48 % 8.88/1.48 # End clausification derivation % 8.88/1.48 # Begin listing active clauses obtained from FOF to CNF conversion % 8.88/1.48 cnf(i_0_136, plain, (neq(s0,s2))). % 8.88/1.48 cnf(i_0_148, plain, (neq(s2,s0))). % 8.88/1.48 cnf(i_0_180, plain, (link(s0,s2))). % 8.88/1.48 cnf(i_0_119, plain, (neq(truck1,truck2))). % 8.88/1.48 cnf(i_0_179, plain, (link(s2,s0))). % 8.88/1.48 cnf(i_0_120, plain, (neq(truck1,s0))). % 8.88/1.48 cnf(i_0_122, plain, (neq(truck1,s2))). % 8.88/1.48 cnf(i_0_127, plain, (neq(truck2,s0))). % 8.88/1.48 cnf(i_0_121, plain, (neq(truck1,s1))). % 8.88/1.48 cnf(i_0_129, plain, (neq(truck2,s2))). % 8.88/1.48 cnf(i_0_123, plain, (neq(truck1,p1_0))). % 8.88/1.48 cnf(i_0_124, plain, (neq(truck1,p2_1))). % 8.88/1.48 cnf(i_0_125, plain, (neq(truck2,truck1))). % 8.88/1.48 cnf(i_0_128, plain, (neq(truck2,s1))). % 8.88/1.48 cnf(i_0_132, plain, (neq(s0,truck1))). % 8.88/1.48 cnf(i_0_133, plain, (neq(s0,truck2))). % 8.88/1.48 cnf(i_0_135, plain, (neq(s0,s1))). % 8.88/1.48 cnf(i_0_137, plain, (neq(s0,p1_0))). % 8.88/1.48 cnf(i_0_138, plain, (neq(s0,p2_1))). % 8.88/1.48 cnf(i_0_130, plain, (neq(truck2,p1_0))). % 8.88/1.48 cnf(i_0_141, plain, (neq(s1,s0))). % 8.88/1.48 cnf(i_0_131, plain, (neq(truck2,p2_1))). % 8.88/1.48 cnf(i_0_139, plain, (neq(s1,truck1))). % 8.88/1.48 cnf(i_0_140, plain, (neq(s1,truck2))). % 8.88/1.48 cnf(i_0_143, plain, (neq(s1,s2))). % 8.88/1.48 cnf(i_0_146, plain, (neq(s2,truck1))). % 8.88/1.48 cnf(i_0_147, plain, (neq(s2,truck2))). % 8.88/1.48 cnf(i_0_149, plain, (neq(s2,s1))). % 8.88/1.48 cnf(i_0_151, plain, (neq(s2,p1_0))). % 8.88/1.48 cnf(i_0_152, plain, (neq(s2,p2_1))). % 8.88/1.48 cnf(i_0_144, plain, (neq(s1,p1_0))). % 8.88/1.48 cnf(i_0_155, plain, (neq(p1_0,s0))). % 8.88/1.48 cnf(i_0_145, plain, (neq(s1,p2_1))). % 8.88/1.48 cnf(i_0_153, plain, (neq(p1_0,truck1))). % 8.88/1.48 cnf(i_0_154, plain, (neq(p1_0,truck2))). % 8.88/1.48 cnf(i_0_156, plain, (neq(p1_0,s1))). % 8.88/1.48 cnf(i_0_157, plain, (neq(p1_0,s2))). % 8.88/1.48 cnf(i_0_162, plain, (neq(p2_1,s0))). % 8.88/1.48 cnf(i_0_164, plain, (neq(p2_1,s2))). % 8.88/1.48 cnf(i_0_175, plain, (link(s0,s1))). % 8.88/1.48 cnf(i_0_176, plain, (link(s1,s0))). % 8.88/1.48 cnf(i_0_159, plain, (neq(p1_0,p2_1))). % 8.88/1.48 cnf(i_0_177, plain, (link(s1,s2))). % 8.88/1.48 cnf(i_0_160, plain, (neq(p2_1,truck1))). % 8.88/1.48 cnf(i_0_161, plain, (neq(p2_1,truck2))). % 8.88/1.48 cnf(i_0_163, plain, (neq(p2_1,s1))). % 8.88/1.48 cnf(i_0_165, plain, (neq(p2_1,p1_0))). % 8.88/1.48 cnf(i_0_178, plain, (link(s2,s1))). % 8.88/1.48 cnf(i_0_169, plain, (path(s0,p1_0))). % 8.88/1.48 cnf(i_0_171, plain, (path(s2,p2_1))). % 8.88/1.48 cnf(i_0_170, plain, (path(p1_0,s0))). % 8.88/1.48 cnf(i_0_172, plain, (path(p2_1,s2))). % 8.88/1.48 cnf(i_0_167, plain, (path(s1,p1_0))). % 8.88/1.48 cnf(i_0_173, plain, (path(s1,p2_1))). % 8.88/1.48 cnf(i_0_168, plain, (path(p1_0,s1))). % 8.88/1.48 cnf(i_0_174, plain, (path(p2_1,s1))). % 8.88/1.48 cnf(i_0_181, plain, (s(s1,s1,s1,s1,s1,s2,s0))). % 8.88/1.48 cnf(i_0_134, plain, (~neq(s0,s0))). % 8.88/1.48 cnf(i_0_150, plain, (~neq(s2,s2))). % 8.88/1.48 cnf(i_0_118, plain, (~neq(truck1,truck1))). % 8.88/1.48 cnf(i_0_126, plain, (~neq(truck2,truck2))). % 8.88/1.48 cnf(i_0_142, plain, (~neq(s1,s1))). % 8.88/1.48 cnf(i_0_158, plain, (~neq(p1_0,p1_0))). % 8.88/1.48 cnf(i_0_182, negated_conjecture, (~s(s0,s0,s2,s2,X1,s2,X2))). % 8.88/1.48 cnf(i_0_166, plain, (~neq(p2_1,p2_1))). % 8.88/1.48 cnf(i_0_111, plain, (s(X1,X2,X3,X4,X5,X6,X5)|~s(X1,X2,X3,X4,truck2,X6,X5))). % 8.88/1.48 cnf(i_0_109, plain, (s(X1,X2,X3,X4,X5,X5,X6)|~s(X1,X2,X3,X4,truck1,X5,X6))). % 8.88/1.48 cnf(i_0_107, plain, (s(X1,X2,X3,X4,X5,X6,X4)|~s(X1,X2,X3,truck2,X5,X6,X4))). % 8.88/1.48 cnf(i_0_105, plain, (s(X1,X2,X3,X4,X5,X4,X6)|~s(X1,X2,X3,truck1,X5,X4,X6))). % 8.88/1.48 cnf(i_0_103, plain, (s(X1,X2,X3,X4,X5,X6,X3)|~s(X1,X2,truck2,X4,X5,X6,X3))). % 8.88/1.48 cnf(i_0_101, plain, (s(X1,X2,X3,X4,X5,X3,X6)|~s(X1,X2,truck1,X4,X5,X3,X6))). % 8.88/1.48 cnf(i_0_99, plain, (s(X1,X2,X3,X4,X5,X6,X2)|~s(X1,truck2,X3,X4,X5,X6,X2))). % 8.88/1.48 cnf(i_0_97, plain, (s(X1,X2,X3,X4,X5,X2,X6)|~s(X1,truck1,X3,X4,X5,X2,X6))). % 8.88/1.48 cnf(i_0_95, plain, (s(X1,X2,X3,X4,X5,X6,X1)|~s(truck2,X2,X3,X4,X5,X6,X1))). % 8.88/1.48 cnf(i_0_93, plain, (s(X1,X2,X3,X4,X5,X1,X6)|~s(truck1,X2,X3,X4,X5,X1,X6))). % 8.88/1.48 cnf(i_0_100, plain, (s(X1,X2,truck1,X3,X4,X5,X6)|~s(X1,X2,X5,X3,X4,X5,X6))). % 8.88/1.48 cnf(i_0_102, plain, (s(X1,X2,truck2,X3,X4,X5,X6)|~s(X1,X2,X6,X3,X4,X5,X6))). % 8.88/1.48 cnf(i_0_96, plain, (s(X1,truck1,X2,X3,X4,X5,X6)|~s(X1,X5,X2,X3,X4,X5,X6))). % 8.88/1.48 cnf(i_0_98, plain, (s(X1,truck2,X2,X3,X4,X5,X6)|~s(X1,X6,X2,X3,X4,X5,X6))). % 8.88/1.48 cnf(i_0_92, plain, (s(truck1,X1,X2,X3,X4,X5,X6)|~s(X5,X1,X2,X3,X4,X5,X6))). % 8.88/1.48 cnf(i_0_94, plain, (s(truck2,X1,X2,X3,X4,X5,X6)|~s(X6,X1,X2,X3,X4,X5,X6))). % 8.88/1.48 cnf(i_0_108, plain, (s(X1,X2,X3,X4,truck1,X5,X6)|~neq(X4,truck1)|~s(X1,X2,X3,X4,X5,X5,X6))). % 8.88/1.48 cnf(i_0_114, plain, (s(X1,X2,X3,X4,truck1,X5,X6)|~link(X7,X5)|~s(X1,X2,X3,X4,truck1,X7,X6))). % 8.88/1.48 cnf(i_0_110, plain, (s(X1,X2,X3,X4,truck2,X5,X6)|~neq(X4,truck2)|~s(X1,X2,X3,X4,X6,X5,X6))). % 8.88/1.48 cnf(i_0_104, plain, (s(X1,X2,X3,truck1,X4,X5,X6)|~neq(X4,truck1)|~s(X1,X2,X3,X5,X4,X5,X6))). % 8.88/1.48 cnf(i_0_106, plain, (s(X1,X2,X3,truck2,X4,X5,X6)|~neq(X4,truck2)|~s(X1,X2,X3,X6,X4,X5,X6))). % 8.88/1.48 cnf(i_0_115, plain, (s(X1,X2,X3,X4,truck2,X5,X6)|~link(X7,X6)|~s(X1,X2,X3,X4,truck2,X5,X7))). % 8.88/1.48 cnf(i_0_112, plain, (s(X1,X2,X3,truck1,X4,X5,X6)|~link(X7,X5)|~s(X1,X2,X3,truck1,X4,X7,X6))). % 8.88/1.48 cnf(i_0_113, plain, (s(X1,X2,X3,truck2,X4,X5,X6)|~link(X7,X6)|~s(X1,X2,X3,truck2,X4,X5,X7))). % 8.88/1.48 cnf(i_0_116, plain, (s(X1,X2,X3,X4,X5,X6,X7)|~path(X8,X4)|~s(X1,X2,X3,X8,X5,X6,X7))). % 8.88/1.48 cnf(i_0_117, plain, (s(X1,X2,X3,X4,X5,X6,X7)|~path(X8,X5)|~s(X1,X2,X3,X4,X8,X6,X7))). % 8.88/1.48 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 8.88/1.48 # Begin printing tableau % 8.88/1.48 # Found 5 steps % 8.88/1.48 cnf(i_0_182, negated_conjecture, (~s(s0,s0,s2,s2,s0,s2,s0)), inference(start_rule)). % 8.88/1.48 cnf(i_0_183, plain, (~s(s0,s0,s2,s2,s0,s2,s0)), inference(extension_rule, [i_0_99])). % 8.88/1.48 cnf(i_0_197, plain, (~s(s0,truck2,s2,s2,s0,s2,s0)), inference(extension_rule, [i_0_111])). % 8.88/1.48 cnf(i_0_247, plain, (~s(s0,truck2,s2,s2,truck2,s2,s0)), inference(extension_rule, [i_0_105])). % 8.88/1.48 cnf(i_0_27576, plain, (~s(s0,truck2,s2,truck1,truck2,s2,s0)), inference(etableau_closure_rule, [i_0_27576, ...])). % 8.88/1.48 # End printing tableau % 8.88/1.48 # SZS output end % 8.88/1.48 # Branches closed with saturation will be marked with an "s" % 8.88/1.48 # Child (31659) has found a proof. % 8.88/1.48 % 8.88/1.48 # Proof search is over... % 8.88/1.48 # Freeing feature tree %------------------------------------------------------------------------------