%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU251+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 : n004.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:13 EDT 2022 % Result : Theorem 0.19s 0.58s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU251+1 : TPTP v8.1.0. Released v3.3.0. % 0.07/0.13 % 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 : n004.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 : Mon Jun 20 04:54:38 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___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.12/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.37 # % 0.12/0.37 # Number of axioms: 46 Number of unprocessed: 46 % 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.38 # The folding up rule is enabled... % 0.12/0.38 # Local unification is enabled... % 0.12/0.38 # Any saturation attempts will use folding labels... % 0.12/0.38 # 46 beginning clauses after preprocessing and clausification % 0.12/0.38 # Creating start rules for all 2 conjectures. % 0.12/0.38 # There are 2 start rule candidates: % 0.12/0.38 # Found 20 unit axioms. % 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.38 # 2 start rule tableaux created. % 0.12/0.38 # 26 extension rule candidate clauses % 0.12/0.38 # 20 unit axiom clauses % 0.12/0.38 % 0.12/0.38 # Requested 8, 32 cores available to the main process. % 0.12/0.38 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.38 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.12/0.38 # We now have 15 tableaux to operate on % 0.19/0.58 # There were 2 total branch saturation attempts. % 0.19/0.58 # There were 0 of these attempts blocked. % 0.19/0.58 # There were 0 deferred branch saturation attempts. % 0.19/0.58 # There were 0 free duplicated saturations. % 0.19/0.58 # There were 2 total successful branch saturations. % 0.19/0.58 # There were 0 successful branch saturations in interreduction. % 0.19/0.58 # There were 0 successful branch saturations on the branch. % 0.19/0.58 # There were 2 successful branch saturations after the branch. % 0.19/0.58 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.58 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.58 # Begin clausification derivation % 0.19/0.58 % 0.19/0.58 # End clausification derivation % 0.19/0.58 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.58 cnf(i_0_30, plain, (empty(empty_set))). % 0.19/0.58 cnf(i_0_35, plain, (empty(esk5_0))). % 0.19/0.58 cnf(i_0_37, plain, (empty(esk6_0))). % 0.19/0.58 cnf(i_0_33, plain, (function(esk4_0))). % 0.19/0.58 cnf(i_0_36, plain, (function(esk6_0))). % 0.19/0.58 cnf(i_0_41, plain, (function(esk8_0))). % 0.19/0.58 cnf(i_0_34, plain, (relation(esk4_0))). % 0.19/0.58 cnf(i_0_38, plain, (relation(esk6_0))). % 0.19/0.58 cnf(i_0_42, plain, (relation(esk8_0))). % 0.19/0.58 cnf(i_0_49, negated_conjecture, (relation(esk11_0))). % 0.19/0.58 cnf(i_0_40, plain, (one_to_one(esk8_0))). % 0.19/0.58 cnf(i_0_39, plain, (~empty(esk7_0))). % 0.19/0.58 cnf(i_0_56, plain, (X1=empty_set|~empty(X1))). % 0.19/0.58 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 0.19/0.58 cnf(i_0_50, plain, (set_intersection2(X1,empty_set)=empty_set)). % 0.19/0.58 cnf(i_0_43, plain, (subset(X1,X1))). % 0.19/0.58 cnf(i_0_32, plain, (set_intersection2(X1,X1)=X1)). % 0.19/0.58 cnf(i_0_58, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.19/0.58 cnf(i_0_29, plain, (element(esk3_1(X1),X1))). % 0.19/0.58 cnf(i_0_3, plain, (one_to_one(X1)|~empty(X1)|~function(X1)|~relation(X1))). % 0.19/0.58 cnf(i_0_6, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.19/0.58 cnf(i_0_7, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.19/0.58 cnf(i_0_57, plain, (~empty(X2)|~in(X1,X2))). % 0.19/0.58 cnf(i_0_47, plain, (element(X1,X2)|~in(X1,X2))). % 0.19/0.58 cnf(i_0_24, plain, (relation(relation_restriction(X1,X2))|~relation(X1))). % 0.19/0.58 cnf(i_0_51, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 0.19/0.58 cnf(i_0_52, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.19/0.58 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 0.19/0.58 cnf(i_0_53, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.19/0.58 cnf(i_0_15, plain, (subset(X1,X2)|in(esk2_2(X1,X2),X1))). % 0.19/0.58 cnf(i_0_13, plain, (X1!=X2|X3!=fiber(X4,X2)|~relation(X4)|~in(X1,X3))). % 0.19/0.58 cnf(i_0_16, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))). % 0.19/0.58 cnf(i_0_18, plain, (set_intersection2(X1,cartesian_product2(X2,X2))=relation_restriction(X1,X2)|~relation(X1))). % 0.19/0.58 cnf(i_0_55, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.19/0.58 cnf(i_0_54, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.19/0.58 cnf(i_0_14, plain, (subset(X1,X2)|~in(esk2_2(X1,X2),X2))). % 0.19/0.58 cnf(i_0_46, plain, (in(X1,X2)|~relation(X2)|~in(X1,relation_restriction(X2,X3)))). % 0.19/0.58 cnf(i_0_45, plain, (in(X1,cartesian_product2(X2,X2))|~relation(X3)|~in(X1,relation_restriction(X3,X2)))). % 0.19/0.58 cnf(i_0_44, plain, (in(X1,relation_restriction(X2,X3))|~relation(X2)|~in(X1,X2)|~in(X1,cartesian_product2(X3,X3)))). % 0.19/0.58 cnf(i_0_31, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))). % 0.19/0.58 cnf(i_0_48, negated_conjecture, (~subset(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0)))). % 0.19/0.58 cnf(i_0_12, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)|X4!=fiber(X3,X2)|~relation(X3)|~in(X1,X4))). % 0.19/0.58 cnf(i_0_11, plain, (X1=X2|in(X1,X4)|X4!=fiber(X3,X2)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))). % 0.19/0.58 cnf(i_0_9, plain, (X3=fiber(X1,X2)|in(esk1_3(X1,X2,X3),X3)|esk1_3(X1,X2,X3)!=X2|~relation(X1))). % 0.19/0.58 cnf(i_0_8, plain, (X3=fiber(X1,X2)|in(esk1_3(X1,X2,X3),X3)|in(unordered_pair(unordered_pair(esk1_3(X1,X2,X3),X2),singleton(esk1_3(X1,X2,X3))),X1)|~relation(X1))). % 0.19/0.58 cnf(i_0_10, plain, (X3=fiber(X1,X2)|esk1_3(X1,X2,X3)=X2|~relation(X1)|~in(esk1_3(X1,X2,X3),X3)|~in(unordered_pair(unordered_pair(esk1_3(X1,X2,X3),X2),singleton(esk1_3(X1,X2,X3))),X1))). % 0.19/0.58 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.58 # Begin printing tableau % 0.19/0.58 # Found 5 steps % 0.19/0.58 cnf(i_0_48, negated_conjecture, (~subset(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0))), inference(start_rule)). % 0.19/0.58 cnf(i_0_59, plain, (~subset(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0))), inference(extension_rule, [i_0_15])). % 0.19/0.58 cnf(i_0_88, plain, (in(esk2_2(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0)),fiber(relation_restriction(esk11_0,esk9_0),esk10_0))), inference(extension_rule, [i_0_55])). % 0.19/0.58 cnf(i_0_9192, plain, (~empty(empty_set)), inference(closure_rule, [i_0_30])). % 0.19/0.58 cnf(i_0_9194, plain, (~element(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),powerset(empty_set))), inference(etableau_closure_rule, [i_0_9194, ...])). % 0.19/0.58 # End printing tableau % 0.19/0.58 # SZS output end % 0.19/0.58 # Branches closed with saturation will be marked with an "s" % 0.19/0.58 # Child (26012) has found a proof. % 0.19/0.58 % 0.19/0.58 # Proof search is over... % 0.19/0.58 # Freeing feature tree %------------------------------------------------------------------------------