%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU135+1 : TPTP v8.1.0. Released v3.3.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 : n025.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 09:24:03 EDT 2022 % Result : Theorem 0.86s 1.06s % Output : CNFRefutation 0.86s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : SEU135+1 : TPTP v8.1.0. Released v3.3.0. % 0.07/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 : n025.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 : Mon Jun 20 11:27:29 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___300_C01_F1_SE_CS_SP_S0Y % 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.36 # % 0.12/0.36 # Number of axioms: 34 Number of unprocessed: 34 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.77/0.96 # The folding up rule is enabled... % 0.77/0.96 # Local unification is enabled... % 0.77/0.96 # Any saturation attempts will use folding labels... % 0.77/0.96 # 34 beginning clauses after preprocessing and clausification % 0.77/0.96 # Creating start rules for all 1 conjectures. % 0.77/0.96 # There are 1 start rule candidates: % 0.77/0.96 # Found 10 unit axioms. % 0.77/0.96 # 1 start rule tableaux created. % 0.77/0.96 # 24 extension rule candidate clauses % 0.77/0.96 # 10 unit axiom clauses % 0.77/0.96 % 0.77/0.96 # Requested 8, 32 cores available to the main process. % 0.77/0.96 # There are not enough tableaux to fork, creating more from the initial 1 % 0.82/1.01 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.82/1.01 # We now have 12 tableaux to operate on % 0.86/1.06 # There were 13 total branch saturation attempts. % 0.86/1.06 # There were 7 of these attempts blocked. % 0.86/1.06 # There were 0 deferred branch saturation attempts. % 0.86/1.06 # There were 0 free duplicated saturations. % 0.86/1.06 # There were 5 total successful branch saturations. % 0.86/1.06 # There were 1 successful branch saturations in interreduction. % 0.86/1.06 # There were 0 successful branch saturations on the branch. % 0.86/1.06 # There were 4 successful branch saturations after the branch. % 0.86/1.06 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.86/1.06 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.86/1.06 # Begin clausification derivation % 0.86/1.06 % 0.86/1.06 # End clausification derivation % 0.86/1.06 # Begin listing active clauses obtained from FOF to CNF conversion % 0.86/1.06 cnf(i_0_24, plain, (empty(empty_set))). % 0.86/1.06 cnf(i_0_28, plain, (empty(esk4_0))). % 0.86/1.06 cnf(i_0_29, plain, (~empty(esk5_0))). % 0.86/1.06 cnf(i_0_35, plain, (X1=empty_set|~empty(X1))). % 0.86/1.06 cnf(i_0_34, plain, (set_difference(empty_set,X1)=empty_set)). % 0.86/1.06 cnf(i_0_31, plain, (set_union2(X1,empty_set)=X1)). % 0.86/1.06 cnf(i_0_33, plain, (set_difference(X1,empty_set)=X1)). % 0.86/1.06 cnf(i_0_30, plain, (subset(X1,X1))). % 0.86/1.06 cnf(i_0_27, plain, (set_union2(X1,X1)=X1)). % 0.86/1.06 cnf(i_0_37, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.86/1.06 cnf(i_0_4, plain, (subset(X1,X2)|X1!=X2)). % 0.86/1.06 cnf(i_0_5, plain, (subset(X1,X2)|X1!=X2)). % 0.86/1.06 cnf(i_0_2, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.86/1.06 cnf(i_0_36, plain, (~empty(X2)|~in(X1,X2))). % 0.86/1.06 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 0.86/1.06 cnf(i_0_3, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.86/1.06 cnf(i_0_26, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.86/1.06 cnf(i_0_25, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.86/1.06 cnf(i_0_13, plain, (subset(X1,X2)|in(esk2_2(X1,X2),X1))). % 0.86/1.06 cnf(i_0_14, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))). % 0.86/1.06 cnf(i_0_9, plain, (in(X1,X3)|X3!=set_union2(X4,X2)|~in(X1,X2))). % 0.86/1.06 cnf(i_0_10, plain, (in(X1,X3)|X3!=set_union2(X2,X4)|~in(X1,X2))). % 0.86/1.06 cnf(i_0_20, plain, (in(X1,X2)|X3!=set_difference(X2,X4)|~in(X1,X3))). % 0.86/1.06 cnf(i_0_32, negated_conjecture, (set_union2(esk6_0,set_difference(esk7_0,esk6_0))!=set_union2(esk6_0,esk7_0))). % 0.86/1.06 cnf(i_0_19, plain, (X3!=set_difference(X4,X2)|~in(X1,X3)|~in(X1,X2))). % 0.86/1.06 cnf(i_0_18, plain, (in(X1,X4)|in(X1,X3)|X4!=set_difference(X2,X3)|~in(X1,X2))). % 0.86/1.06 cnf(i_0_11, plain, (in(X1,X4)|in(X1,X3)|X2!=set_union2(X3,X4)|~in(X1,X2))). % 0.86/1.06 cnf(i_0_12, plain, (subset(X1,X2)|~in(esk2_2(X1,X2),X2))). % 0.86/1.06 cnf(i_0_16, plain, (X3=set_difference(X1,X2)|in(esk3_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X1))). % 0.86/1.06 cnf(i_0_15, plain, (X3=set_difference(X1,X2)|in(esk3_3(X1,X2,X3),X3)|~in(esk3_3(X1,X2,X3),X2))). % 0.86/1.06 cnf(i_0_6, plain, (X3=set_union2(X1,X2)|in(esk1_3(X1,X2,X3),X3)|in(esk1_3(X1,X2,X3),X2)|in(esk1_3(X1,X2,X3),X1))). % 0.86/1.06 cnf(i_0_7, plain, (X3=set_union2(X1,X2)|~in(esk1_3(X1,X2,X3),X3)|~in(esk1_3(X1,X2,X3),X2))). % 0.86/1.06 cnf(i_0_8, plain, (X3=set_union2(X1,X2)|~in(esk1_3(X1,X2,X3),X3)|~in(esk1_3(X1,X2,X3),X1))). % 0.86/1.06 cnf(i_0_17, plain, (X3=set_difference(X1,X2)|in(esk3_3(X1,X2,X3),X2)|~in(esk3_3(X1,X2,X3),X3)|~in(esk3_3(X1,X2,X3),X1))). % 0.86/1.06 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.86/1.06 # Begin printing tableau % 0.86/1.06 # Found 14 steps % 0.86/1.06 cnf(i_0_32, negated_conjecture, (set_union2(esk6_0,set_difference(esk7_0,esk6_0))!=set_union2(esk6_0,esk7_0)), inference(start_rule)). % 0.86/1.06 cnf(i_0_38, plain, (set_union2(esk6_0,set_difference(esk7_0,esk6_0))!=set_union2(esk6_0,esk7_0)), inference(extension_rule, [i_0_8])). % 0.86/1.06 cnf(i_0_100, plain, (~in(esk1_3(esk6_0,esk7_0,set_union2(esk6_0,set_difference(esk7_0,esk6_0))),set_union2(esk6_0,set_difference(esk7_0,esk6_0)))), inference(extension_rule, [i_0_14])). % 0.86/1.06 cnf(i_0_129, plain, (~in(esk1_3(esk6_0,esk7_0,set_union2(esk6_0,set_difference(esk7_0,esk6_0))),set_union2(esk6_0,set_difference(esk7_0,esk6_0)))), inference(extension_rule, [i_0_6])). % 0.86/1.06 cnf(i_0_130, plain, (~subset(set_union2(esk6_0,set_difference(esk7_0,esk6_0)),set_union2(esk6_0,set_difference(esk7_0,esk6_0)))), inference(closure_rule, [i_0_30])). % 0.86/1.06 cnf(i_0_104808, plain, (set_union2(esk6_0,set_difference(esk7_0,esk6_0))=set_union2(esk6_0,esk7_0)), inference(closure_rule, [i_0_32])). % 0.86/1.06 cnf(i_0_101, plain, (~in(esk1_3(esk6_0,esk7_0,set_union2(esk6_0,set_difference(esk7_0,esk6_0))),esk6_0)), inference(extension_rule, [i_0_14])). % 0.86/1.06 cnf(i_0_104810, plain, (in(esk1_3(esk6_0,esk7_0,set_union2(esk6_0,set_difference(esk7_0,esk6_0))),esk7_0)), inference(etableau_closure_rule, [i_0_104810, ...])). % 0.86/1.06 cnf(i_0_104811, plain, (in(esk1_3(esk6_0,esk7_0,set_union2(esk6_0,set_difference(esk7_0,esk6_0))),esk6_0)), inference(etableau_closure_rule, [i_0_104811, ...])). % 0.86/1.06 cnf(i_0_104835, plain, (~in(esk1_3(esk6_0,esk7_0,set_union2(esk6_0,set_difference(esk7_0,esk6_0))),esk6_0)), inference(extension_rule, [i_0_6])). % 0.86/1.06 cnf(i_0_105168, plain, (set_union2(esk6_0,set_difference(esk7_0,esk6_0))=set_union2(esk6_0,esk7_0)), inference(closure_rule, [i_0_32])). % 0.86/1.06 cnf(i_0_104836, plain, (~subset(esk6_0,esk6_0)), inference(etableau_closure_rule, [i_0_104836, ...])). % 0.86/1.06 cnf(i_0_105169, plain, (in(esk1_3(esk6_0,esk7_0,set_union2(esk6_0,set_difference(esk7_0,esk6_0))),set_union2(esk6_0,set_difference(esk7_0,esk6_0)))), inference(etableau_closure_rule, [i_0_105169, ...])). % 0.86/1.06 cnf(i_0_105170, plain, (in(esk1_3(esk6_0,esk7_0,set_union2(esk6_0,set_difference(esk7_0,esk6_0))),esk7_0)), inference(etableau_closure_rule, [i_0_105170, ...])). % 0.86/1.06 # End printing tableau % 0.86/1.06 # SZS output end % 0.86/1.06 # Branches closed with saturation will be marked with an "s" % 0.86/1.07 # Child (17462) has found a proof. % 0.86/1.07 % 0.86/1.07 # Proof search is over... % 0.86/1.07 # Freeing feature tree %------------------------------------------------------------------------------