%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU197+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 : n017.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:40 EDT 2022 % Result : Theorem 3.00s 0.74s % Output : CNFRefutation 3.00s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU197+1 : TPTP v8.1.0. Released v3.3.0. % 0.03/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 : n017.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 04:06:13 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___215_C46_F1_AE_CS_SP_PS_S2S % 0.19/0.37 # and selection function SelectNewComplexAHP. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 39 Number of unprocessed: 37 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 37 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 4 conjectures. % 0.19/0.37 # There are 4 start rule candidates: % 0.19/0.37 # Found 13 unit axioms. % 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.37 # 4 start rule tableaux created. % 0.19/0.37 # 24 extension rule candidate clauses % 0.19/0.37 # 13 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 4 % 0.19/0.37 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 15 tableaux to operate on % 3.00/0.74 # There were 4 total branch saturation attempts. % 3.00/0.74 # There were 0 of these attempts blocked. % 3.00/0.74 # There were 0 deferred branch saturation attempts. % 3.00/0.74 # There were 0 free duplicated saturations. % 3.00/0.74 # There were 4 total successful branch saturations. % 3.00/0.74 # There were 0 successful branch saturations in interreduction. % 3.00/0.74 # There were 0 successful branch saturations on the branch. % 3.00/0.74 # There were 4 successful branch saturations after the branch. % 3.00/0.74 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.00/0.74 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.00/0.74 # Begin clausification derivation % 3.00/0.74 % 3.00/0.74 # End clausification derivation % 3.00/0.74 # Begin listing active clauses obtained from FOF to CNF conversion % 3.00/0.74 cnf(i_0_41, negated_conjecture, (relation(esk13_0))). % 3.00/0.74 cnf(i_0_27, plain, (relation(empty_set))). % 3.00/0.74 cnf(i_0_32, plain, (relation(esk7_0))). % 3.00/0.74 cnf(i_0_35, plain, (relation(esk9_0))). % 3.00/0.74 cnf(i_0_23, plain, (empty(empty_set))). % 3.00/0.74 cnf(i_0_33, plain, (empty(esk7_0))). % 3.00/0.74 cnf(i_0_34, plain, (empty(esk8_0))). % 3.00/0.74 cnf(i_0_22, plain, (element(esk6_1(X1),X1))). % 3.00/0.74 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 3.00/0.74 cnf(i_0_36, plain, (~empty(esk9_0))). % 3.00/0.74 cnf(i_0_37, plain, (~empty(esk10_0))). % 3.00/0.74 cnf(i_0_25, plain, (~empty(singleton(X1)))). % 3.00/0.74 cnf(i_0_26, plain, (~empty(unordered_pair(X1,X2)))). % 3.00/0.74 cnf(i_0_40, negated_conjecture, (~in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,esk13_0)))|~in(esk11_0,relation_rng(esk13_0))|~in(esk11_0,esk12_0))). % 3.00/0.74 cnf(i_0_39, negated_conjecture, (in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,esk13_0)))|in(esk11_0,esk12_0))). % 3.00/0.74 cnf(i_0_38, negated_conjecture, (in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,esk13_0)))|in(esk11_0,relation_rng(esk13_0)))). % 3.00/0.74 cnf(i_0_2, plain, (relation(X1)|~empty(X1))). % 3.00/0.74 cnf(i_0_30, plain, (relation(relation_rng(X1))|~empty(X1))). % 3.00/0.74 cnf(i_0_44, plain, (X1=empty_set|~empty(X1))). % 3.00/0.74 cnf(i_0_20, plain, (relation(relation_rng_restriction(X1,X2))|~relation(X2))). % 3.00/0.74 cnf(i_0_45, plain, (~empty(X1)|~in(X2,X1))). % 3.00/0.74 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 3.00/0.74 cnf(i_0_46, plain, (X1=X2|~empty(X2)|~empty(X1))). % 3.00/0.74 cnf(i_0_31, plain, (empty(relation_rng(X1))|~empty(X1))). % 3.00/0.74 cnf(i_0_29, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))). % 3.00/0.74 cnf(i_0_42, plain, (element(X1,X2)|~in(X1,X2))). % 3.00/0.74 cnf(i_0_43, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 3.00/0.74 cnf(i_0_12, plain, (in(X1,X2)|X2!=relation_rng(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X3))). % 3.00/0.74 cnf(i_0_9, plain, (in(X1,X2)|X3!=relation_rng_restriction(X2,X4)|~relation(X4)|~relation(X3)|~in(unordered_pair(unordered_pair(X5,X1),singleton(X5)),X3))). % 3.00/0.74 cnf(i_0_11, plain, (X1=relation_rng(X2)|~relation(X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,esk4_2(X2,X1))),X2)|~in(esk4_2(X2,X1),X1))). % 3.00/0.74 cnf(i_0_8, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)|X4!=relation_rng_restriction(X5,X3)|~relation(X4)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X4))). % 3.00/0.74 cnf(i_0_13, plain, (in(unordered_pair(unordered_pair(X1,esk3_3(X2,X3,X1)),singleton(esk3_3(X2,X3,X1))),X2)|X3!=relation_rng(X2)|~relation(X2)|~in(X1,X3))). % 3.00/0.74 cnf(i_0_7, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)|X3!=relation_rng_restriction(X4,X5)|~relation(X3)|~relation(X5)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X5)|~in(X2,X4))). % 3.00/0.74 cnf(i_0_10, plain, (X1=relation_rng(X2)|in(unordered_pair(singleton(esk5_2(X2,X1)),unordered_pair(esk4_2(X2,X1),esk5_2(X2,X1))),X2)|in(esk4_2(X2,X1),X1)|~relation(X2))). % 3.00/0.74 cnf(i_0_5, plain, (X1=relation_rng_restriction(X2,X3)|in(unordered_pair(singleton(esk1_3(X2,X3,X1)),unordered_pair(esk2_3(X2,X3,X1),esk1_3(X2,X3,X1))),X1)|in(esk2_3(X2,X3,X1),X2)|~relation(X1)|~relation(X3))). % 3.00/0.74 cnf(i_0_6, plain, (X1=relation_rng_restriction(X2,X3)|~relation(X1)|~relation(X3)|~in(unordered_pair(singleton(esk1_3(X2,X3,X1)),unordered_pair(esk2_3(X2,X3,X1),esk1_3(X2,X3,X1))),X1)|~in(unordered_pair(singleton(esk1_3(X2,X3,X1)),unordered_pair(esk2_3(X2,X3,X1),esk1_3(X2,X3,X1))),X3)|~in(esk2_3(X2,X3,X1),X2))). % 3.00/0.74 cnf(i_0_4, plain, (X1=relation_rng_restriction(X2,X3)|in(unordered_pair(singleton(esk1_3(X2,X3,X1)),unordered_pair(esk2_3(X2,X3,X1),esk1_3(X2,X3,X1))),X3)|in(unordered_pair(singleton(esk1_3(X2,X3,X1)),unordered_pair(esk2_3(X2,X3,X1),esk1_3(X2,X3,X1))),X1)|~relation(X1)|~relation(X3))). % 3.00/0.74 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 3.00/0.74 # Begin printing tableau % 3.00/0.74 # Found 7 steps % 3.00/0.74 cnf(i_0_40, negated_conjecture, (~in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,esk13_0)))|~in(esk11_0,relation_rng(esk13_0))|~in(esk11_0,esk12_0)), inference(start_rule)). % 3.00/0.74 cnf(i_0_51, plain, (~in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,esk13_0)))), inference(extension_rule, [i_0_43])). % 3.00/0.74 cnf(i_0_237, plain, (empty(relation_rng(relation_rng_restriction(esk12_0,esk13_0)))), inference(extension_rule, [i_0_2])). % 3.00/0.74 cnf(i_0_52, plain, (~in(esk11_0,relation_rng(esk13_0))), inference(etableau_closure_rule, [i_0_52, ...])). % 3.00/0.74 cnf(i_0_53, plain, (~in(esk11_0,esk12_0)), inference(etableau_closure_rule, [i_0_53, ...])). % 3.00/0.74 cnf(i_0_239, plain, (~element(esk11_0,relation_rng(relation_rng_restriction(esk12_0,esk13_0)))), inference(etableau_closure_rule, [i_0_239, ...])). % 3.00/0.74 cnf(i_0_240, plain, (relation(relation_rng(relation_rng_restriction(esk12_0,esk13_0)))), inference(etableau_closure_rule, [i_0_240, ...])). % 3.00/0.74 # End printing tableau % 3.00/0.74 # SZS output end % 3.00/0.74 # Branches closed with saturation will be marked with an "s" % 3.00/0.75 # Child (22532) has found a proof. % 3.00/0.75 % 3.00/0.75 # Proof search is over... % 3.00/0.75 # Freeing feature tree %------------------------------------------------------------------------------