%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET613+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 : n007.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:21 EDT 2022 % Result : Theorem 110.12s 15.30s % Output : CNFRefutation 110.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET613+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.12/0.34 % Computer : n007.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sun Jul 10 03:26:31 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 23 Number of unprocessed: 21 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 1.32/1.52 # The folding up rule is enabled... % 1.32/1.52 # Local unification is enabled... % 1.32/1.52 # Any saturation attempts will use folding labels... % 1.32/1.52 # 21 beginning clauses after preprocessing and clausification % 1.32/1.52 # Creating start rules for all 1 conjectures. % 1.32/1.52 # There are 1 start rule candidates: % 1.32/1.52 # Found 4 unit axioms. % 1.32/1.52 # 1 start rule tableaux created. % 1.32/1.52 # 17 extension rule candidate clauses % 1.32/1.52 # 4 unit axiom clauses % 1.32/1.52 % 1.32/1.52 # Requested 8, 32 cores available to the main process. % 1.32/1.52 # There are not enough tableaux to fork, creating more from the initial 1 % 1.45/1.64 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 1.45/1.64 # We now have 13 tableaux to operate on % 110.12/15.30 # There were 29 total branch saturation attempts. % 110.12/15.30 # There were 11 of these attempts blocked. % 110.12/15.30 # There were 0 deferred branch saturation attempts. % 110.12/15.30 # There were 0 free duplicated saturations. % 110.12/15.30 # There were 3 total successful branch saturations. % 110.12/15.30 # There were 0 successful branch saturations in interreduction. % 110.12/15.30 # There were 0 successful branch saturations on the branch. % 110.12/15.30 # There were 3 successful branch saturations after the branch. % 110.12/15.30 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 110.12/15.30 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 110.12/15.30 # Begin clausification derivation % 110.12/15.30 % 110.12/15.30 # End clausification derivation % 110.12/15.30 # Begin listing active clauses obtained from FOF to CNF conversion % 110.12/15.30 cnf(i_0_24, plain, (subset(X1,X1))). % 110.12/15.30 cnf(i_0_15, plain, (union(X1,X2)=union(X2,X1))). % 110.12/15.30 cnf(i_0_16, plain, (intersection(X1,X2)=intersection(X2,X1))). % 110.12/15.30 cnf(i_0_25, negated_conjecture, (difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0))!=union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0)))). % 110.12/15.30 cnf(i_0_3, plain, (member(X1,union(X2,X3))|~member(X1,X3))). % 110.12/15.30 cnf(i_0_10, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))). % 110.12/15.30 cnf(i_0_12, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 110.12/15.30 cnf(i_0_7, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). % 110.12/15.30 cnf(i_0_8, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). % 110.12/15.30 cnf(i_0_4, plain, (member(X1,union(X2,X3))|~member(X1,X2))). % 110.12/15.30 cnf(i_0_11, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))). % 110.12/15.30 cnf(i_0_21, plain, (subset(X1,X2)|~member(esk3_2(X1,X2),X2))). % 110.12/15.30 cnf(i_0_6, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). % 110.12/15.30 cnf(i_0_5, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3)))). % 110.12/15.30 cnf(i_0_22, plain, (subset(X1,X2)|member(esk3_2(X1,X2),X1))). % 110.12/15.30 cnf(i_0_9, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))). % 110.12/15.30 cnf(i_0_23, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))). % 110.12/15.30 cnf(i_0_2, plain, (X1=X2|~member(esk1_2(X1,X2),X2)|~member(esk1_2(X1,X2),X1))). % 110.12/15.30 cnf(i_0_18, plain, (X1=X2|~member(esk2_2(X1,X2),X2)|~member(esk2_2(X1,X2),X1))). % 110.12/15.30 cnf(i_0_1, plain, (X1=X2|member(esk1_2(X1,X2),X1)|member(esk1_2(X1,X2),X2))). % 110.12/15.30 cnf(i_0_17, plain, (X1=X2|member(esk2_2(X1,X2),X1)|member(esk2_2(X1,X2),X2))). % 110.12/15.30 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 110.12/15.30 # Begin printing tableau % 110.12/15.30 # Found 15 steps % 110.12/15.30 cnf(i_0_25, negated_conjecture, (difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0))!=union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0))), inference(start_rule)). % 110.12/15.30 cnf(i_0_28, plain, (difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0))!=union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0))), inference(extension_rule, [i_0_17])). % 110.12/15.30 cnf(i_0_70, plain, (member(esk2_2(difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)),union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0))),difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)))), inference(extension_rule, [i_0_3])). % 110.12/15.30 cnf(i_0_72, plain, (member(esk2_2(difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)),union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0))),union(X11,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0))))), inference(extension_rule, [i_0_6])). % 110.12/15.30 cnf(i_0_1180565, plain, (~member(esk2_2(difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)),union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0))),union(X11,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0))))), inference(closure_rule, [i_0_72])). % 110.12/15.30 cnf(i_0_71, plain, (member(esk2_2(difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)),union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0))),union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0)))), inference(extension_rule, [i_0_4])). % 110.12/15.30 cnf(i_0_1180585, plain, (member(esk2_2(difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)),union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0))),union(union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0)),X16))), inference(extension_rule, [i_0_3])). % 110.12/15.30 cnf(i_0_1180563, plain, (member(esk2_2(difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)),union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0))),intersection(union(X11,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0))),union(X11,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)))))), inference(extension_rule, [i_0_4])). % 110.12/15.30 cnf(i_0_1336618, plain, (member(esk2_2(difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)),union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0))),union(intersection(union(X11,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0))),union(X11,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)))),X10))), inference(extension_rule, [i_0_3])). % 110.12/15.30 cnf(i_0_1336648, plain, (member(esk2_2(difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)),union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0))),union(X12,union(intersection(union(X11,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0))),union(X11,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)))),X10)))), inference(extension_rule, [i_0_10])). % 110.12/15.30 cnf(i_0_1336678, plain, (~member(esk2_2(difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)),union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0))),difference(X13,union(X12,union(intersection(union(X11,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0))),union(X11,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)))),X10))))), inference(extension_rule, [i_0_7])). % 110.12/15.30 cnf(i_0_1333734, plain, (member(esk2_2(difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)),union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0))),union(X17,union(union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0)),X16)))), inference(extension_rule, [i_0_23])). % 110.12/15.30 cnf(i_0_1487885, plain, (member(esk2_2(difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)),union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0))),difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)))), inference(closure_rule, [i_0_94])). % 110.12/15.30 cnf(i_0_1487858, plain, (~member(esk2_2(difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)),union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0))),intersection(X8,difference(X13,union(X12,union(intersection(union(X11,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0))),union(X11,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)))),X10)))))), inference(etableau_closure_rule, [i_0_1487858, ...])). % 110.12/15.30 cnf(i_0_1487886, plain, (~subset(union(X17,union(union(difference(esk4_0,esk5_0),difference(esk5_0,esk4_0)),X16)),difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)))), inference(etableau_closure_rule, [i_0_1487886, ...])). % 110.12/15.30 # End printing tableau % 110.12/15.30 # SZS output end % 110.12/15.30 # Branches closed with saturation will be marked with an "s" % 110.12/15.33 # Child (718) has found a proof. % 110.12/15.33 % 110.12/15.33 # Proof search is over... % 110.12/15.33 # Freeing feature tree %------------------------------------------------------------------------------