%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET937+1 : TPTP v8.1.0. Released v3.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 : n016.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:03:59 EDT 2022 % Result : Theorem 0.72s 0.88s % Output : CNFRefutation 0.72s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET937+1 : TPTP v8.1.0. Released v3.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.35 % Computer : n016.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Sat Jul 9 21:59:25 EDT 2022 % 0.13/0.35 % CPUTime : % 0.21/0.38 # No SInE strategy applied % 0.21/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S038I % 0.21/0.38 # and selection function SelectUnlessUniqMaxPos. % 0.21/0.38 # % 0.21/0.38 # Presaturation interreduction done % 0.21/0.38 # Number of axioms: 43 Number of unprocessed: 43 % 0.21/0.38 # Tableaux proof search. % 0.21/0.38 # APR header successfully linked. % 0.21/0.38 # Hello from C++ % 0.69/0.84 # The folding up rule is enabled... % 0.69/0.84 # Local unification is enabled... % 0.69/0.84 # Any saturation attempts will use folding labels... % 0.69/0.84 # 43 beginning clauses after preprocessing and clausification % 0.69/0.84 # Creating start rules for all 1 conjectures. % 0.69/0.84 # There are 1 start rule candidates: % 0.69/0.84 # Found 12 unit axioms. % 0.69/0.84 # 1 start rule tableaux created. % 0.69/0.84 # 31 extension rule candidate clauses % 0.69/0.84 # 12 unit axiom clauses % 0.69/0.84 % 0.69/0.84 # Requested 8, 32 cores available to the main process. % 0.69/0.84 # There are not enough tableaux to fork, creating more from the initial 1 % 0.72/0.88 # There were 2 total branch saturation attempts. % 0.72/0.88 # There were 0 of these attempts blocked. % 0.72/0.88 # There were 0 deferred branch saturation attempts. % 0.72/0.88 # There were 1 free duplicated saturations. % 0.72/0.88 # There were 2 total successful branch saturations. % 0.72/0.88 # There were 0 successful branch saturations in interreduction. % 0.72/0.88 # There were 0 successful branch saturations on the branch. % 0.72/0.88 # There were 1 successful branch saturations after the branch. % 0.72/0.88 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.72/0.88 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.72/0.88 # Begin clausification derivation % 0.72/0.88 % 0.72/0.88 # End clausification derivation % 0.72/0.88 # Begin listing active clauses obtained from FOF to CNF conversion % 0.72/0.88 cnf(i_0_29, plain, (empty(empty_set))). % 0.72/0.88 cnf(i_0_34, plain, (empty(esk6_0))). % 0.72/0.88 cnf(i_0_36, plain, (subset(X1,X1))). % 0.72/0.88 cnf(i_0_32, plain, (set_union2(X1,X1)=X1)). % 0.72/0.88 cnf(i_0_33, plain, (set_intersection2(X1,X1)=X1)). % 0.72/0.88 cnf(i_0_40, plain, (subset(set_difference(X1,X2),X1))). % 0.72/0.88 cnf(i_0_42, plain, (disjoint(set_difference(X1,X2),X2))). % 0.72/0.88 cnf(i_0_6, plain, (in(X1,singleton(X1)))). % 0.72/0.88 cnf(i_0_2, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.72/0.88 cnf(i_0_3, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.72/0.88 cnf(i_0_43, negated_conjecture, (~subset(powerset(set_difference(esk8_0,esk9_0)),set_union2(singleton(empty_set),set_difference(powerset(esk8_0),powerset(esk9_0)))))). % 0.72/0.88 cnf(i_0_35, plain, (~empty(esk7_0))). % 0.72/0.88 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.72/0.88 cnf(i_0_31, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.72/0.88 cnf(i_0_30, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.72/0.88 cnf(i_0_39, plain, (set_intersection2(X1,X2)=X1|~subset(X1,X2))). % 0.72/0.88 cnf(i_0_28, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))). % 0.72/0.88 cnf(i_0_7, plain, (X1=X2|~in(X1,singleton(X2)))). % 0.72/0.88 cnf(i_0_27, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)). % 0.72/0.88 cnf(i_0_37, plain, (disjoint(X1,X2)|~disjoint(X2,X1))). % 0.72/0.88 cnf(i_0_20, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))). % 0.72/0.88 cnf(i_0_25, plain, (~in(X1,set_difference(X2,X3))|~in(X1,X3))). % 0.72/0.88 cnf(i_0_18, plain, (subset(X1,X2)|~in(esk4_2(X1,X2),X2))). % 0.72/0.88 cnf(i_0_10, plain, (in(X1,powerset(X2))|~subset(X1,X2))). % 0.72/0.88 cnf(i_0_11, plain, (subset(X1,X2)|~in(X1,powerset(X2)))). % 0.72/0.88 cnf(i_0_41, plain, (disjoint(X1,X2)|~disjoint(X3,X2)|~subset(X1,X3))). % 0.72/0.88 cnf(i_0_38, plain, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))). % 0.72/0.88 cnf(i_0_19, plain, (subset(X1,X2)|in(esk4_2(X1,X2),X1))). % 0.72/0.88 cnf(i_0_15, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))). % 0.72/0.88 cnf(i_0_5, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))). % 0.72/0.88 cnf(i_0_9, plain, (X1=powerset(X2)|~subset(esk2_2(X2,X1),X2)|~in(esk2_2(X2,X1),X1))). % 0.72/0.88 cnf(i_0_16, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))). % 0.72/0.88 cnf(i_0_26, plain, (in(X1,X2)|~in(X1,set_difference(X2,X3)))). % 0.72/0.88 cnf(i_0_24, plain, (in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2))). % 0.72/0.88 cnf(i_0_17, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))). % 0.72/0.88 cnf(i_0_4, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))). % 0.72/0.88 cnf(i_0_8, plain, (X1=powerset(X2)|subset(esk2_2(X2,X1),X2)|in(esk2_2(X2,X1),X1))). % 0.72/0.88 cnf(i_0_13, plain, (X1=set_union2(X2,X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X3))). % 0.72/0.88 cnf(i_0_14, plain, (X1=set_union2(X2,X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X2))). % 0.72/0.88 cnf(i_0_22, plain, (X1=set_difference(X2,X3)|in(esk5_3(X2,X3,X1),X2)|in(esk5_3(X2,X3,X1),X1))). % 0.72/0.88 cnf(i_0_21, plain, (X1=set_difference(X2,X3)|in(esk5_3(X2,X3,X1),X1)|~in(esk5_3(X2,X3,X1),X3))). % 0.72/0.88 cnf(i_0_23, plain, (X1=set_difference(X2,X3)|in(esk5_3(X2,X3,X1),X3)|~in(esk5_3(X2,X3,X1),X1)|~in(esk5_3(X2,X3,X1),X2))). % 0.72/0.88 cnf(i_0_12, plain, (X1=set_union2(X2,X3)|in(esk3_3(X2,X3,X1),X2)|in(esk3_3(X2,X3,X1),X3)|in(esk3_3(X2,X3,X1),X1))). % 0.72/0.88 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.72/0.88 # Begin printing tableau % 0.72/0.88 # Found 4 steps % 0.72/0.88 cnf(i_0_43, negated_conjecture, (~subset(powerset(set_difference(esk8_0,esk9_0)),set_union2(singleton(empty_set),set_difference(powerset(esk8_0),powerset(esk9_0))))), inference(start_rule)). % 0.72/0.88 cnf(i_0_55, plain, (~subset(powerset(set_difference(esk8_0,esk9_0)),set_union2(singleton(empty_set),set_difference(powerset(esk8_0),powerset(esk9_0))))), inference(extension_rule, [i_0_19])). % 0.72/0.88 cnf(i_0_90, plain, (in(esk4_2(powerset(set_difference(esk8_0,esk9_0)),set_union2(singleton(empty_set),set_difference(powerset(esk8_0),powerset(esk9_0)))),powerset(set_difference(esk8_0,esk9_0)))), inference(extension_rule, [i_0_1])). % 0.72/0.88 cnf(i_0_135, plain, (~in(powerset(set_difference(esk8_0,esk9_0)),esk4_2(powerset(set_difference(esk8_0,esk9_0)),set_union2(singleton(empty_set),set_difference(powerset(esk8_0),powerset(esk9_0)))))), inference(etableau_closure_rule, [i_0_135, ...])). % 0.72/0.88 # End printing tableau % 0.72/0.88 # SZS output end % 0.72/0.88 # Branches closed with saturation will be marked with an "s" % 0.72/0.88 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 0.72/0.88 # We now have 5 tableaux to operate on % 0.72/0.88 # Found closed tableau during pool population. % 0.72/0.88 # Proof search is over... % 0.72/0.88 # Freeing feature tree %------------------------------------------------------------------------------