%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU267+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:25:22 EDT 2022 % Result : Theorem 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SEU267+1 : TPTP v8.1.0. Released v3.3.0. % 0.06/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 : n018.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 Jun 19 10:06:04 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___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.12/0.36 # and selection function SelectUnlessUniqMax. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 18 Number of unprocessed: 18 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 18 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 5 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 13 extension rule candidate clauses % 0.12/0.36 # 5 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 8 tableaux to operate on % 0.12/0.37 # There were 2 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 2 total successful branch saturations. % 0.12/0.37 # There were 1 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 1 successful branch saturations after the branch. % 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_6, plain, (empty(empty_set))). % 0.12/0.37 cnf(i_0_8, plain, (empty(esk2_0))). % 0.12/0.37 cnf(i_0_1, plain, (element(esk1_1(X1),X1))). % 0.12/0.37 cnf(i_0_9, plain, (~empty(esk3_0))). % 0.12/0.37 cnf(i_0_16, plain, (~empty(ordered_pair(X1,X2)))). % 0.12/0.37 cnf(i_0_17, negated_conjecture, (pair_first(ordered_pair(esk4_0,esk5_0))!=esk4_0|pair_second(ordered_pair(esk4_0,esk5_0))!=esk5_0)). % 0.12/0.37 cnf(i_0_10, plain, (X1=empty_set|~empty(X1))). % 0.12/0.37 cnf(i_0_11, plain, (~in(X1,X2)|~empty(X2))). % 0.12/0.37 cnf(i_0_4, plain, (~in(X1,X2)|~in(X2,X1))). % 0.12/0.37 cnf(i_0_7, plain, (element(X1,X2)|~in(X1,X2))). % 0.12/0.37 cnf(i_0_12, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.12/0.37 cnf(i_0_3, plain, (in(X1,X2)|empty(X2)|~element(X1,X2))). % 0.12/0.37 cnf(i_0_18, plain, (X1=pair_first(ordered_pair(X2,X3))|esk6_2(ordered_pair(X2,X3),X1)!=X1)). % 0.12/0.37 cnf(i_0_21, plain, (X1=pair_second(ordered_pair(X2,X3))|esk9_2(ordered_pair(X2,X3),X1)!=X1)). % 0.12/0.37 cnf(i_0_23, plain, (pair_second(ordered_pair(X1,X2))=X3|ordered_pair(X1,X2)!=ordered_pair(X4,X3))). % 0.12/0.37 cnf(i_0_20, plain, (pair_first(ordered_pair(X1,X2))=X3|ordered_pair(X1,X2)!=ordered_pair(X3,X4))). % 0.12/0.37 cnf(i_0_19, plain, (ordered_pair(esk6_2(ordered_pair(X1,X2),X3),esk7_2(ordered_pair(X1,X2),X3))=ordered_pair(X1,X2)|X3=pair_first(ordered_pair(X1,X2)))). % 0.12/0.37 cnf(i_0_22, plain, (ordered_pair(esk8_2(ordered_pair(X1,X2),X3),esk9_2(ordered_pair(X1,X2),X3))=ordered_pair(X1,X2)|X3=pair_second(ordered_pair(X1,X2)))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 5 steps % 0.12/0.37 cnf(i_0_17, negated_conjecture, (pair_first(ordered_pair(esk4_0,esk5_0))!=esk4_0|pair_second(ordered_pair(esk4_0,esk5_0))!=esk5_0), inference(start_rule)). % 0.12/0.37 cnf(i_0_33, plain, (pair_second(ordered_pair(esk4_0,esk5_0))!=esk5_0), inference(extension_rule, [i_0_22])). % 0.12/0.37 cnf(i_0_86, plain, (ordered_pair(esk8_2(ordered_pair(esk4_0,esk5_0),esk5_0),esk9_2(ordered_pair(esk4_0,esk5_0),esk5_0))=ordered_pair(esk4_0,esk5_0)), inference(extension_rule, [i_0_23])). % 0.12/0.37 cnf(i_0_32, plain, (pair_first(ordered_pair(esk4_0,esk5_0))!=esk4_0), inference(etableau_closure_rule, [i_0_32, ...])). % 0.12/0.37 cnf(i_0_108, plain, (pair_second(ordered_pair(esk8_2(ordered_pair(esk4_0,esk5_0),esk5_0),esk9_2(ordered_pair(esk4_0,esk5_0),esk5_0)))=esk5_0), inference(etableau_closure_rule, [i_0_108, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Child (16836) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------