%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU178+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 : n008.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:31 EDT 2022 % Result : Theorem 6.93s 1.23s % Output : CNFRefutation 6.93s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SEU178+1 : TPTP v8.1.0. Released v3.3.0. % 0.12/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 : n008.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 05:11:22 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.19/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.19/0.37 # % 0.19/0.37 # Number of axioms: 46 Number of unprocessed: 46 % 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 # 46 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 2 conjectures. % 0.19/0.37 # There are 2 start rule candidates: % 0.19/0.37 # Found 16 unit axioms. % 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.37 # 2 start rule tableaux created. % 0.19/0.37 # 30 extension rule candidate clauses % 0.19/0.37 # 16 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 2 % 0.19/0.37 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 12 tableaux to operate on % 6.85/1.23 # There were 3 total branch saturation attempts. % 6.85/1.23 # There were 0 of these attempts blocked. % 6.85/1.23 # There were 0 deferred branch saturation attempts. % 6.85/1.23 # There were 0 free duplicated saturations. % 6.85/1.23 # There were 3 total successful branch saturations. % 6.85/1.23 # There were 0 successful branch saturations in interreduction. % 6.85/1.23 # There were 0 successful branch saturations on the branch. % 6.85/1.23 # There were 3 successful branch saturations after the branch. % 6.93/1.23 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.93/1.23 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.93/1.23 # Begin clausification derivation % 6.93/1.23 % 6.93/1.23 # End clausification derivation % 6.93/1.23 # Begin listing active clauses obtained from FOF to CNF conversion % 6.93/1.23 cnf(i_0_34, plain, (relation(esk12_0))). % 6.93/1.23 cnf(i_0_48, negated_conjecture, (relation(esk17_0))). % 6.93/1.23 cnf(i_0_29, plain, (empty(empty_set))). % 6.93/1.23 cnf(i_0_35, plain, (empty(esk12_0))). % 6.93/1.23 cnf(i_0_38, plain, (empty(esk14_0))). % 6.93/1.23 cnf(i_0_41, plain, (~empty(esk16_0))). % 6.93/1.23 cnf(i_0_54, plain, (X1=empty_set|~empty(X1))). % 6.93/1.23 cnf(i_0_39, plain, (empty(esk15_1(X1)))). % 6.93/1.23 cnf(i_0_42, plain, (subset(X1,X1))). % 6.93/1.23 cnf(i_0_56, plain, (X1=X2|~empty(X2)|~empty(X1))). % 6.93/1.23 cnf(i_0_31, plain, (~empty(singleton(X1)))). % 6.93/1.23 cnf(i_0_28, plain, (~empty(powerset(X1)))). % 6.93/1.23 cnf(i_0_27, plain, (element(esk11_1(X1),X1))). % 6.93/1.23 cnf(i_0_36, plain, (empty(X1)|~empty(esk13_1(X1)))). % 6.93/1.23 cnf(i_0_4, plain, (relation(X1)|in(esk3_1(X1),X1))). % 6.93/1.23 cnf(i_0_40, plain, (element(esk15_1(X1),powerset(X1)))). % 6.93/1.23 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 6.93/1.23 cnf(i_0_55, plain, (~empty(X2)|~in(X1,X2))). % 6.93/1.23 cnf(i_0_37, plain, (empty(X1)|element(esk13_1(X1),powerset(X1)))). % 6.93/1.23 cnf(i_0_46, plain, (element(X1,X2)|~in(X1,X2))). % 6.93/1.23 cnf(i_0_49, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 6.93/1.23 cnf(i_0_50, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 6.93/1.23 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 6.93/1.23 cnf(i_0_51, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 6.93/1.23 cnf(i_0_32, plain, (~empty(unordered_pair(X1,X2)))). % 6.93/1.23 cnf(i_0_7, plain, (subset(X1,X2)|in(esk4_2(X1,X2),X1))). % 6.93/1.23 cnf(i_0_33, plain, (empty(X2)|empty(X1)|~empty(cartesian_product2(X1,X2)))). % 6.93/1.23 cnf(i_0_8, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))). % 6.93/1.23 cnf(i_0_53, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 6.93/1.23 cnf(i_0_52, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 6.93/1.23 cnf(i_0_6, plain, (subset(X1,X2)|~in(esk4_2(X1,X2),X2))). % 6.93/1.23 cnf(i_0_47, negated_conjecture, (~subset(esk17_0,cartesian_product2(relation_dom(esk17_0),relation_rng(esk17_0))))). % 6.93/1.23 cnf(i_0_3, plain, (relation(X1)|esk3_1(X1)!=unordered_pair(unordered_pair(X2,X3),singleton(X2)))). % 6.93/1.23 cnf(i_0_30, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))). % 6.93/1.23 cnf(i_0_43, plain, (in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4))|~in(X3,X4)|~in(X1,X2))). % 6.93/1.23 cnf(i_0_15, plain, (in(X2,X4)|X4!=relation_rng(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))). % 6.93/1.23 cnf(i_0_11, plain, (in(X1,X4)|X4!=relation_dom(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))). % 6.93/1.23 cnf(i_0_44, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)))). % 6.93/1.23 cnf(i_0_45, plain, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)))). % 6.93/1.23 cnf(i_0_5, plain, (unordered_pair(unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),singleton(esk1_2(X1,X2)))=X2|~relation(X1)|~in(X2,X1))). % 6.93/1.23 cnf(i_0_14, plain, (X2=relation_rng(X1)|~relation(X1)|~in(esk9_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(X3,esk9_2(X1,X2)),singleton(X3)),X1))). % 6.93/1.23 cnf(i_0_9, plain, (X2=relation_dom(X1)|in(esk6_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk6_2(X1,X2),esk7_2(X1,X2)),singleton(esk6_2(X1,X2))),X1)|~relation(X1))). % 6.93/1.23 cnf(i_0_13, plain, (X2=relation_rng(X1)|in(esk9_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk10_2(X1,X2),esk9_2(X1,X2)),singleton(esk10_2(X1,X2))),X1)|~relation(X1))). % 6.93/1.23 cnf(i_0_10, plain, (X2=relation_dom(X1)|~relation(X1)|~in(esk6_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(esk6_2(X1,X2),X3),singleton(esk6_2(X1,X2))),X1))). % 6.93/1.23 cnf(i_0_12, plain, (in(unordered_pair(unordered_pair(X1,esk5_3(X3,X2,X1)),singleton(X1)),X3)|X2!=relation_dom(X3)|~relation(X3)|~in(X1,X2))). % 6.93/1.23 cnf(i_0_16, plain, (in(unordered_pair(unordered_pair(esk8_3(X3,X2,X1),X1),singleton(esk8_3(X3,X2,X1))),X3)|X2!=relation_rng(X3)|~relation(X3)|~in(X1,X2))). % 6.93/1.23 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 6.93/1.23 # Begin printing tableau % 6.93/1.23 # Found 4 steps % 6.93/1.23 cnf(i_0_47, negated_conjecture, (~subset(esk17_0,cartesian_product2(relation_dom(esk17_0),relation_rng(esk17_0)))), inference(start_rule)). % 6.93/1.23 cnf(i_0_57, plain, (~subset(esk17_0,cartesian_product2(relation_dom(esk17_0),relation_rng(esk17_0)))), inference(extension_rule, [i_0_51])). % 6.93/1.23 cnf(i_0_82, plain, (~element(esk17_0,powerset(cartesian_product2(relation_dom(esk17_0),relation_rng(esk17_0))))), inference(extension_rule, [i_0_46])). % 6.93/1.23 cnf(i_0_19445, plain, (~in(esk17_0,powerset(cartesian_product2(relation_dom(esk17_0),relation_rng(esk17_0))))), inference(etableau_closure_rule, [i_0_19445, ...])). % 6.93/1.23 # End printing tableau % 6.93/1.23 # SZS output end % 6.93/1.23 # Branches closed with saturation will be marked with an "s" % 6.93/1.24 # Child (20849) has found a proof. % 6.93/1.24 % 6.93/1.24 # Proof search is over... % 6.93/1.24 # Freeing feature tree %------------------------------------------------------------------------------