%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET045+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 : n027.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 : Tue Jul 19 00:56:53 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.13/0.13 % Problem : SET045+1 : TPTP v8.1.0. Released v2.0.0. % 0.13/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.36 % Computer : n027.cluster.edu % 0.13/0.36 % Model : x86_64 x86_64 % 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.36 % Memory : 8042.1875MB % 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.36 % CPULimit : 300 % 0.13/0.36 % WCLimit : 600 % 0.13/0.36 % DateTime : Sun Jul 10 04:14:47 EDT 2022 % 0.13/0.36 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.39 # % 0.13/0.39 # Presaturation interreduction done % 0.13/0.39 # Number of axioms: 4 Number of unprocessed: 4 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # Hello from C++ % 0.13/0.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 4 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 1 conjectures. % 0.13/0.39 # There are 1 start rule candidates: % 0.13/0.39 # Found 1 unit axioms. % 0.13/0.39 # 1 start rule tableaux created. % 0.13/0.39 # 3 extension rule candidate clauses % 0.13/0.39 # 1 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.39 # Closed tableau found in foldup close cycle with 1 folds and 2 closures done. % 0.13/0.39 # There were 0 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 0 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 0 successful branch saturations after the branch. % 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox/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, (element(X1,esk2_0))). % 0.13/0.39 cnf(i_0_3, plain, (element(X1,X2)|~element(X1,esk1_1(X2)))). % 0.13/0.39 cnf(i_0_2, plain, (~element(X1,esk1_1(X2))|~element(X1,X1))). % 0.13/0.39 cnf(i_0_1, plain, (element(X1,esk1_1(X2))|element(X1,X1)|~element(X1,X2))). % 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 5 steps % 0.13/0.39 cnf(i_0_4, negated_conjecture, (element(esk1_1(esk2_0),esk2_0)), inference(start_rule)). % 0.13/0.39 cnf(i_0_5, plain, (element(esk1_1(esk2_0),esk2_0)), inference(extension_rule, [i_0_1])). % 0.13/0.39 cnf(i_0_10, plain, (element(esk1_1(esk2_0),esk1_1(esk2_0))), inference(extension_rule, [i_0_2])). % 0.13/0.39 cnf(i_0_15, plain, (~element(esk1_1(esk2_0),esk1_1(esk2_0))), inference(closure_rule, [i_0_10])). % 0.13/0.39 cnf(i_0_11, plain, (element(esk1_1(esk2_0),esk1_1(esk2_0))), inference(closure_rule, [i_0_10])). % 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.13/0.39 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 2 tableaux to operate on % 0.13/0.39 # Found closed tableau during pool population. % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------