%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU191+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 : n012.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:38 EDT 2022 % Result : Theorem 15.38s 2.31s % Output : CNFRefutation 15.38s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SEU191+1 : TPTP v8.1.0. Released v3.3.0. % 0.06/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n012.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jun 20 00:32:52 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.37 # % 0.13/0.37 # Number of axioms: 43 Number of unprocessed: 43 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 43 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 4 conjectures. % 0.13/0.37 # There are 4 start rule candidates: % 0.13/0.37 # Found 16 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 4 start rule tableaux created. % 0.13/0.37 # 27 extension rule candidate clauses % 0.13/0.37 # 16 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 4 % 0.13/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 13 tableaux to operate on % 15.38/2.31 # There were 2 total branch saturation attempts. % 15.38/2.31 # There were 0 of these attempts blocked. % 15.38/2.31 # There were 0 deferred branch saturation attempts. % 15.38/2.31 # There were 0 free duplicated saturations. % 15.38/2.31 # There were 2 total successful branch saturations. % 15.38/2.31 # There were 0 successful branch saturations in interreduction. % 15.38/2.31 # There were 0 successful branch saturations on the branch. % 15.38/2.31 # There were 2 successful branch saturations after the branch. % 15.38/2.31 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 15.38/2.31 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 15.38/2.31 # Begin clausification derivation % 15.38/2.31 % 15.38/2.31 # End clausification derivation % 15.38/2.31 # Begin listing active clauses obtained from FOF to CNF conversion % 15.38/2.31 cnf(i_0_27, plain, (empty(empty_set))). % 15.38/2.31 cnf(i_0_32, plain, (empty(empty_set))). % 15.38/2.31 cnf(i_0_36, plain, (empty(esk8_0))). % 15.38/2.31 cnf(i_0_37, plain, (empty(esk9_0))). % 15.38/2.31 cnf(i_0_31, plain, (relation(empty_set))). % 15.38/2.31 cnf(i_0_35, plain, (relation(esk8_0))). % 15.38/2.31 cnf(i_0_38, plain, (relation(esk10_0))). % 15.38/2.31 cnf(i_0_47, negated_conjecture, (relation(esk15_0))). % 15.38/2.31 cnf(i_0_39, plain, (~empty(esk10_0))). % 15.38/2.31 cnf(i_0_40, plain, (~empty(esk11_0))). % 15.38/2.31 cnf(i_0_43, plain, (X1=empty_set|~empty(X1))). % 15.38/2.31 cnf(i_0_22, plain, (relation(identity_relation(X1)))). % 15.38/2.31 cnf(i_0_2, plain, (relation(X1)|~empty(X1))). % 15.38/2.31 cnf(i_0_49, plain, (X1=X2|~empty(X2)|~empty(X1))). % 15.38/2.31 cnf(i_0_29, plain, (~empty(singleton(X1)))). % 15.38/2.31 cnf(i_0_24, plain, (element(esk7_1(X1),X1))). % 15.38/2.31 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 15.38/2.31 cnf(i_0_48, plain, (~empty(X2)|~in(X1,X2))). % 15.38/2.31 cnf(i_0_41, plain, (element(X1,X2)|~in(X1,X2))). % 15.38/2.31 cnf(i_0_42, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 15.38/2.31 cnf(i_0_26, plain, (empty(relation_composition(X1,X2))|~empty(X2)|~relation(X1))). % 15.38/2.31 cnf(i_0_34, plain, (empty(relation_composition(X1,X2))|~empty(X1)|~relation(X2))). % 15.38/2.31 cnf(i_0_25, plain, (relation(relation_composition(X1,X2))|~empty(X2)|~relation(X1))). % 15.38/2.31 cnf(i_0_33, plain, (relation(relation_composition(X1,X2))|~empty(X1)|~relation(X2))). % 15.38/2.31 cnf(i_0_21, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~relation(X1))). % 15.38/2.31 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 15.38/2.31 cnf(i_0_30, plain, (~empty(unordered_pair(X1,X2)))). % 15.38/2.31 cnf(i_0_45, negated_conjecture, (in(esk12_0,esk14_0)|in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),relation_composition(identity_relation(esk14_0),esk15_0)))). % 15.38/2.31 cnf(i_0_7, plain, (in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),X4)|X1!=X3|X4!=identity_relation(X2)|~relation(X4)|~in(X1,X2))). % 15.38/2.31 cnf(i_0_28, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))). % 15.38/2.31 cnf(i_0_8, plain, (X1=X2|X3!=identity_relation(X4)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))). % 15.38/2.31 cnf(i_0_9, plain, (in(X1,X2)|X4!=identity_relation(X2)|~relation(X4)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),X4))). % 15.38/2.31 cnf(i_0_44, negated_conjecture, (in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),esk15_0)|in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),relation_composition(identity_relation(esk14_0),esk15_0)))). % 15.38/2.31 cnf(i_0_46, negated_conjecture, (~in(esk12_0,esk14_0)|~in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),esk15_0)|~in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),relation_composition(identity_relation(esk14_0),esk15_0)))). % 15.38/2.31 cnf(i_0_4, plain, (X2=identity_relation(X1)|esk2_2(X1,X2)=esk1_2(X1,X2)|in(unordered_pair(unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),singleton(esk1_2(X1,X2))),X2)|~relation(X2))). % 15.38/2.31 cnf(i_0_5, plain, (X2=identity_relation(X1)|in(esk1_2(X1,X2),X1)|in(unordered_pair(unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),singleton(esk1_2(X1,X2))),X2)|~relation(X2))). % 15.38/2.31 cnf(i_0_14, plain, (in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X6)|X6!=relation_composition(X3,X5)|~relation(X6)|~relation(X5)|~relation(X3)|~in(unordered_pair(unordered_pair(X2,X4),singleton(X2)),X5)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))). % 15.38/2.31 cnf(i_0_6, plain, (X2=identity_relation(X1)|esk2_2(X1,X2)!=esk1_2(X1,X2)|~relation(X2)|~in(esk1_2(X1,X2),X1)|~in(unordered_pair(unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),singleton(esk1_2(X1,X2))),X2))). % 15.38/2.31 cnf(i_0_12, plain, (X3=relation_composition(X1,X2)|in(unordered_pair(unordered_pair(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3)),singleton(esk4_3(X1,X2,X3))),X3)|in(unordered_pair(unordered_pair(esk4_3(X1,X2,X3),esk6_3(X1,X2,X3)),singleton(esk4_3(X1,X2,X3))),X1)|~relation(X3)|~relation(X2)|~relation(X1))). % 15.38/2.31 cnf(i_0_11, plain, (X3=relation_composition(X1,X2)|in(unordered_pair(unordered_pair(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3)),singleton(esk4_3(X1,X2,X3))),X3)|in(unordered_pair(unordered_pair(esk6_3(X1,X2,X3),esk5_3(X1,X2,X3)),singleton(esk6_3(X1,X2,X3))),X2)|~relation(X3)|~relation(X2)|~relation(X1))). % 15.38/2.31 cnf(i_0_13, plain, (X3=relation_composition(X1,X2)|~relation(X3)|~relation(X2)|~relation(X1)|~in(unordered_pair(unordered_pair(X4,esk5_3(X1,X2,X3)),singleton(X4)),X2)|~in(unordered_pair(unordered_pair(esk4_3(X1,X2,X3),X4),singleton(esk4_3(X1,X2,X3))),X1)|~in(unordered_pair(unordered_pair(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3)),singleton(esk4_3(X1,X2,X3))),X3))). % 15.38/2.31 cnf(i_0_16, plain, (in(unordered_pair(unordered_pair(X1,esk3_5(X2,X3,X4,X1,X5)),singleton(X1)),X2)|X4!=relation_composition(X2,X3)|~relation(X4)|~relation(X3)|~relation(X2)|~in(unordered_pair(unordered_pair(X1,X5),singleton(X1)),X4))). % 15.38/2.31 cnf(i_0_15, plain, (in(unordered_pair(unordered_pair(esk3_5(X1,X2,X3,X4,X5),X5),singleton(esk3_5(X1,X2,X3,X4,X5))),X2)|X3!=relation_composition(X1,X2)|~relation(X3)|~relation(X2)|~relation(X1)|~in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X3))). % 15.38/2.31 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 15.38/2.31 # Begin printing tableau % 15.38/2.31 # Found 6 steps % 15.38/2.31 cnf(i_0_44, negated_conjecture, (in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),esk15_0)|in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),relation_composition(identity_relation(esk14_0),esk15_0))), inference(start_rule)). % 15.38/2.31 cnf(i_0_53, plain, (in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),esk15_0)), inference(extension_rule, [i_0_48])). % 15.38/2.31 cnf(i_0_371, plain, (~empty(esk15_0)), inference(extension_rule, [i_0_42])). % 15.38/2.31 cnf(i_0_384, plain, (~element(esk7_1(esk15_0),esk15_0)), inference(closure_rule, [i_0_24])). % 15.38/2.31 cnf(i_0_54, plain, (in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),relation_composition(identity_relation(esk14_0),esk15_0))), inference(etableau_closure_rule, [i_0_54, ...])). % 15.38/2.31 cnf(i_0_383, plain, (in(esk7_1(esk15_0),esk15_0)), inference(etableau_closure_rule, [i_0_383, ...])). % 15.38/2.31 # End printing tableau % 15.38/2.31 # SZS output end % 15.38/2.31 # Branches closed with saturation will be marked with an "s" % 15.38/2.31 # Child (5540) has found a proof. % 15.38/2.31 % 15.38/2.31 # Proof search is over... % 15.38/2.31 # Freeing feature tree %------------------------------------------------------------------------------