%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET575+3 : TPTP v8.1.0. Released v2.2.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 : n026.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 01:00:54 EDT 2022 % Result : Theorem 0.18s 0.35s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SET575+3 : TPTP v8.1.0. Released v2.2.0. % 0.03/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.32 % Computer : n026.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.32 % CPULimit : 300 % 0.12/0.32 % WCLimit : 600 % 0.12/0.32 % DateTime : Sun Jul 10 14:53:11 EDT 2022 % 0.12/0.32 % CPUTime : % 0.18/0.35 # No SInE strategy applied % 0.18/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.18/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.35 # % 0.18/0.35 # Presaturation interreduction done % 0.18/0.35 # Number of axioms: 6 Number of unprocessed: 6 % 0.18/0.35 # Tableaux proof search. % 0.18/0.35 # APR header successfully linked. % 0.18/0.35 # Hello from C++ % 0.18/0.35 # The folding up rule is enabled... % 0.18/0.35 # Local unification is enabled... % 0.18/0.35 # Any saturation attempts will use folding labels... % 0.18/0.35 # 6 beginning clauses after preprocessing and clausification % 0.18/0.35 # Creating start rules for all 2 conjectures. % 0.18/0.35 # There are 2 start rule candidates: % 0.18/0.35 # Found 1 unit axioms. % 0.18/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.35 # 2 start rule tableaux created. % 0.18/0.35 # 5 extension rule candidate clauses % 0.18/0.35 # 1 unit axiom clauses % 0.18/0.35 % 0.18/0.35 # Requested 8, 32 cores available to the main process. % 0.18/0.35 # There are not enough tableaux to fork, creating more from the initial 2 % 0.18/0.35 # There were 2 total branch saturation attempts. % 0.18/0.35 # There were 0 of these attempts blocked. % 0.18/0.35 # There were 0 deferred branch saturation attempts. % 0.18/0.35 # There were 1 free duplicated saturations. % 0.18/0.35 # There were 2 total successful branch saturations. % 0.18/0.35 # There were 0 successful branch saturations in interreduction. % 0.18/0.35 # There were 0 successful branch saturations on the branch. % 0.18/0.35 # There were 1 successful branch saturations after the branch. % 0.18/0.35 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.35 # Begin clausification derivation % 0.18/0.35 % 0.18/0.35 # End clausification derivation % 0.18/0.35 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.35 cnf(i_0_6, negated_conjecture, (intersect(esk2_0,esk3_0))). % 0.18/0.35 cnf(i_0_5, negated_conjecture, (~member(X1,esk2_0)|~member(X1,esk3_0))). % 0.18/0.35 cnf(i_0_4, plain, (intersect(X1,X2)|~intersect(X2,X1))). % 0.18/0.35 cnf(i_0_1, plain, (intersect(X1,X2)|~member(X3,X2)|~member(X3,X1))). % 0.18/0.35 cnf(i_0_2, plain, (member(esk1_2(X1,X2),X2)|~intersect(X1,X2))). % 0.18/0.35 cnf(i_0_3, plain, (member(esk1_2(X1,X2),X1)|~intersect(X1,X2))). % 0.18/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.35 # Begin printing tableau % 0.18/0.35 # Found 5 steps % 0.18/0.35 cnf(i_0_6, negated_conjecture, (intersect(esk2_0,esk3_0)), inference(start_rule)). % 0.18/0.35 cnf(i_0_9, plain, (intersect(esk2_0,esk3_0)), inference(extension_rule, [i_0_3])). % 0.18/0.35 cnf(i_0_39, plain, (member(esk1_2(esk2_0,esk3_0),esk2_0)), inference(extension_rule, [i_0_1])). % 0.18/0.35 cnf(i_0_46, plain, (~member(esk1_2(esk2_0,esk3_0),esk2_0)), inference(closure_rule, [i_0_39])). % 0.18/0.35 cnf(i_0_45, plain, (intersect(esk2_0,esk2_0)), inference(etableau_closure_rule, [i_0_45, ...])). % 0.18/0.35 # End printing tableau % 0.18/0.35 # SZS output end % 0.18/0.35 # Branches closed with saturation will be marked with an "s" % 0.18/0.35 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.18/0.35 # We now have 8 tableaux to operate on % 0.18/0.35 # Found closed tableau during pool population. % 0.18/0.35 # Proof search is over... % 0.18/0.35 # Freeing feature tree %------------------------------------------------------------------------------