%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET636+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 : n022.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:37 EDT 2022 % Result : Theorem 0.19s 0.43s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SET636+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.13/0.34 % Computer : n022.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 : Mon Jul 11 04:14:25 EDT 2022 % 0.13/0.35 % CPUTime : % 0.19/0.38 # No SInE strategy applied % 0.19/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.38 # % 0.19/0.38 # Presaturation interreduction done % 0.19/0.38 # Number of axioms: 24 Number of unprocessed: 22 % 0.19/0.38 # Tableaux proof search. % 0.19/0.38 # APR header successfully linked. % 0.19/0.38 # Hello from C++ % 0.19/0.42 # The folding up rule is enabled... % 0.19/0.42 # Local unification is enabled... % 0.19/0.42 # Any saturation attempts will use folding labels... % 0.19/0.42 # 22 beginning clauses after preprocessing and clausification % 0.19/0.42 # Creating start rules for all 2 conjectures. % 0.19/0.42 # There are 2 start rule candidates: % 0.19/0.42 # Found 3 unit axioms. % 0.19/0.42 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.42 # 2 start rule tableaux created. % 0.19/0.42 # 19 extension rule candidate clauses % 0.19/0.42 # 3 unit axiom clauses % 0.19/0.42 % 0.19/0.42 # Requested 8, 32 cores available to the main process. % 0.19/0.42 # There are not enough tableaux to fork, creating more from the initial 2 % 0.19/0.43 # There were 2 total branch saturation attempts. % 0.19/0.43 # There were 0 of these attempts blocked. % 0.19/0.43 # There were 0 deferred branch saturation attempts. % 0.19/0.43 # There were 0 free duplicated saturations. % 0.19/0.43 # There were 2 total successful branch saturations. % 0.19/0.43 # There were 0 successful branch saturations in interreduction. % 0.19/0.43 # There were 0 successful branch saturations on the branch. % 0.19/0.43 # There were 2 successful branch saturations after the branch. % 0.19/0.43 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.43 # Begin clausification derivation % 0.19/0.43 % 0.19/0.43 # End clausification derivation % 0.19/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.43 cnf(i_0_18, plain, (subset(X1,X1))). % 0.19/0.43 cnf(i_0_13, plain, (intersection(X1,X2)=intersection(X2,X1))). % 0.19/0.43 cnf(i_0_7, plain, (~member(X1,empty_set))). % 0.19/0.43 cnf(i_0_26, negated_conjecture, (intersection(esk5_0,esk6_0)!=empty_set|~disjoint(esk5_0,esk6_0))). % 0.19/0.43 cnf(i_0_25, negated_conjecture, (intersection(esk5_0,esk6_0)=empty_set|disjoint(esk5_0,esk6_0))). % 0.19/0.43 cnf(i_0_9, plain, (~disjoint(X1,X2)|~intersect(X1,X2))). % 0.19/0.43 cnf(i_0_20, plain, (~empty(X1)|~member(X2,X1))). % 0.19/0.43 cnf(i_0_14, plain, (intersect(X1,X2)|~intersect(X2,X1))). % 0.19/0.43 cnf(i_0_10, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.19/0.43 cnf(i_0_2, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). % 0.19/0.43 cnf(i_0_8, plain, (disjoint(X1,X2)|intersect(X1,X2))). % 0.19/0.43 cnf(i_0_3, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). % 0.19/0.43 cnf(i_0_15, plain, (subset(X1,X2)|~member(esk2_2(X1,X2),X2))). % 0.19/0.43 cnf(i_0_19, plain, (empty(X1)|member(esk3_1(X1),X1))). % 0.19/0.43 cnf(i_0_16, plain, (subset(X1,X2)|member(esk2_2(X1,X2),X1))). % 0.19/0.43 cnf(i_0_5, plain, (member(esk1_2(X1,X2),X2)|~intersect(X1,X2))). % 0.19/0.43 cnf(i_0_17, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))). % 0.19/0.43 cnf(i_0_4, plain, (intersect(X1,X2)|~member(X3,X2)|~member(X3,X1))). % 0.19/0.43 cnf(i_0_6, plain, (member(esk1_2(X1,X2),X1)|~intersect(X1,X2))). % 0.19/0.43 cnf(i_0_22, plain, (X1=X2|~member(esk4_2(X1,X2),X2)|~member(esk4_2(X1,X2),X1))). % 0.19/0.43 cnf(i_0_1, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). % 0.19/0.43 cnf(i_0_21, plain, (X1=X2|member(esk4_2(X1,X2),X1)|member(esk4_2(X1,X2),X2))). % 0.19/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.43 # Begin printing tableau % 0.19/0.43 # Found 5 steps % 0.19/0.43 cnf(i_0_26, negated_conjecture, (intersection(esk5_0,esk6_0)!=empty_set|~disjoint(esk5_0,esk6_0)), inference(start_rule)). % 0.19/0.43 cnf(i_0_32, plain, (~disjoint(esk5_0,esk6_0)), inference(extension_rule, [i_0_8])). % 0.19/0.43 cnf(i_0_177, plain, (intersect(esk5_0,esk6_0)), inference(extension_rule, [i_0_14])). % 0.19/0.43 cnf(i_0_31, plain, (intersection(esk5_0,esk6_0)!=empty_set), inference(etableau_closure_rule, [i_0_31, ...])). % 0.19/0.43 cnf(i_0_213, plain, (intersect(esk6_0,esk5_0)), inference(etableau_closure_rule, [i_0_213, ...])). % 0.19/0.43 # End printing tableau % 0.19/0.43 # SZS output end % 0.19/0.43 # Branches closed with saturation will be marked with an "s" % 0.19/0.43 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 0.19/0.43 # We now have 5 tableaux to operate on % 0.19/0.43 # Found closed tableau during pool population. % 0.19/0.43 # Proof search is over... % 0.19/0.43 # Freeing feature tree %------------------------------------------------------------------------------