%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN417+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 : n022.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:49 EDT 2022 % Result : Theorem 0.19s 0.58s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN417+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.12/0.34 % Computer : n022.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 : Tue Jul 12 02:43:25 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: 8 Number of unprocessed: 8 % 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 # 8 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 8 conjectures. % 0.12/0.37 # There are 8 start rule candidates: % 0.12/0.37 # Found 0 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 8 start rule tableaux created. % 0.12/0.37 # 8 extension rule candidate clauses % 0.12/0.37 # 0 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.58 # There were 50 total branch saturation attempts. % 0.19/0.58 # There were 0 of these attempts blocked. % 0.19/0.58 # There were 0 deferred branch saturation attempts. % 0.19/0.58 # There were 10 free duplicated saturations. % 0.19/0.58 # There were 50 total successful branch saturations. % 0.19/0.58 # There were 3 successful branch saturations in interreduction. % 0.19/0.58 # There were 0 successful branch saturations on the branch. % 0.19/0.58 # There were 37 successful branch saturations after the branch. % 0.19/0.58 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.58 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.58 # Begin clausification derivation % 0.19/0.58 % 0.19/0.58 # End clausification derivation % 0.19/0.58 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.58 cnf(i_0_4, negated_conjecture, (g(f(esk4_0))=esk4_0|f(g(esk3_0))=esk3_0)). % 0.19/0.58 cnf(i_0_2, negated_conjecture, (g(f(esk4_0))=esk4_0|esk3_0=X1|f(g(X1))!=X1)). % 0.19/0.58 cnf(i_0_3, negated_conjecture, (f(g(esk3_0))=esk3_0|esk4_0=X1|g(f(X1))!=X1)). % 0.19/0.58 cnf(i_0_1, negated_conjecture, (esk4_0=X1|esk3_0=X2|f(g(X2))!=X2|g(f(X1))!=X1)). % 0.19/0.58 cnf(i_0_5, negated_conjecture, (f(g(X1))!=X1|g(f(X2))!=X2|esk1_1(X1)!=X1|esk2_1(X2)!=X2)). % 0.19/0.58 cnf(i_0_7, negated_conjecture, (f(g(esk1_1(X1)))=esk1_1(X1)|f(g(X1))!=X1|g(f(X2))!=X2|esk2_1(X2)!=X2)). % 0.19/0.58 cnf(i_0_6, negated_conjecture, (g(f(esk2_1(X1)))=esk2_1(X1)|f(g(X2))!=X2|g(f(X1))!=X1|esk1_1(X2)!=X2)). % 0.19/0.58 cnf(i_0_8, negated_conjecture, (g(f(esk2_1(X1)))=esk2_1(X1)|f(g(esk1_1(X2)))=esk1_1(X2)|f(g(X2))!=X2|g(f(X1))!=X1)). % 0.19/0.58 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.58 # Begin printing tableau % 0.19/0.58 # Found 8 steps % 0.19/0.58 cnf(i_0_4, negated_conjecture, (g(f(esk4_0))=esk4_0|f(g(esk3_0))=esk3_0), inference(start_rule)). % 0.19/0.58 cnf(i_0_36, plain, (f(g(esk3_0))=esk3_0), inference(extension_rule, [i_0_5])). % 0.19/0.58 cnf(i_0_12426, plain, (g(f(esk4_0))!=esk4_0), inference(extension_rule, [i_0_2])). % 0.19/0.58 cnf(i_0_12431, plain, (f(g(esk3_0))!=esk3_0), inference(closure_rule, [i_0_36])). % 0.19/0.58 cnf(i_0_35, plain, (g(f(esk4_0))=esk4_0), inference(etableau_closure_rule, [i_0_35, ...])). % 0.19/0.58 cnf(i_0_12427, plain, (esk1_1(esk3_0)!=esk3_0), inference(etableau_closure_rule, [i_0_12427, ...])). % 0.19/0.58 cnf(i_0_12428, plain, (esk2_1(esk4_0)!=esk4_0), inference(etableau_closure_rule, [i_0_12428, ...])). % 0.19/0.58 cnf(i_0_12430, plain, (esk3_0=esk3_0), inference(etableau_closure_rule, [i_0_12430, ...])). % 0.19/0.58 # End printing tableau % 0.19/0.58 # SZS output end % 0.19/0.58 # Branches closed with saturation will be marked with an "s" % 0.19/0.58 # Child (4958) has found a proof. % 0.19/0.58 % 0.19/0.58 # Proof search is over... % 0.19/0.58 # Freeing feature tree %------------------------------------------------------------------------------