%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU141+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 : n018.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:07 EDT 2022 % Result : Theorem 0.12s 0.39s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SEU141+1 : TPTP v8.1.0. Released v3.3.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.34 % Computer : n018.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 Jun 19 04:08:04 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI % 0.12/0.37 # and selection function SelectCQArNTNpEqFirst. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 38 Number of unprocessed: 36 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 36 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 2 conjectures. % 0.12/0.37 # There are 2 start rule candidates: % 0.12/0.37 # Found 9 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 2 start rule tableaux created. % 0.12/0.37 # 27 extension rule candidate clauses % 0.12/0.37 # 9 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 8 tableaux to operate on % 0.12/0.39 # There were 3 total branch saturation attempts. % 0.12/0.39 # There were 0 of these attempts blocked. % 0.12/0.39 # There were 0 deferred branch saturation attempts. % 0.12/0.39 # There were 0 free duplicated saturations. % 0.12/0.39 # There were 3 total successful branch saturations. % 0.12/0.39 # There were 0 successful branch saturations in interreduction. % 0.12/0.39 # There were 0 successful branch saturations on the branch. % 0.12/0.39 # There were 3 successful branch saturations after the branch. % 0.12/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # Begin clausification derivation % 0.12/0.39 % 0.12/0.39 # End clausification derivation % 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.39 cnf(i_0_26, plain, (empty(empty_set))). % 0.12/0.39 cnf(i_0_28, plain, (empty(esk4_0))). % 0.12/0.39 cnf(i_0_34, plain, (set_difference(empty_set,X1)=empty_set)). % 0.12/0.39 cnf(i_0_30, plain, (subset(X1,X1))). % 0.12/0.39 cnf(i_0_33, plain, (set_difference(X1,empty_set)=X1)). % 0.12/0.39 cnf(i_0_32, plain, (set_intersection2(X1,empty_set)=empty_set)). % 0.12/0.39 cnf(i_0_27, plain, (set_intersection2(X1,X1)=X1)). % 0.12/0.39 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.12/0.39 cnf(i_0_29, plain, (~empty(esk5_0))). % 0.12/0.39 cnf(i_0_40, negated_conjecture, (set_difference(esk7_0,esk8_0)!=esk7_0|~disjoint(esk7_0,esk8_0))). % 0.12/0.39 cnf(i_0_39, negated_conjecture, (set_difference(esk7_0,esk8_0)=esk7_0|disjoint(esk7_0,esk8_0))). % 0.12/0.39 cnf(i_0_37, plain, (X1=empty_set|~empty(X1))). % 0.12/0.39 cnf(i_0_38, plain, (~empty(X1)|~in(X2,X1))). % 0.12/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.12/0.39 cnf(i_0_35, plain, (~disjoint(X1,X2)|~in(X3,set_intersection2(X1,X2)))). % 0.12/0.39 cnf(i_0_31, plain, (disjoint(X1,X2)|~disjoint(X2,X1))). % 0.12/0.39 cnf(i_0_21, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)). % 0.12/0.39 cnf(i_0_41, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.12/0.39 cnf(i_0_22, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))). % 0.12/0.39 cnf(i_0_8, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))). % 0.12/0.39 cnf(i_0_19, plain, (~in(X1,set_difference(X2,X3))|~in(X1,X3))). % 0.12/0.39 cnf(i_0_6, plain, (subset(X1,X2)|~in(esk1_2(X1,X2),X2))). % 0.12/0.39 cnf(i_0_3, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.12/0.39 cnf(i_0_7, plain, (subset(X1,X2)|in(esk1_2(X1,X2),X1))). % 0.12/0.39 cnf(i_0_13, plain, (in(X1,X2)|~in(X1,set_intersection2(X3,X2)))). % 0.12/0.39 cnf(i_0_14, plain, (in(X1,X2)|~in(X1,set_intersection2(X2,X3)))). % 0.12/0.39 cnf(i_0_20, plain, (in(X1,X2)|~in(X1,set_difference(X2,X3)))). % 0.12/0.39 cnf(i_0_36, plain, (disjoint(X1,X2)|in(esk6_2(X1,X2),set_intersection2(X1,X2)))). % 0.12/0.39 cnf(i_0_12, plain, (in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2))). % 0.12/0.39 cnf(i_0_18, plain, (in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2))). % 0.12/0.39 cnf(i_0_9, plain, (X1=set_intersection2(X2,X3)|in(esk2_3(X2,X3,X1),X3)|in(esk2_3(X2,X3,X1),X1))). % 0.12/0.39 cnf(i_0_16, plain, (X1=set_difference(X2,X3)|in(esk3_3(X2,X3,X1),X2)|in(esk3_3(X2,X3,X1),X1))). % 0.12/0.39 cnf(i_0_15, plain, (X1=set_difference(X2,X3)|in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X3))). % 0.12/0.39 cnf(i_0_11, plain, (X1=set_intersection2(X2,X3)|~in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,X1),X3)|~in(esk2_3(X2,X3,X1),X2))). % 0.12/0.39 cnf(i_0_10, plain, (X1=set_intersection2(X2,X3)|in(esk2_3(X2,X3,X1),X2)|in(esk2_3(X2,X3,X1),X1))). % 0.12/0.39 cnf(i_0_17, plain, (X1=set_difference(X2,X3)|in(esk3_3(X2,X3,X1),X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X2))). % 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.39 # Begin printing tableau % 0.12/0.39 # Found 6 steps % 0.12/0.39 cnf(i_0_40, negated_conjecture, (set_difference(esk7_0,esk8_0)!=esk7_0|~disjoint(esk7_0,esk8_0)), inference(start_rule)). % 0.12/0.39 cnf(i_0_52, plain, (set_difference(esk7_0,esk8_0)!=esk7_0), inference(extension_rule, [i_0_3])). % 0.12/0.39 cnf(i_0_213, plain, (~subset(esk7_0,set_difference(esk7_0,esk8_0))), inference(extension_rule, [i_0_6])). % 0.12/0.39 cnf(i_0_53, plain, (~disjoint(esk7_0,esk8_0)), inference(etableau_closure_rule, [i_0_53, ...])). % 0.12/0.39 cnf(i_0_214, plain, (~subset(set_difference(esk7_0,esk8_0),esk7_0)), inference(etableau_closure_rule, [i_0_214, ...])). % 0.12/0.39 cnf(i_0_278, plain, (~in(esk1_2(esk7_0,set_difference(esk7_0,esk8_0)),set_difference(esk7_0,esk8_0))), inference(etableau_closure_rule, [i_0_278, ...])). % 0.12/0.39 # End printing tableau % 0.12/0.39 # SZS output end % 0.12/0.39 # Branches closed with saturation will be marked with an "s" % 0.12/0.39 # Child (3635) has found a proof. % 0.12/0.39 % 0.12/0.39 # Proof search is over... % 0.12/0.39 # Freeing feature tree %------------------------------------------------------------------------------