%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN037-1 : TPTP v8.1.0. Released v1.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 : n007.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:07:23 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.07/0.12 % Problem : SYN037-1 : TPTP v8.1.0. Released v1.0.0. % 0.07/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.34 % Computer : n007.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jul 11 22:56:48 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___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 36 Number of unprocessed: 36 % 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 # 36 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 36 conjectures. % 0.13/0.37 # There are 36 start rule candidates: % 0.13/0.37 # Found 0 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 36 start rule tableaux created. % 0.13/0.37 # 36 extension rule candidate clauses % 0.13/0.37 # 0 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.40 # There were 10 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 10 total successful branch saturations. % 0.19/0.40 # There were 1 successful branch saturations in interreduction. % 0.19/0.40 # There were 0 successful branch saturations on the branch. % 0.19/0.40 # There were 9 successful branch saturations after the branch. % 0.19/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # SZS output start for /export/starexec/sandbox2/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_58, negated_conjecture, (q(s3)|~n3)). % 0.19/0.40 cnf(i_0_45, negated_conjecture, (n8|~q(s8))). % 0.19/0.40 cnf(i_0_55, negated_conjecture, (n4|~p(s4))). % 0.19/0.40 cnf(i_0_65, negated_conjecture, (n9|~n3|~n4)). % 0.19/0.40 cnf(i_0_69, negated_conjecture, (n10|~n7|~n8)). % 0.19/0.40 cnf(i_0_66, negated_conjecture, (n3|n4|n9)). % 0.19/0.40 cnf(i_0_48, negated_conjecture, (p(s7)|~n7)). % 0.19/0.40 cnf(i_0_71, negated_conjecture, (n8|~n7|~n10)). % 0.19/0.40 cnf(i_0_67, negated_conjecture, (n4|~n3|~n9)). % 0.19/0.40 cnf(i_0_37, negated_conjecture, (~n10|~n6|~n9|~n2)). % 0.19/0.40 cnf(i_0_59, negated_conjecture, (n2|~n1(X1))). % 0.19/0.40 cnf(i_0_50, negated_conjecture, (n5(s6)|~n6)). % 0.19/0.40 cnf(i_0_72, negated_conjecture, (n7|~n8|~n10)). % 0.19/0.40 cnf(i_0_68, negated_conjecture, (n3|~n4|~n9)). % 0.19/0.40 cnf(i_0_60, negated_conjecture, (n1(s2)|~n2)). % 0.19/0.40 cnf(i_0_70, negated_conjecture, (n7|n8|n10)). % 0.19/0.41 cnf(i_0_40, negated_conjecture, (n10|n6|n9|n2)). % 0.19/0.41 cnf(i_0_46, negated_conjecture, (q(X1)|~n8)). % 0.19/0.41 cnf(i_0_49, negated_conjecture, (n6|~n5(X1))). % 0.19/0.41 cnf(i_0_47, negated_conjecture, (n7|~p(X1))). % 0.19/0.41 cnf(i_0_57, negated_conjecture, (n3|~q(X1))). % 0.19/0.41 cnf(i_0_56, negated_conjecture, (p(X1)|~n4)). % 0.19/0.41 cnf(i_0_39, negated_conjecture, (n9|n2|~n10|~n6)). % 0.19/0.41 cnf(i_0_43, negated_conjecture, (n10|n2|~n6|~n9)). % 0.19/0.41 cnf(i_0_41, negated_conjecture, (n10|n9|~n6|~n2)). % 0.19/0.41 cnf(i_0_44, negated_conjecture, (n6|n2|~n10|~n9)). % 0.19/0.41 cnf(i_0_42, negated_conjecture, (n6|n9|~n10|~n2)). % 0.19/0.41 cnf(i_0_38, negated_conjecture, (n10|n6|~n9|~n2)). % 0.19/0.41 cnf(i_0_52, negated_conjecture, (n5(X1)|q(s5(X1))|q(X1))). % 0.19/0.41 cnf(i_0_53, negated_conjecture, (q(X1)|~n5(X1)|~q(X2))). % 0.19/0.41 cnf(i_0_64, negated_conjecture, (p(X1)|~n1(X1)|~p(X2))). % 0.19/0.41 cnf(i_0_51, negated_conjecture, (n5(X1)|~q(s5(X1))|~q(X1))). % 0.19/0.41 cnf(i_0_61, negated_conjecture, (n1(X1)|~p(s1(X1))|~p(X1))). % 0.19/0.41 cnf(i_0_62, negated_conjecture, (n1(X1)|p(s1(X1))|p(X1))). % 0.19/0.41 cnf(i_0_54, negated_conjecture, (q(X1)|~n5(X2)|~q(X2))). % 0.19/0.41 cnf(i_0_63, negated_conjecture, (p(X1)|~n1(X2)|~p(X2))). % 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.41 # Begin printing tableau % 0.19/0.41 # Found 24 steps % 0.19/0.41 cnf(i_0_62, negated_conjecture, (n1(s7)|p(s1(s7))|p(s7)), inference(start_rule)). % 0.19/0.41 cnf(i_0_79, plain, (n1(s7)), inference(extension_rule, [i_0_59])). % 0.19/0.41 cnf(i_0_252, plain, (n2), inference(extension_rule, [i_0_38])). % 0.19/0.41 cnf(i_0_278, plain, (n10), inference(extension_rule, [i_0_72])). % 0.19/0.41 cnf(i_0_279, plain, (n6), inference(extension_rule, [i_0_50])). % 0.19/0.41 cnf(i_0_280, plain, (~n9), inference(extension_rule, [i_0_66])). % 0.19/0.41 cnf(i_0_81, plain, (p(s7)), inference(extension_rule, [i_0_47])). % 0.19/0.41 cnf(i_0_1056, plain, (n7), inference(extension_rule, [i_0_71])). % 0.19/0.41 cnf(i_0_1123, plain, (n8), inference(extension_rule, [i_0_46])). % 0.19/0.41 cnf(i_0_1125, plain, (~n10), inference(extension_rule, [i_0_41])). % 0.19/0.41 cnf(i_0_80, plain, (p(s1(s7))), inference(extension_rule, [i_0_47])). % 0.19/0.41 cnf(i_0_4138, plain, (n7), inference(extension_rule, [i_0_48])). % 0.19/0.41 cnf(i_0_4214, plain, (p(s7)), inference(extension_rule, [i_0_61])). % 0.19/0.41 cnf(i_0_4438, plain, (~p(s1(s7))), inference(closure_rule, [i_0_80])). % 0.19/0.41 cnf(i_0_348, plain, (n7), inference(etableau_closure_rule, [i_0_348, ...])). % 0.19/0.41 cnf(i_0_349, plain, (~n8), inference(etableau_closure_rule, [i_0_349, ...])). % 0.19/0.41 cnf(i_0_417, plain, (n5(s6)), inference(etableau_closure_rule, [i_0_417, ...])). % 0.19/0.41 cnf(i_0_497, plain, (n3), inference(etableau_closure_rule, [i_0_497, ...])). % 0.19/0.41 cnf(i_0_498, plain, (n4), inference(etableau_closure_rule, [i_0_498, ...])). % 0.19/0.41 cnf(i_0_1170, plain, (q(X2)), inference(etableau_closure_rule, [i_0_1170, ...])). % 0.19/0.41 cnf(i_0_1199, plain, (n9), inference(etableau_closure_rule, [i_0_1199, ...])). % 0.19/0.41 cnf(i_0_1200, plain, (~n6), inference(etableau_closure_rule, [i_0_1200, ...])). % 0.19/0.41 cnf(i_0_1201, plain, (~n2), inference(etableau_closure_rule, [i_0_1201, ...])). % 0.19/0.41 cnf(i_0_4437, plain, (n1(s7)), inference(etableau_closure_rule, [i_0_4437, ...])). % 0.19/0.41 # End printing tableau % 0.19/0.41 # SZS output end % 0.19/0.41 # Branches closed with saturation will be marked with an "s" % 0.19/0.41 # Child (23296) has found a proof. % 0.19/0.41 % 0.19/0.41 # Proof search is over... % 0.19/0.41 # Freeing feature tree %------------------------------------------------------------------------------