%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ036-1.005 : TPTP v8.1.0. Released v2.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 : n027.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 18:11:01 EDT 2022 % Result : Unsatisfiable 0.19s 0.42s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : PUZ036-1.005 : TPTP v8.1.0. Released v2.0.0. % 0.06/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n027.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sat May 28 21:39:59 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 5 Number of unprocessed: 5 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.19/0.41 # The folding up rule is enabled... % 0.19/0.41 # Local unification is enabled... % 0.19/0.41 # Any saturation attempts will use folding labels... % 0.19/0.41 # 5 beginning clauses after preprocessing and clausification % 0.19/0.41 # Creating start rules for all 1 conjectures. % 0.19/0.41 # There are 1 start rule candidates: % 0.19/0.41 # Found 2 unit axioms. % 0.19/0.41 # 1 start rule tableaux created. % 0.19/0.41 # 3 extension rule candidate clauses % 0.19/0.41 # 2 unit axiom clauses % 0.19/0.41 % 0.19/0.41 # Requested 8, 32 cores available to the main process. % 0.19/0.41 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.42 # There were 1 total branch saturation attempts. % 0.19/0.42 # There were 0 of these attempts blocked. % 0.19/0.42 # There were 0 deferred branch saturation attempts. % 0.19/0.42 # There were 0 free duplicated saturations. % 0.19/0.42 # There were 1 total successful branch saturations. % 0.19/0.42 # There were 0 successful branch saturations in interreduction. % 0.19/0.42 # There were 0 successful branch saturations on the branch. % 0.19/0.42 # There were 1 successful branch saturations after the branch. % 0.19/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # Begin clausification derivation % 0.19/0.42 % 0.19/0.42 # End clausification derivation % 0.19/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.42 cnf(i_0_7, hypothesis, (state(p_5,p_4,p_3,p_2,p_1,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20))). % 0.19/0.42 cnf(i_0_6, negated_conjecture, (~state(p_1,p_2,p_3,p_4,p_5,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20))). % 0.19/0.42 cnf(i_0_9, plain, (state(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20)|~state(X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20,X1))). % 0.19/0.42 cnf(i_0_10, plain, (state(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20)|~state(X4,X3,X2,X1,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20))). % 0.19/0.42 cnf(i_0_8, plain, (state(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20)|~state(X20,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19))). % 0.19/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.42 # Begin printing tableau % 0.19/0.42 # Found 4 steps % 0.19/0.42 cnf(i_0_6, negated_conjecture, (~state(p_1,p_2,p_3,p_4,p_5,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20)), inference(start_rule)). % 0.19/0.42 cnf(i_0_11, plain, (~state(p_1,p_2,p_3,p_4,p_5,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20)), inference(extension_rule, [i_0_8])). % 0.19/0.42 cnf(i_0_17, plain, (~state(p_20,p_1,p_2,p_3,p_4,p_5,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19)), inference(extension_rule, [i_0_10])). % 0.19/0.42 cnf(i_0_21, plain, (~state(p_3,p_2,p_1,p_20,p_4,p_5,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19)), inference(etableau_closure_rule, [i_0_21, ...])). % 0.19/0.42 # End printing tableau % 0.19/0.42 # SZS output end % 0.19/0.42 # Branches closed with saturation will be marked with an "s" % 0.19/0.42 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 0.19/0.42 # We now have 3 tableaux to operate on % 0.19/0.42 # Found closed tableau during pool population. % 0.19/0.42 # Proof search is over... % 0.19/0.42 # Freeing feature tree %------------------------------------------------------------------------------