%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET592+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 : n005.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:05 EDT 2022 % Result : Theorem 0.18s 0.36s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SET592+3 : TPTP v8.1.0. Released v2.2.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n005.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun Jul 10 09:50:37 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 22 Number of unprocessed: 20 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 20 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 4 conjectures. % 0.18/0.36 # There are 4 start rule candidates: % 0.18/0.36 # Found 7 unit axioms. % 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.36 # 4 start rule tableaux created. % 0.18/0.36 # 13 extension rule candidate clauses % 0.18/0.36 # 7 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 4 % 0.18/0.36 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 11 tableaux to operate on % 0.18/0.36 # There were 1 total branch saturation attempts. % 0.18/0.36 # There were 0 of these attempts blocked. % 0.18/0.36 # There were 0 deferred branch saturation attempts. % 0.18/0.36 # There were 0 free duplicated saturations. % 0.18/0.36 # There were 1 total successful branch saturations. % 0.18/0.36 # There were 0 successful branch saturations in interreduction. % 0.18/0.36 # There were 0 successful branch saturations on the branch. % 0.18/0.36 # There were 1 successful branch saturations after the branch. % 0.18/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.36 # Begin clausification derivation % 0.18/0.36 % 0.18/0.36 # End clausification derivation % 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.36 cnf(i_0_22, negated_conjecture, (intersection(esk5_0,esk6_0)=empty_set)). % 0.18/0.36 cnf(i_0_24, negated_conjecture, (subset(esk4_0,esk5_0))). % 0.18/0.36 cnf(i_0_23, negated_conjecture, (subset(esk4_0,esk6_0))). % 0.18/0.36 cnf(i_0_14, plain, (subset(X1,X1))). % 0.18/0.36 cnf(i_0_13, plain, (intersection(X1,X2)=intersection(X2,X1))). % 0.18/0.36 cnf(i_0_21, negated_conjecture, (esk4_0!=empty_set)). % 0.18/0.36 cnf(i_0_3, plain, (~member(X1,empty_set))). % 0.18/0.36 cnf(i_0_1, plain, (X1=empty_set|~subset(X1,empty_set))). % 0.18/0.36 cnf(i_0_16, plain, (~empty(X1)|~member(X2,X1))). % 0.18/0.36 cnf(i_0_10, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.18/0.36 cnf(i_0_5, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). % 0.18/0.36 cnf(i_0_6, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). % 0.18/0.36 cnf(i_0_7, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))). % 0.18/0.36 cnf(i_0_2, plain, (subset(X1,intersection(X2,X3))|~subset(X1,X3)|~subset(X1,X2))). % 0.18/0.36 cnf(i_0_15, plain, (empty(X1)|member(esk2_1(X1),X1))). % 0.18/0.36 cnf(i_0_8, plain, (member(esk1_2(X1,X2),X1)|subset(X1,X2))). % 0.18/0.36 cnf(i_0_9, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))). % 0.18/0.36 cnf(i_0_18, plain, (X1=X2|~member(esk3_2(X1,X2),X2)|~member(esk3_2(X1,X2),X1))). % 0.18/0.36 cnf(i_0_4, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). % 0.18/0.36 cnf(i_0_17, plain, (X1=X2|member(esk3_2(X1,X2),X1)|member(esk3_2(X1,X2),X2))). % 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.36 # Begin printing tableau % 0.18/0.36 # Found 8 steps % 0.18/0.36 cnf(i_0_23, negated_conjecture, (subset(esk4_0,esk6_0)), inference(start_rule)). % 0.18/0.36 cnf(i_0_28, plain, (subset(esk4_0,esk6_0)), inference(extension_rule, [i_0_9])). % 0.18/0.36 cnf(i_0_83, plain, (member(esk1_2(esk4_0,empty_set),esk6_0)), inference(extension_rule, [i_0_16])). % 0.18/0.36 cnf(i_0_97, plain, (~empty(esk6_0)), inference(extension_rule, [i_0_15])). % 0.18/0.36 cnf(i_0_84, plain, (~member(esk1_2(esk4_0,empty_set),esk4_0)), inference(extension_rule, [i_0_8])). % 0.18/0.36 cnf(i_0_496, plain, (subset(esk4_0,empty_set)), inference(extension_rule, [i_0_1])). % 0.18/0.36 cnf(i_0_497, plain, (esk4_0=empty_set), inference(closure_rule, [i_0_21])). % 0.18/0.36 cnf(i_0_114, plain, (member(esk2_1(esk6_0),esk6_0)), inference(etableau_closure_rule, [i_0_114, ...])). % 0.18/0.36 # End printing tableau % 0.18/0.36 # SZS output end % 0.18/0.36 # Branches closed with saturation will be marked with an "s" % 0.18/0.37 # Child (8373) has found a proof. % 0.18/0.37 % 0.18/0.37 # Proof search is over... % 0.18/0.37 # Freeing feature tree %------------------------------------------------------------------------------