%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN415+1 : 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 : n009.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:10:48 EDT 2022 % Result : Theorem 0.13s 0.39s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN415+1 : TPTP v8.1.0. Released v2.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 : n009.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 : Tue Jul 12 04:16:37 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_S4d % 0.13/0.37 # and selection function SelectCQIPrecWNTNp. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 10 Number of unprocessed: 10 % 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 # 10 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 10 conjectures. % 0.13/0.37 # There are 10 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 # 10 start rule tableaux created. % 0.13/0.37 # 10 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.13/0.39 # There were 8 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 8 total successful branch saturations. % 0.13/0.39 # There were 2 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 6 successful branch saturations after the branch. % 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_4, negated_conjecture, (f(esk5_0)|f(esk4_0))). % 0.13/0.39 cnf(i_0_3, negated_conjecture, (esk5_0=X1|f(esk4_0)|~f(X1))). % 0.13/0.39 cnf(i_0_5, negated_conjecture, (esk3_1(X1)!=X1|esk2_0!=esk1_0|~f(X2)|~f(X1))). % 0.13/0.39 cnf(i_0_6, negated_conjecture, (f(esk3_1(X1))|esk2_0!=esk1_0|~f(X2)|~f(X1))). % 0.13/0.39 cnf(i_0_9, negated_conjecture, (f(esk1_0)|esk3_1(X1)!=X1|~f(X2)|~f(X1))). % 0.13/0.39 cnf(i_0_2, negated_conjecture, (X1=X2|f(esk5_0)|~f(X2)|~f(X1))). % 0.13/0.39 cnf(i_0_7, negated_conjecture, (f(esk2_0)|esk3_1(X1)!=X1|~f(X2)|~f(X1))). % 0.13/0.39 cnf(i_0_10, negated_conjecture, (f(esk3_1(X1))|f(esk1_0)|~f(X2)|~f(X1))). % 0.13/0.39 cnf(i_0_8, negated_conjecture, (f(esk3_1(X1))|f(esk2_0)|~f(X2)|~f(X1))). % 0.13/0.39 cnf(i_0_1, negated_conjecture, (esk5_0=X1|X2=X3|~f(X3)|~f(X2)|~f(X1))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 15 steps % 0.13/0.39 cnf(i_0_2, negated_conjecture, (esk2_0=esk1_0|f(esk5_0)|~f(esk1_0)|~f(esk2_0)), inference(start_rule)). % 0.13/0.39 cnf(i_0_28, plain, (esk2_0=esk1_0), inference(extension_rule, [i_0_6])). % 0.13/0.39 cnf(i_0_74, plain, (f(esk3_1(esk5_0))), inference(extension_rule, [i_0_1])). % 0.13/0.39 cnf(i_0_81, plain, (~f(esk3_1(esk5_0))), inference(closure_rule, [i_0_74])). % 0.13/0.39 cnf(i_0_82, plain, (~f(esk3_1(esk5_0))), inference(closure_rule, [i_0_74])). % 0.13/0.39 cnf(i_0_29, plain, (f(esk5_0)), inference(etableau_closure_rule, [i_0_29, ...])). % 0.13/0.39 cnf(i_0_30, plain, (~f(esk1_0)), inference(etableau_closure_rule, [i_0_30, ...])). % 0.13/0.39 cnf(i_0_31, plain, (~f(esk2_0)), inference(etableau_closure_rule, [i_0_31, ...])). % 0.13/0.39 cnf(i_0_76, plain, (~f(esk5_0)), inference(etableau_closure_rule, [i_0_76, ...])). % 0.13/0.39 cnf(i_0_78, plain, (esk5_0=esk3_1(esk5_0)), inference(extension_rule, [i_0_7])). % 0.13/0.39 cnf(i_0_360, plain, (~f(esk3_1(esk5_0))), inference(closure_rule, [i_0_74])). % 0.13/0.39 cnf(i_0_77, plain, (~f(esk5_0)), inference(etableau_closure_rule, [i_0_77, ...])). % 0.13/0.39 cnf(i_0_79, plain, (esk3_1(esk5_0)=esk3_1(esk5_0)), inference(etableau_closure_rule, [i_0_79, ...])). % 0.13/0.39 cnf(i_0_358, plain, (f(esk2_0)), inference(etableau_closure_rule, [i_0_358, ...])). % 0.13/0.39 cnf(i_0_361, plain, (~f(esk5_0)), inference(etableau_closure_rule, [i_0_361, ...])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.19/0.39 # Child (31400) has found a proof. % 0.19/0.39 % 0.19/0.39 # Proof search is over... % 0.19/0.39 # Freeing feature tree %------------------------------------------------------------------------------