%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN558-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 : n014.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:27 EDT 2022 % Result : Unsatisfiable 0.19s 0.40s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN558-1 : TPTP v8.1.0. Released v2.5.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 : n014.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 : Mon Jul 11 11:41:19 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: 14 Number of unprocessed: 14 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 14 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 14 conjectures. % 0.12/0.37 # There are 14 start rule candidates: % 0.12/0.37 # Found 6 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 14 start rule tableaux created. % 0.12/0.37 # 8 extension rule candidate clauses % 0.12/0.37 # 6 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.40 # There were 1 total branch saturation attempts. % 0.19/0.40 # There were 0 of these attempts blocked. % 0.19/0.40 # There were 0 deferred branch saturation attempts. % 0.19/0.40 # There were 0 free duplicated saturations. % 0.19/0.40 # There were 1 total successful branch saturations. % 0.19/0.40 # There were 0 successful branch saturations in interreduction. % 0.19/0.40 # There were 0 successful branch saturations on the branch. % 0.19/0.40 # There were 1 successful branch saturations after the branch. % 0.19/0.40 # There were 1 total branch saturation attempts. % 0.19/0.40 # There were 0 of these attempts blocked. % 0.19/0.40 # There were 0 deferred branch saturation attempts. % 0.19/0.40 # There were 0 free duplicated saturations. % 0.19/0.40 # There were 1 total successful branch saturations. % 0.19/0.40 # There were 0 successful branch saturations in interreduction. % 0.19/0.40 # There were 0 successful branch saturations on the branch. % 0.19/0.40 # There were 1 successful branch saturations after the branch. % 0.19/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.40 # Begin clausification derivation % 0.19/0.40 % 0.19/0.40 # End clausification derivation % 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.40 cnf(i_0_18, negated_conjecture, (p5(c7,c10,c9))). % 0.19/0.40 cnf(i_0_19, negated_conjecture, (p5(c7,c10,c8))). % 0.19/0.40 cnf(i_0_17, negated_conjecture, (p6(c7,f3(X1)))). % 0.19/0.40 cnf(i_0_15, negated_conjecture, (p2(X1,X1))). % 0.19/0.40 cnf(i_0_16, negated_conjecture, (p4(X1,X1))). % 0.19/0.40 cnf(i_0_20, negated_conjecture, (p5(c7,X1,f3(X1)))). % 0.19/0.40 cnf(i_0_22, negated_conjecture, (~p5(c7,c9,X1)|~p5(c7,c8,X1))). % 0.19/0.40 cnf(i_0_23, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.19/0.40 cnf(i_0_24, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.19/0.40 cnf(i_0_21, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.19/0.40 cnf(i_0_26, negated_conjecture, (p6(X1,X2)|~p6(X3,X4)|~p4(X3,X1)|~p2(X4,X2))). % 0.19/0.40 cnf(i_0_25, negated_conjecture, (p5(X1,X2,X3)|~p5(X1,X4,X3)|~p5(X1,X2,X4))). % 0.19/0.40 cnf(i_0_27, negated_conjecture, (p2(X1,X2)|~p5(c7,X3,X2)|~p5(c7,X3,X1)|~p6(c7,X2)|~p6(c7,X1))). % 0.19/0.40 cnf(i_0_28, negated_conjecture, (p5(X1,X2,X3)|~p5(X4,X5,X6)|~p4(X4,X1)|~p2(X6,X3)|~p2(X5,X2))). % 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.40 # Begin printing tableau % 0.19/0.40 # Found 12 steps % 0.19/0.40 cnf(i_0_24, negated_conjecture, (p4(c7,c7)|~p4(c7,c7)|~p4(c7,c7)), inference(start_rule)). % 0.19/0.40 cnf(i_0_49, plain, (~p4(c7,c7)), inference(closure_rule, [i_0_16])). % 0.19/0.40 cnf(i_0_50, plain, (~p4(c7,c7)), inference(closure_rule, [i_0_16])). % 0.19/0.40 cnf(i_0_48, plain, (p4(c7,c7)), inference(extension_rule, [i_0_28])). % 0.19/0.40 cnf(i_0_63, plain, (~p5(c7,X6,f3(X6))), inference(closure_rule, [i_0_20])). % 0.19/0.40 cnf(i_0_65, plain, (~p2(f3(X6),f3(X6))), inference(closure_rule, [i_0_15])). % 0.19/0.40 cnf(i_0_66, plain, (~p2(X6,X6)), inference(closure_rule, [i_0_15])). % 0.19/0.40 cnf(i_0_62, plain, (p5(c7,X6,f3(X6))), inference(extension_rule, [i_0_27])). % 0.19/0.40 cnf(i_0_69, plain, (~p5(c7,X6,f3(X6))), inference(closure_rule, [i_0_20])). % 0.19/0.40 cnf(i_0_70, plain, (~p6(c7,f3(X6))), inference(closure_rule, [i_0_17])). % 0.19/0.40 cnf(i_0_71, plain, (~p6(c7,f3(X6))), inference(closure_rule, [i_0_17])). % 0.19/0.40 cnf(i_0_67, plain, (p2(f3(X6),f3(X6))), inference(etableau_closure_rule, [i_0_67, ...])). % 0.19/0.40 # End printing tableau % 0.19/0.40 # SZS output end % 0.19/0.40 # Branches closed with saturation will be marked with an "s" % 0.19/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.40 # Begin clausification derivation % 0.19/0.40 % 0.19/0.40 # End clausification derivation % 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.40 cnf(i_0_18, negated_conjecture, (p5(c7,c10,c9))). % 0.19/0.40 cnf(i_0_19, negated_conjecture, (p5(c7,c10,c8))). % 0.19/0.40 cnf(i_0_17, negated_conjecture, (p6(c7,f3(X1)))). % 0.19/0.40 cnf(i_0_15, negated_conjecture, (p2(X1,X1))). % 0.19/0.40 cnf(i_0_16, negated_conjecture, (p4(X1,X1))). % 0.19/0.40 cnf(i_0_20, negated_conjecture, (p5(c7,X1,f3(X1)))). % 0.19/0.40 cnf(i_0_22, negated_conjecture, (~p5(c7,c9,X1)|~p5(c7,c8,X1))). % 0.19/0.40 cnf(i_0_23, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.19/0.40 cnf(i_0_24, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.19/0.40 cnf(i_0_21, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.19/0.40 cnf(i_0_26, negated_conjecture, (p6(X1,X2)|~p6(X3,X4)|~p4(X3,X1)|~p2(X4,X2))). % 0.19/0.40 cnf(i_0_25, negated_conjecture, (p5(X1,X2,X3)|~p5(X1,X4,X3)|~p5(X1,X2,X4))). % 0.19/0.40 cnf(i_0_27, negated_conjecture, (p2(X1,X2)|~p5(c7,X3,X2)|~p5(c7,X3,X1)|~p6(c7,X2)|~p6(c7,X1))). % 0.19/0.40 cnf(i_0_28, negated_conjecture, (p5(X1,X2,X3)|~p5(X4,X5,X6)|~p4(X4,X1)|~p2(X6,X3)|~p2(X5,X2))). % 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.40 # Begin printing tableau % 0.19/0.40 # Found 13 steps % 0.19/0.40 cnf(i_0_26, negated_conjecture, (p6(c7,f3(X16))|~p6(c7,f3(X16))|~p4(c7,c7)|~p2(f3(X16),f3(X16))), inference(start_rule)). % 0.19/0.40 cnf(i_0_43, plain, (~p6(c7,f3(X16))), inference(closure_rule, [i_0_17])). % 0.19/0.40 cnf(i_0_44, plain, (~p4(c7,c7)), inference(closure_rule, [i_0_16])). % 0.19/0.40 cnf(i_0_45, plain, (~p2(f3(X16),f3(X16))), inference(closure_rule, [i_0_15])). % 0.19/0.40 cnf(i_0_42, plain, (p6(c7,f3(X16))), inference(extension_rule, [i_0_27])). % 0.19/0.40 cnf(i_0_68, plain, (~p5(c7,X16,f3(X16))), inference(closure_rule, [i_0_20])). % 0.19/0.40 cnf(i_0_69, plain, (~p5(c7,X16,f3(X16))), inference(closure_rule, [i_0_20])). % 0.19/0.40 cnf(i_0_71, plain, (~p6(c7,f3(X16))), inference(closure_rule, [i_0_17])). % 0.19/0.40 cnf(i_0_67, plain, (p2(f3(X16),f3(X16))), inference(extension_rule, [i_0_28])). % 0.19/0.40 cnf(i_0_73, plain, (~p5(c7,X16,f3(X16))), inference(closure_rule, [i_0_20])). % 0.19/0.40 cnf(i_0_74, plain, (~p4(c7,c7)), inference(closure_rule, [i_0_16])). % 0.19/0.40 cnf(i_0_76, plain, (~p2(X16,X16)), inference(closure_rule, [i_0_15])). % 0.19/0.40 cnf(i_0_72, plain, (p5(c7,X16,f3(X16))), inference(etableau_closure_rule, [i_0_72, ...])). % 0.19/0.40 # End printing tableau % 0.19/0.40 # SZS output end % 0.19/0.40 # Branches closed with saturation will be marked with an "s" % 0.19/0.40 # Child (18326) has found a proof. % 0.19/0.40 % 0.19/0.40 # Proof search is over... % 0.19/0.40 # Freeing feature tree %------------------------------------------------------------------------------