%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU019+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 : n032.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:23:29 EDT 2022 % Result : Theorem 0.13s 0.49s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.08 % Problem : SEU019+1 : TPTP v8.1.0. Released v3.2.0. % 0.07/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.08/0.28 % Computer : n032.cluster.edu % 0.08/0.28 % Model : x86_64 x86_64 % 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.28 % Memory : 8042.1875MB % 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.28 % CPULimit : 300 % 0.08/0.28 % WCLimit : 600 % 0.08/0.28 % DateTime : Sun Jun 19 14:16:48 EDT 2022 % 0.08/0.28 % CPUTime : % 0.08/0.30 # No SInE strategy applied % 0.08/0.30 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.08/0.30 # and selection function SelectComplexExceptUniqMaxHorn. % 0.08/0.30 # % 0.08/0.30 # Presaturation interreduction done % 0.08/0.30 # Number of axioms: 51 Number of unprocessed: 47 % 0.08/0.30 # Tableaux proof search. % 0.08/0.30 # APR header successfully linked. % 0.08/0.30 # Hello from C++ % 0.13/0.48 # The folding up rule is enabled... % 0.13/0.48 # Local unification is enabled... % 0.13/0.48 # Any saturation attempts will use folding labels... % 0.13/0.48 # 47 beginning clauses after preprocessing and clausification % 0.13/0.48 # Creating start rules for all 1 conjectures. % 0.13/0.48 # There are 1 start rule candidates: % 0.13/0.48 # Found 22 unit axioms. % 0.13/0.48 # 1 start rule tableaux created. % 0.13/0.48 # 25 extension rule candidate clauses % 0.13/0.48 # 22 unit axiom clauses % 0.13/0.48 % 0.13/0.48 # Requested 8, 32 cores available to the main process. % 0.13/0.48 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.49 # There were 1 total branch saturation attempts. % 0.13/0.49 # There were 0 of these attempts blocked. % 0.13/0.49 # There were 0 deferred branch saturation attempts. % 0.13/0.49 # There were 0 free duplicated saturations. % 0.13/0.49 # There were 1 total successful branch saturations. % 0.13/0.49 # There were 0 successful branch saturations in interreduction. % 0.13/0.49 # There were 0 successful branch saturations on the branch. % 0.13/0.49 # There were 1 successful branch saturations after the branch. % 0.13/0.49 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.49 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.49 # Begin clausification derivation % 0.13/0.49 % 0.13/0.49 # End clausification derivation % 0.13/0.49 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.49 cnf(i_0_13, plain, (empty(empty_set))). % 0.13/0.49 cnf(i_0_26, plain, (empty(esk5_0))). % 0.13/0.49 cnf(i_0_29, plain, (empty(esk7_0))). % 0.13/0.49 cnf(i_0_23, plain, (function(esk4_0))). % 0.13/0.49 cnf(i_0_12, plain, (relation(empty_set))). % 0.13/0.49 cnf(i_0_24, plain, (relation(esk4_0))). % 0.13/0.49 cnf(i_0_25, plain, (relation(esk5_0))). % 0.13/0.49 cnf(i_0_30, plain, (relation(esk8_0))). % 0.13/0.49 cnf(i_0_36, plain, (relation(esk11_0))). % 0.13/0.49 cnf(i_0_11, plain, (relation_empty_yielding(empty_set))). % 0.13/0.49 cnf(i_0_35, plain, (relation_empty_yielding(esk11_0))). % 0.13/0.49 cnf(i_0_16, plain, (function(identity_relation(X1)))). % 0.13/0.49 cnf(i_0_9, plain, (relation(identity_relation(X1)))). % 0.13/0.49 cnf(i_0_32, plain, (empty(esk9_1(X1)))). % 0.13/0.49 cnf(i_0_37, plain, (subset(X1,X1))). % 0.13/0.49 cnf(i_0_10, plain, (element(esk3_1(X1),X1))). % 0.13/0.49 cnf(i_0_33, plain, (element(esk9_1(X1),powerset(X1)))). % 0.13/0.49 cnf(i_0_43, plain, (relation_dom(identity_relation(X1))=X1)). % 0.13/0.49 cnf(i_0_47, negated_conjecture, (~one_to_one(identity_relation(esk13_0)))). % 0.13/0.49 cnf(i_0_31, plain, (~empty(esk8_0))). % 0.13/0.49 cnf(i_0_34, plain, (~empty(esk10_0))). % 0.13/0.49 cnf(i_0_14, plain, (~empty(powerset(X1)))). % 0.13/0.49 cnf(i_0_50, plain, (~empty(X1)|~in(X2,X1))). % 0.13/0.49 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 0.13/0.49 cnf(i_0_3, plain, (relation(X1)|~empty(X1))). % 0.13/0.49 cnf(i_0_49, plain, (X1=empty_set|~empty(X1))). % 0.13/0.49 cnf(i_0_51, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.13/0.49 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.13/0.49 cnf(i_0_27, plain, (empty(X1)|~empty(esk6_1(X1)))). % 0.13/0.49 cnf(i_0_38, plain, (element(X1,X2)|~in(X1,X2))). % 0.13/0.49 cnf(i_0_20, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))). % 0.13/0.49 cnf(i_0_22, plain, (empty(relation_dom(X1))|~empty(X1))). % 0.13/0.49 cnf(i_0_21, plain, (relation(relation_dom(X1))|~empty(X1))). % 0.13/0.49 cnf(i_0_45, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.13/0.49 cnf(i_0_4, plain, (one_to_one(X1)|esk2_1(X1)!=esk1_1(X1)|~relation(X1)|~function(X1))). % 0.13/0.49 cnf(i_0_48, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))). % 0.13/0.49 cnf(i_0_44, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.13/0.49 cnf(i_0_39, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 0.13/0.49 cnf(i_0_46, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 0.13/0.49 cnf(i_0_28, plain, (element(esk6_1(X1),powerset(X1))|empty(X1))). % 0.13/0.49 cnf(i_0_7, plain, (one_to_one(X1)|in(esk1_1(X1),relation_dom(X1))|~relation(X1)|~function(X1))). % 0.13/0.49 cnf(i_0_6, plain, (one_to_one(X1)|in(esk2_1(X1),relation_dom(X1))|~relation(X1)|~function(X1))). % 0.13/0.49 cnf(i_0_42, plain, (apply(identity_relation(X1),X2)=X2|~in(X2,X1))). % 0.13/0.49 cnf(i_0_5, plain, (apply(X1,esk2_1(X1))=apply(X1,esk1_1(X1))|one_to_one(X1)|~relation(X1)|~function(X1))). % 0.13/0.49 cnf(i_0_40, plain, (identity_relation(relation_dom(X1))=X1|apply(X1,esk12_2(relation_dom(X1),X1))!=esk12_2(relation_dom(X1),X1)|~relation(X1)|~function(X1))). % 0.13/0.49 cnf(i_0_8, plain, (X1=X2|apply(X3,X1)!=apply(X3,X2)|~one_to_one(X3)|~relation(X3)|~function(X3)|~in(X2,relation_dom(X3))|~in(X1,relation_dom(X3)))). % 0.13/0.49 cnf(i_0_41, plain, (identity_relation(relation_dom(X1))=X1|in(esk12_2(relation_dom(X1),X1),relation_dom(X1))|~relation(X1)|~function(X1))). % 0.13/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.49 # Begin printing tableau % 0.13/0.49 # Found 6 steps % 0.13/0.49 cnf(i_0_47, negated_conjecture, (~one_to_one(identity_relation(esk13_0))), inference(start_rule)). % 0.13/0.49 cnf(i_0_56, plain, (~one_to_one(identity_relation(esk13_0))), inference(extension_rule, [i_0_6])). % 0.13/0.49 cnf(i_0_106, plain, (~relation(identity_relation(esk13_0))), inference(closure_rule, [i_0_9])). % 0.13/0.49 cnf(i_0_107, plain, (~function(identity_relation(esk13_0))), inference(closure_rule, [i_0_16])). % 0.13/0.49 cnf(i_0_105, plain, (in(esk2_1(identity_relation(esk13_0)),relation_dom(identity_relation(esk13_0)))), inference(extension_rule, [i_0_50])). % 0.13/0.49 cnf(i_0_201, plain, (~empty(relation_dom(identity_relation(esk13_0)))), inference(etableau_closure_rule, [i_0_201, ...])). % 0.13/0.49 # End printing tableau % 0.13/0.49 # SZS output end % 0.13/0.49 # Branches closed with saturation will be marked with an "s" % 0.13/0.49 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 0.13/0.49 # We now have 3 tableaux to operate on % 0.13/0.49 # Found closed tableau during pool population. % 0.13/0.49 # Proof search is over... % 0.13/0.49 # Freeing feature tree %------------------------------------------------------------------------------