%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET637+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 : n010.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:38 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.07/0.12 % Problem : SET637+3 : TPTP v8.1.0. Released v2.2.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n010.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sun Jul 10 23:33:00 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.13/0.37 # and selection function SelectUnlessUniqMax. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 17 Number of unprocessed: 17 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 17 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 2 conjectures. % 0.13/0.37 # There are 2 start rule candidates: % 0.13/0.37 # Found 3 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 2 start rule tableaux created. % 0.13/0.37 # 14 extension rule candidate clauses % 0.13/0.37 # 3 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.13/0.39 # There were 5 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 2 free duplicated saturations. % 0.13/0.39 # There were 5 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 3 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_14, plain, (intersection(X1,X2)=intersection(X2,X1))). % 0.13/0.39 cnf(i_0_7, plain, (~member(X1,empty_set))). % 0.13/0.39 cnf(i_0_13, plain, (~not_equal(X1,X1))). % 0.13/0.39 cnf(i_0_19, negated_conjecture, (~not_equal(intersection(esk4_0,esk5_0),empty_set)|~intersect(esk4_0,esk5_0))). % 0.13/0.39 cnf(i_0_18, negated_conjecture, (not_equal(intersection(esk4_0,esk5_0),empty_set)|intersect(esk4_0,esk5_0))). % 0.13/0.39 cnf(i_0_12, plain, (X1=X2|not_equal(X1,X2))). % 0.13/0.39 cnf(i_0_17, plain, (~empty(X1)|~member(X2,X1))). % 0.13/0.39 cnf(i_0_15, plain, (intersect(X1,X2)|~intersect(X2,X1))). % 0.13/0.39 cnf(i_0_2, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). % 0.13/0.39 cnf(i_0_3, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). % 0.13/0.39 cnf(i_0_16, plain, (empty(X1)|member(esk3_1(X1),X1))). % 0.13/0.39 cnf(i_0_5, plain, (member(esk1_2(X1,X2),X2)|~intersect(X1,X2))). % 0.13/0.39 cnf(i_0_6, plain, (member(esk1_2(X1,X2),X1)|~intersect(X1,X2))). % 0.13/0.39 cnf(i_0_4, plain, (intersect(X1,X2)|~member(X3,X2)|~member(X3,X1))). % 0.13/0.39 cnf(i_0_1, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). % 0.13/0.39 cnf(i_0_8, plain, (X1=X2|member(esk2_2(X1,X2),X1)|member(esk2_2(X1,X2),X2))). % 0.13/0.39 cnf(i_0_9, plain, (X1=X2|~member(esk2_2(X1,X2),X2)|~member(esk2_2(X1,X2),X1))). % 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 6 steps % 0.13/0.39 cnf(i_0_19, negated_conjecture, (~not_equal(intersection(esk4_0,esk5_0),empty_set)|~intersect(esk4_0,esk5_0)), inference(start_rule)). % 0.13/0.39 cnf(i_0_24, plain, (~intersect(esk4_0,esk5_0)), inference(extension_rule, [i_0_4])). % 0.13/0.39 cnf(i_0_138, plain, (~member(esk3_1(esk5_0),esk5_0)), inference(extension_rule, [i_0_16])). % 0.13/0.39 cnf(i_0_23, plain, (~not_equal(intersection(esk4_0,esk5_0),empty_set)), inference(etableau_closure_rule, [i_0_23, ...])). % 0.13/0.39 cnf(i_0_139, plain, (~member(esk3_1(esk5_0),esk4_0)), inference(etableau_closure_rule, [i_0_139, ...])). % 0.13/0.39 cnf(i_0_202, plain, (empty(esk5_0)), inference(etableau_closure_rule, [i_0_202, ...])). % 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 8 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 8 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 %------------------------------------------------------------------------------