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