%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU303+1 : TPTP v8.1.0. Released v3.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 : n006.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 09:25:40 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.14/0.14 % Problem : SEU303+1 : TPTP v8.1.0. Released v3.3.0. % 0.14/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 : n006.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 : Sat Jun 18 19:22:10 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_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN % 0.14/0.39 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 9 Number of unprocessed: 8 % 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 # 8 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 4 conjectures. % 0.14/0.39 # There are 4 start rule candidates: % 0.14/0.39 # Found 6 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 4 start rule tableaux created. % 0.14/0.39 # 2 extension rule candidate clauses % 0.14/0.39 # 6 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 4 % 0.14/0.39 # There were 1 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 1 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 1 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_12, negated_conjecture, (relation(esk2_0))). % 0.14/0.39 cnf(i_0_11, negated_conjecture, (function(esk2_0))). % 0.14/0.39 cnf(i_0_10, negated_conjecture, (finite(relation_dom(esk2_0)))). % 0.14/0.39 cnf(i_0_6, plain, (relation(esk1_0))). % 0.14/0.39 cnf(i_0_5, plain, (function(esk1_0))). % 0.14/0.39 cnf(i_0_9, negated_conjecture, (~finite(relation_rng(esk2_0)))). % 0.14/0.39 cnf(i_0_7, plain, (relation_image(X1,relation_dom(X1))=relation_rng(X1)|~relation(X1))). % 0.14/0.39 cnf(i_0_4, plain, (finite(relation_image(X1,X2))|~finite(X2)|~function(X1)|~relation(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 8 steps % 0.14/0.39 cnf(i_0_12, negated_conjecture, (relation(esk2_0)), inference(start_rule)). % 0.14/0.39 cnf(i_0_16, plain, (relation(esk2_0)), inference(extension_rule, [i_0_4])). % 0.14/0.39 cnf(i_0_38, plain, (~finite(relation_dom(esk2_0))), inference(closure_rule, [i_0_10])). % 0.14/0.39 cnf(i_0_39, plain, (~function(esk2_0)), inference(closure_rule, [i_0_11])). % 0.14/0.39 cnf(i_0_37, plain, (finite(relation_image(esk2_0,relation_dom(esk2_0)))), inference(extension_rule, [i_0_4])). % 0.14/0.39 cnf(i_0_45, plain, (~function(esk1_0)), inference(closure_rule, [i_0_5])). % 0.14/0.39 cnf(i_0_46, plain, (~relation(esk1_0)), inference(closure_rule, [i_0_6])). % 0.14/0.39 cnf(i_0_43, plain, (finite(relation_image(esk1_0,relation_image(esk2_0,relation_dom(esk2_0))))), inference(etableau_closure_rule, [i_0_43, ...])). % 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 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 4 tableaux to operate on % 0.14/0.39 # Found closed tableau during pool population. % 0.14/0.39 # Proof search is over... % 0.14/0.39 # Freeing feature tree %------------------------------------------------------------------------------