%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUN069+2 : TPTP v8.1.0. Released v7.3.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 16:26:19 EDT 2022 % Result : Theorem 0.14s 0.39s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : NUN069+2 : TPTP v8.1.0. Released v7.3.0. % 0.12/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n017.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Thu Jun 2 04:15:57 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b % 0.14/0.39 # and selection function SelectCQIPrecW. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 28 Number of unprocessed: 28 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 28 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 1 conjectures. % 0.14/0.39 # There are 1 start rule candidates: % 0.14/0.39 # Found 17 unit axioms. % 0.14/0.39 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done. % 0.14/0.39 # Found closed tableau while making start rule % 0.14/0.39 # There were 0 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 0 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 0 successful branch saturations after the branch. % 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_30, plain, (r1(esk14_1(X1)))). % 0.14/0.39 cnf(i_0_2, plain, (r1(esk1_0))). % 0.14/0.39 cnf(i_0_32, plain, (r1(esk15_1(X1)))). % 0.14/0.39 cnf(i_0_34, plain, (r1(esk16_1(X1)))). % 0.14/0.39 cnf(i_0_6, plain, (r2(X1,esk2_1(X1)))). % 0.14/0.39 cnf(i_0_21, plain, (r2(X1,esk7_2(X2,X1)))). % 0.14/0.39 cnf(i_0_26, plain, (r2(X1,esk11_2(X2,X1)))). % 0.14/0.39 cnf(i_0_29, plain, (r3(X1,esk14_1(X1),X1))). % 0.14/0.39 cnf(i_0_17, plain, (r3(X1,X2,esk8_2(X1,X2)))). % 0.14/0.39 cnf(i_0_22, plain, (r4(X1,X2,esk12_2(X1,X2)))). % 0.14/0.39 cnf(i_0_10, plain, (r3(X1,X2,esk3_2(X1,X2)))). % 0.14/0.39 cnf(i_0_33, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))). % 0.14/0.39 cnf(i_0_18, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))). % 0.14/0.39 cnf(i_0_14, plain, (r4(X1,X2,esk4_2(X1,X2)))). % 0.14/0.39 cnf(i_0_20, plain, (r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)))). % 0.14/0.39 cnf(i_0_25, plain, (r4(X1,esk11_2(X1,X2),esk9_2(X1,X2)))). % 0.14/0.39 cnf(i_0_23, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))). % 0.14/0.39 cnf(i_0_3, plain, (X1=esk1_0|~r1(X1))). % 0.14/0.39 cnf(i_0_35, plain, (esk20_1(X1)=X1|esk18_1(X1)=X1)). % 0.14/0.39 cnf(i_0_40, negated_conjecture, (~r2(X1,X2)|~r1(X1))). % 0.14/0.39 cnf(i_0_39, plain, (~r2(X1,X2)|~r1(X2))). % 0.14/0.39 cnf(i_0_37, plain, (esk20_1(X1)=X1|r1(esk18_1(X1)))). % 0.14/0.39 cnf(i_0_7, plain, (X1=esk2_1(X2)|~r2(X2,X1))). % 0.14/0.39 cnf(i_0_36, plain, (esk18_1(X1)=X1|r2(esk19_1(X1),esk20_1(X1)))). % 0.14/0.39 cnf(i_0_38, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))). % 0.14/0.39 cnf(i_0_27, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))). % 0.14/0.39 cnf(i_0_11, plain, (X1=esk3_2(X2,X3)|~r3(X2,X3,X1))). % 0.14/0.39 cnf(i_0_15, plain, (X1=esk4_2(X2,X3)|~r4(X2,X3,X1))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 3 steps % 0.14/0.39 cnf(i_0_40, negated_conjecture, (~r2(esk14_1(X2),esk2_1(esk14_1(X2)))|~r1(esk14_1(X2))), inference(start_rule)). % 0.14/0.39 cnf(i_0_47, plain, (~r2(esk14_1(X2),esk2_1(esk14_1(X2)))), inference(closure_rule, [i_0_6])). % 0.14/0.39 cnf(i_0_48, plain, (~r1(esk14_1(X2))), inference(closure_rule, [i_0_30])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # NOT attempting initial tableau saturation % 0.14/0.39 # 1 start rule tableaux created. % 0.14/0.39 # 11 extension rule candidate clauses % 0.14/0.39 # 17 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Proof search is over... % 0.14/0.39 # Freeing feature tree %------------------------------------------------------------------------------