%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ047-1 : TPTP v8.1.0. Released v2.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 : n017.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:03 EDT 2022 % Result : Unsatisfiable 0.20s 0.37s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : PUZ047-1 : TPTP v8.1.0. Released v2.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 : n017.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.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.20/0.34 % DateTime : Sat May 28 19:50:38 EDT 2022 % 0.20/0.34 % CPUTime : % 0.20/0.36 # No SInE strategy applied % 0.20/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.36 # % 0.20/0.36 # Presaturation interreduction done % 0.20/0.36 # Number of axioms: 16 Number of unprocessed: 16 % 0.20/0.36 # Tableaux proof search. % 0.20/0.36 # APR header successfully linked. % 0.20/0.36 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 16 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 16 conjectures. % 0.20/0.37 # There are 16 start rule candidates: % 0.20/0.37 # Found 2 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 16 start rule tableaux created. % 0.20/0.37 # 14 extension rule candidate clauses % 0.20/0.37 # 2 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_17, negated_conjecture, (p(south,south,south,south,start))). % 0.20/0.37 cnf(i_0_32, negated_conjecture, (~p(north,north,north,north,X1))). % 0.20/0.37 cnf(i_0_23, negated_conjecture, (p(south,south,south,north,take_wolf(X1))|~p(north,north,south,north,X1))). % 0.20/0.37 cnf(i_0_21, negated_conjecture, (p(south,south,north,south,go_alone(X1))|~p(north,south,north,south,X1))). % 0.20/0.37 cnf(i_0_25, negated_conjecture, (p(south,south,north,south,take_wolf(X1))|~p(north,north,north,south,X1))). % 0.20/0.37 cnf(i_0_31, negated_conjecture, (p(south,south,north,south,take_cabbage(X1))|~p(north,south,north,north,X1))). % 0.20/0.37 cnf(i_0_29, negated_conjecture, (p(south,north,south,south,take_cabbage(X1))|~p(north,north,south,north,X1))). % 0.20/0.37 cnf(i_0_27, negated_conjecture, (p(south,X1,south,X2,take_goat(X3))|~p(north,X1,north,X2,X3))). % 0.20/0.37 cnf(i_0_26, negated_conjecture, (p(north,X1,north,X2,take_goat(X3))|~p(south,X1,south,X2,X3))). % 0.20/0.37 cnf(i_0_19, negated_conjecture, (p(south,north,south,north,go_alone(X1))|~p(north,north,south,north,X1))). % 0.20/0.37 cnf(i_0_20, negated_conjecture, (p(north,south,north,south,go_alone(X1))|~p(south,south,north,south,X1))). % 0.20/0.37 cnf(i_0_30, negated_conjecture, (p(north,south,north,north,take_cabbage(X1))|~p(south,south,north,south,X1))). % 0.20/0.37 cnf(i_0_18, negated_conjecture, (p(north,north,south,north,go_alone(X1))|~p(south,north,south,north,X1))). % 0.20/0.37 cnf(i_0_22, negated_conjecture, (p(north,north,south,north,take_wolf(X1))|~p(south,south,south,north,X1))). % 0.20/0.37 cnf(i_0_28, negated_conjecture, (p(north,north,south,north,take_cabbage(X1))|~p(south,north,south,south,X1))). % 0.20/0.37 cnf(i_0_24, negated_conjecture, (p(north,north,north,south,take_wolf(X1))|~p(south,south,north,south,X1))). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 5 steps % 0.20/0.37 cnf(i_0_26, negated_conjecture, (p(north,north,north,north,take_goat(go_alone(take_cabbage(X3))))|~p(south,north,south,north,go_alone(take_cabbage(X3)))), inference(start_rule)). % 0.20/0.37 cnf(i_0_47, plain, (p(north,north,north,north,take_goat(go_alone(take_cabbage(X3))))), inference(closure_rule, [i_0_32])). % 0.20/0.37 cnf(i_0_48, plain, (~p(south,north,south,north,go_alone(take_cabbage(X3)))), inference(extension_rule, [i_0_19])). % 0.20/0.37 cnf(i_0_76, plain, (~p(north,north,south,north,take_cabbage(X3))), inference(extension_rule, [i_0_28])). % 0.20/0.37 cnf(i_0_80, plain, (~p(south,north,south,south,X3)), inference(etableau_closure_rule, [i_0_80, ...])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # Child (30867) has found a proof. % 0.20/0.37 % 0.20/0.37 # Proof search is over... % 0.20/0.37 # Freeing feature tree %------------------------------------------------------------------------------