%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN531-1 : TPTP v8.1.0. Released v2.1.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 : n024.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 : Thu Jul 21 06:12:10 EDT 2022 % Result : Satisfiable 0.20s 0.39s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SYN531-1 : TPTP v8.1.0. Released v2.1.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.13/0.35 % Computer : n024.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 Jul 12 04:35:43 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_OS_S1U % 0.20/0.38 # and selection function SelectComplexAHPExceptRRHorn. % 0.20/0.38 # % 0.20/0.38 # Number of axioms: 82 Number of unprocessed: 82 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 82 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 82 conjectures. % 0.20/0.38 # There are 82 start rule candidates: % 0.20/0.38 # Found 0 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 82 start rule tableaux created. % 0.20/0.38 # 82 extension rule candidate clauses % 0.20/0.38 # 0 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.39 # 21691 Satisfiable branch % 0.20/0.39 # Satisfiable branch found. % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 0 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 0 successful branch saturations after the branch. % 0.20/0.39 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_83, negated_conjecture, (c5_0|c4_0)). % 0.20/0.39 cnf(i_0_84, negated_conjecture, (ndr1_0|ssSkC3)). % 0.20/0.39 cnf(i_0_85, negated_conjecture, (ndr1_0|ssSkC2)). % 0.20/0.39 cnf(i_0_86, negated_conjecture, (ndr1_0|ssSkC1)). % 0.20/0.39 cnf(i_0_88, negated_conjecture, (c2_0|~c5_0)). % 0.20/0.39 cnf(i_0_98, negated_conjecture, (~c2_0|~c3_0)). % 0.20/0.39 cnf(i_0_87, negated_conjecture, (c5_0|ndr1_0|~ssSkC2)). % 0.20/0.39 cnf(i_0_95, negated_conjecture, (ndr1_0|c3_0|~c5_0)). % 0.20/0.39 cnf(i_0_99, negated_conjecture, (c3_0|c1_0|~c5_0)). % 0.20/0.39 cnf(i_0_110, negated_conjecture, (c4_0|~c5_0|~c2_0)). % 0.20/0.39 cnf(i_0_94, negated_conjecture, (ndr1_0|~ssSkC3|~c2_0)). % 0.20/0.39 cnf(i_0_107, negated_conjecture, (ndr1_0|~c2_0|~c1_0)). % 0.20/0.39 cnf(i_0_89, negated_conjecture, (ssSkC3|c2_1(a400))). % 0.20/0.39 cnf(i_0_90, negated_conjecture, (ssSkC2|c5_1(a392))). % 0.20/0.39 cnf(i_0_91, negated_conjecture, (ssSkC2|c3_1(a392))). % 0.20/0.39 cnf(i_0_92, negated_conjecture, (ssSkC2|c1_1(a392))). % 0.20/0.39 cnf(i_0_97, negated_conjecture, (c5_0|c3_1(a393)|~ssSkC2)). % 0.20/0.39 cnf(i_0_96, negated_conjecture, (c5_0|ndr1_1(a393)|~ssSkC2)). % 0.20/0.39 cnf(i_0_105, negated_conjecture, (ndr1_1(a401)|~ssSkC3|~c2_0)). % 0.20/0.39 cnf(i_0_113, negated_conjecture, (ndr1_1(a396)|~c2_0|~c1_0)). % 0.20/0.39 cnf(i_0_106, negated_conjecture, (c4_1(a401)|~ssSkC3|~c2_0)). % 0.20/0.39 cnf(i_0_114, negated_conjecture, (c4_1(a396)|~c2_0|~c1_0)). % 0.20/0.39 cnf(i_0_100, negated_conjecture, (ssSkC3|~c1_1(a400))). % 0.20/0.39 cnf(i_0_101, negated_conjecture, (ssSkC1|~c1_1(a390))). % 0.20/0.39 cnf(i_0_112, negated_conjecture, (c3_0|~c5_0|~c2_1(a399))). % 0.20/0.39 cnf(i_0_121, negated_conjecture, (~c2_0|~c1_0|~c3_1(a396))). % 0.20/0.39 cnf(i_0_93, negated_conjecture, (ndr1_1(X1)|ssSkP0(X1))). % 0.20/0.39 cnf(i_0_118, negated_conjecture, (c4_0|c1_0|ndr1_1(X1)|c4_1(X1)|~ndr1_0)). % 0.20/0.39 cnf(i_0_109, negated_conjecture, (c5_0|c5_2(a393,a394)|~ssSkC2)). % 0.20/0.39 cnf(i_0_108, negated_conjecture, (c5_0|c2_2(a393,a395)|~ssSkC2)). % 0.20/0.39 cnf(i_0_111, negated_conjecture, (c2_2(a401,a402)|~ssSkC3|~c2_0)). % 0.20/0.39 cnf(i_0_120, negated_conjecture, (c3_2(a396,a397)|~c2_0|~c1_0)). % 0.20/0.39 cnf(i_0_128, negated_conjecture, (c2_1(X1)|c5_1(X1)|c4_1(X1)|~c4_0|~ndr1_0)). % 0.20/0.39 cnf(i_0_102, negated_conjecture, (ssSkP0(X1)|c5_2(X1,a387))). % 0.20/0.39 cnf(i_0_103, negated_conjecture, (ssSkP0(X1)|c2_2(X1,a387))). % 0.20/0.39 cnf(i_0_104, negated_conjecture, (ssSkP0(X1)|c3_2(X1,a387))). % 0.20/0.39 cnf(i_0_127, negated_conjecture, (ssSkC0|c2_1(X1)|ndr1_1(X1)|~ndr1_0|~ssSkP0(X1))). % 0.20/0.39 cnf(i_0_133, negated_conjecture, (c5_1(X1)|c4_1(X1)|~ndr1_0|~c2_0|~c3_1(X1))). % 0.20/0.39 cnf(i_0_116, negated_conjecture, (c5_0|~ssSkC2|~c2_2(a393,a394))). % 0.20/0.39 cnf(i_0_117, negated_conjecture, (c5_0|~ssSkC2|~c3_2(a393,a394))). % 0.20/0.39 cnf(i_0_115, negated_conjecture, (c5_0|~ssSkC2|~c1_2(a393,a395))). % 0.20/0.39 cnf(i_0_123, negated_conjecture, (c4_0|c1_0|c4_1(X1)|c2_2(X1,a410)|~ndr1_0)). % 0.20/0.39 cnf(i_0_122, negated_conjecture, (c4_0|c1_0|c4_1(X1)|c1_2(X1,a410)|~ndr1_0)). % 0.20/0.39 cnf(i_0_119, negated_conjecture, (~ssSkC3|~c2_0|~c1_2(a401,a402))). % 0.20/0.39 cnf(i_0_124, negated_conjecture, (~c2_0|~c1_0|~c5_2(a396,a397))). % 0.20/0.39 cnf(i_0_125, negated_conjecture, (~c2_0|~c1_0|~c4_2(a396,a397))). % 0.20/0.39 cnf(i_0_132, negated_conjecture, (ndr1_1(X1)|~ndr1_0|~ssSkC0|~c5_1(X1)|~c1_1(X1))). % 0.20/0.39 cnf(i_0_136, negated_conjecture, (c4_0|c3_0|ndr1_1(X1)|~ndr1_0|~c3_1(X1)|~c1_1(X1))). % 0.20/0.39 cnf(i_0_140, negated_conjecture, (c2_1(X1)|c1_1(X1)|c2_1(a403)|~c5_0|~ndr1_0|~c3_1(X1))). % 0.20/0.39 cnf(i_0_139, negated_conjecture, (c2_1(X1)|c1_1(X1)|c1_1(a403)|~c5_0|~ndr1_0|~c3_1(X1))). % 0.20/0.39 cnf(i_0_138, negated_conjecture, (c2_1(X1)|c1_1(X1)|ndr1_1(a403)|~c5_0|~ndr1_0|~c3_1(X1))). % 0.20/0.39 cnf(i_0_126, negated_conjecture, (ssSkC3|~ndr1_1(a400)|~c3_2(a400,X1))). % 0.20/0.39 cnf(i_0_131, negated_conjecture, (ssSkC0|c2_1(X1)|c2_2(X1,a388)|~ndr1_0|~ssSkP0(X1))). % 0.20/0.39 cnf(i_0_130, negated_conjecture, (ssSkC0|c2_1(X1)|c3_2(X1,a388)|~ndr1_0|~ssSkP0(X1))). % 0.20/0.39 cnf(i_0_129, negated_conjecture, (c4_0|c1_0|c4_1(X1)|~ndr1_0|~c4_2(X1,a410))). % 0.20/0.39 cnf(i_0_137, negated_conjecture, (c1_2(X1,a389)|~ndr1_0|~ssSkC0|~c5_1(X1)|~c1_1(X1))). % 0.20/0.39 cnf(i_0_141, negated_conjecture, (c4_0|c3_0|c3_2(X1,a398)|~ndr1_0|~c3_1(X1)|~c1_1(X1))). % 0.20/0.39 cnf(i_0_146, negated_conjecture, (c2_1(X1)|c1_1(X1)|c3_2(a403,a404)|~c5_0|~ndr1_0|~c3_1(X1))). % 0.20/0.39 cnf(i_0_134, negated_conjecture, (ssSkC1|c5_2(a390,X1)|c1_2(a390,X1)|~ndr1_1(a390))). % 0.20/0.39 cnf(i_0_135, negated_conjecture, (ssSkC0|c2_1(X1)|~ndr1_0|~ssSkP0(X1)|~c1_2(X1,a388))). % 0.20/0.39 cnf(i_0_147, negated_conjecture, (c2_1(X1)|c1_1(X1)|~c5_0|~ndr1_0|~c3_1(X1)|~c4_2(a403,a404))). % 0.20/0.39 cnf(i_0_142, negated_conjecture, (~ndr1_0|~ssSkC0|~c5_1(X1)|~c1_1(X1)|~c3_2(X1,a389))). % 0.20/0.39 cnf(i_0_148, negated_conjecture, (c3_1(X1)|c2_2(X1,X2)|c3_2(X1,X2)|~c5_0|~ndr1_0|~c1_0|~ndr1_1(X1))). % 0.20/0.39 cnf(i_0_144, negated_conjecture, (c3_2(X1,X2)|c1_2(X1,X2)|c2_2(X1,a406)|~ndr1_0|~ssSkC4|~ndr1_1(X1))). % 0.20/0.39 cnf(i_0_145, negated_conjecture, (c3_2(X1,X2)|c1_2(X1,X2)|c3_2(X1,a406)|~ndr1_0|~ssSkC4|~ndr1_1(X1))). % 0.20/0.39 cnf(i_0_143, negated_conjecture, (c3_2(X1,X2)|c1_2(X1,X2)|c4_2(X1,a406)|~ndr1_0|~ssSkC4|~ndr1_1(X1))). % 0.20/0.39 cnf(i_0_149, negated_conjecture, (c2_0|c3_0|c1_1(X1)|c2_2(X1,X2)|c3_2(X1,X2)|c4_2(X1,X2)|~ndr1_0|~ndr1_1(X1))). % 0.20/0.39 cnf(i_0_151, negated_conjecture, (c5_1(X1)|c3_1(X1)|c1_2(X1,X2)|~ndr1_0|~ssSkC1|~ndr1_1(X1)|~c3_1(a391)|~c3_2(X1,X2))). % 0.20/0.39 cnf(i_0_150, negated_conjecture, (c3_0|~c5_0|~ndr1_1(a399)|~c5_2(a399,X1)|~c2_2(a399,X1)|~c1_2(a399,X1))). % 0.20/0.39 cnf(i_0_152, negated_conjecture, (c5_1(X1)|ndr1_1(a407)|c2_2(X1,X3)|c2_2(X1,X2)|c1_2(X1,X3)|~ndr1_0|~ndr1_1(X1)|~c4_2(X1,X2))). % 0.20/0.39 cnf(i_0_156, negated_conjecture, (c5_1(X1)|c2_2(X1,X3)|c2_2(X1,X2)|c1_2(X1,X3)|~ndr1_0|~ndr1_1(X1)|~c2_1(a407)|~c4_2(X1,X2))). % 0.20/0.39 cnf(i_0_160, negated_conjecture, (ssSkC4|c5_2(X1,X2)|c2_2(X1,X2)|~ndr1_0|~c1_1(X1)|~ndr1_1(X1)|~c3_2(X1,X2)|~c5_2(X1,a405))). % 0.20/0.39 cnf(i_0_161, negated_conjecture, (ssSkC4|c5_2(X1,X2)|c2_2(X1,X2)|~ndr1_0|~c1_1(X1)|~ndr1_1(X1)|~c3_2(X1,X2)|~c2_2(X1,a405))). % 0.20/0.39 cnf(i_0_162, negated_conjecture, (ssSkC4|c5_2(X1,X2)|c2_2(X1,X2)|~ndr1_0|~c1_1(X1)|~ndr1_1(X1)|~c3_2(X1,X2)|~c1_2(X1,a405))). % 0.20/0.39 cnf(i_0_154, negated_conjecture, (c5_1(X1)|c2_2(X1,X3)|c2_2(X1,X2)|c1_2(X1,X3)|c2_2(a407,a409)|~ndr1_0|~ndr1_1(X1)|~c4_2(X1,X2))). % 0.20/0.39 cnf(i_0_153, negated_conjecture, (c5_1(X1)|c2_2(X1,X3)|c2_2(X1,X2)|c1_2(X1,X3)|c1_2(a407,a409)|~ndr1_0|~ndr1_1(X1)|~c4_2(X1,X2))). % 0.20/0.39 cnf(i_0_155, negated_conjecture, (c5_1(X1)|c2_2(X1,X3)|c2_2(X1,X2)|c1_2(X1,X3)|c1_2(a407,a408)|~ndr1_0|~ndr1_1(X1)|~c4_2(X1,X2))). % 0.20/0.39 cnf(i_0_159, negated_conjecture, (c5_1(X1)|c2_2(X1,X3)|c2_2(X1,X2)|c1_2(X1,X3)|~ndr1_0|~ndr1_1(X1)|~c4_2(X1,X2)|~c5_2(a407,a408))). % 0.20/0.39 cnf(i_0_157, negated_conjecture, (c5_1(X1)|c2_2(X1,X3)|c2_2(X1,X2)|c1_2(X1,X3)|~ndr1_0|~ndr1_1(X1)|~c4_2(X1,X2)|~c3_2(a407,a409))). % 0.20/0.39 cnf(i_0_158, negated_conjecture, (c5_1(X1)|c2_2(X1,X3)|c2_2(X1,X2)|c1_2(X1,X3)|~ndr1_0|~ndr1_1(X1)|~c4_2(X1,X2)|~c3_2(a407,a408))). % 0.20/0.39 cnf(i_0_163, negated_conjecture, (c5_1(X1)|c3_1(X1)|c1_2(X1,X2)|c1_2(a391,X3)|c4_2(a391,X3)|~ndr1_0|~ssSkC1|~ndr1_1(X1)|~ndr1_1(a391)|~c3_2(X1,X2)|~c5_2(a391,X3))). % 0.20/0.39 cnf(i_0_164, negated_conjecture, (c5_1(X1)|c3_1(X1)|c1_2(X1,X2)|c4_2(a391,X3)|~ndr1_0|~ssSkC1|~ndr1_1(X1)|~ndr1_1(a391)|~c3_2(X1,X2)|~c3_2(a391,X3)|~c1_2(a391,X3))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 3 steps % 0.20/0.39 cnf(i_0_110, negated_conjecture, (c4_0|~c5_0|~c2_0), inference(start_rule)). % 0.20/0.39 cnf(i_0_516, plain, (c4_0), inference(extension_rule, [i_0_128])). % 0.20/0.39 cnf(i_0_1575, plain, (c2_1(a399)), inference(extension_rule, [i_0_112])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Child (21691) has found a proof. % 0.20/0.39 % 0.20/0.40 # Proof search is over... % 0.20/0.40 # Freeing feature tree %------------------------------------------------------------------------------