%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET988+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 : n022.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 01:04:17 EDT 2022 % Result : Theorem 0.13s 0.38s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SET988+1 : TPTP v8.1.0. Released v3.2.0. % 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n022.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sun Jul 10 15:06:55 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 49 Number of unprocessed: 45 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # 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 # 45 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 3 conjectures. % 0.13/0.37 # There are 3 start rule candidates: % 0.13/0.37 # Found 21 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 3 start rule tableaux created. % 0.13/0.37 # 24 extension rule candidate clauses % 0.13/0.37 # 21 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 3 % 0.13/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 10 tableaux to operate on % 0.13/0.38 # There were 2 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 2 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 2 successful branch saturations after the branch. % 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_2, plain, (relation(empty_set))). % 0.13/0.38 cnf(i_0_24, plain, (relation(esk2_0))). % 0.13/0.38 cnf(i_0_29, plain, (relation(esk5_0))). % 0.13/0.38 cnf(i_0_3, plain, (empty(empty_set))). % 0.13/0.38 cnf(i_0_31, plain, (relation(esk6_0))). % 0.13/0.38 cnf(i_0_34, plain, (relation(esk7_0))). % 0.13/0.38 cnf(i_0_23, plain, (function(esk2_0))). % 0.13/0.38 cnf(i_0_30, plain, (empty(esk5_0))). % 0.13/0.38 cnf(i_0_36, plain, (empty(esk8_0))). % 0.13/0.38 cnf(i_0_4, plain, (relation_empty_yielding(empty_set))). % 0.13/0.38 cnf(i_0_33, plain, (relation_empty_yielding(esk7_0))). % 0.13/0.38 cnf(i_0_27, plain, (empty(esk4_1(X1)))). % 0.13/0.38 cnf(i_0_1, plain, (subset(X1,X1))). % 0.13/0.38 cnf(i_0_9, plain, (element(esk1_1(X1),X1))). % 0.13/0.38 cnf(i_0_28, plain, (element(esk4_1(X1),powerset(X1)))). % 0.13/0.38 cnf(i_0_8, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.13/0.38 cnf(i_0_32, plain, (~empty(esk6_0))). % 0.13/0.38 cnf(i_0_37, plain, (~empty(esk9_0))). % 0.13/0.38 cnf(i_0_11, plain, (~empty(powerset(X1)))). % 0.13/0.38 cnf(i_0_12, plain, (~empty(singleton(X1)))). % 0.13/0.38 cnf(i_0_13, plain, (~empty(unordered_pair(X1,X2)))). % 0.13/0.38 cnf(i_0_41, negated_conjecture, (~function(esk10_0)|~relation(esk10_0))). % 0.13/0.38 cnf(i_0_39, plain, (~in(X1,X2)|~empty(X2))). % 0.13/0.38 cnf(i_0_14, plain, (relation(X1)|~empty(X1))). % 0.13/0.38 cnf(i_0_10, plain, (function(X1)|~empty(X1))). % 0.13/0.38 cnf(i_0_20, plain, (X1=empty_set|~empty(X1))). % 0.13/0.38 cnf(i_0_22, plain, (~in(X1,X2)|~in(X2,X1))). % 0.13/0.38 cnf(i_0_25, plain, (empty(X1)|~empty(esk3_1(X1)))). % 0.13/0.38 cnf(i_0_44, plain, (function(X1)|esk15_1(X1)!=esk14_1(X1))). % 0.13/0.38 cnf(i_0_38, plain, (element(X1,X2)|~in(X1,X2))). % 0.13/0.38 cnf(i_0_17, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.13/0.38 cnf(i_0_49, plain, (in(esk18_1(X1),X1)|relation(X1))). % 0.13/0.38 cnf(i_0_48, plain, (relation(X1)|esk18_1(X1)!=unordered_pair(singleton(X2),unordered_pair(X2,X3)))). % 0.13/0.38 cnf(i_0_21, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.13/0.38 cnf(i_0_43, negated_conjecture, (unordered_pair(singleton(esk11_1(X1)),unordered_pair(esk11_1(X1),esk12_1(X1)))=X1|~in(X1,esk10_0))). % 0.13/0.38 cnf(i_0_16, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.13/0.38 cnf(i_0_19, plain, (~in(X1,X2)|~element(X2,powerset(X3))|~empty(X3))). % 0.13/0.38 cnf(i_0_15, plain, (in(X1,X2)|empty(X2)|~element(X1,X2))). % 0.13/0.38 cnf(i_0_18, plain, (element(X1,X2)|~in(X1,X3)|~element(X3,powerset(X2)))). % 0.13/0.38 cnf(i_0_26, plain, (element(esk3_1(X1),powerset(X1))|empty(X1))). % 0.13/0.38 cnf(i_0_46, plain, (in(unordered_pair(singleton(esk13_1(X1)),unordered_pair(esk13_1(X1),esk14_1(X1))),X1)|function(X1))). % 0.13/0.38 cnf(i_0_42, negated_conjecture, (X1=X2|~in(unordered_pair(singleton(X3),unordered_pair(X3,X2)),esk10_0)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),esk10_0))). % 0.13/0.38 cnf(i_0_45, plain, (in(unordered_pair(singleton(esk13_1(X1)),unordered_pair(esk13_1(X1),esk15_1(X1))),X1)|function(X1))). % 0.13/0.38 cnf(i_0_47, plain, (X1=X2|~in(unordered_pair(singleton(X3),unordered_pair(X3,X2)),X4)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),X4)|~function(X4))). % 0.13/0.38 cnf(i_0_50, plain, (unordered_pair(singleton(esk16_2(X1,X2)),unordered_pair(esk16_2(X1,X2),esk17_2(X1,X2)))=X2|~in(X2,X1)|~relation(X1))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 5 steps % 0.13/0.38 cnf(i_0_41, negated_conjecture, (~function(esk10_0)|~relation(esk10_0)), inference(start_rule)). % 0.13/0.38 cnf(i_0_56, plain, (~function(esk10_0)), inference(extension_rule, [i_0_10])). % 0.13/0.38 cnf(i_0_231, plain, (~empty(esk10_0)), inference(extension_rule, [i_0_25])). % 0.13/0.38 cnf(i_0_57, plain, (~relation(esk10_0)), inference(etableau_closure_rule, [i_0_57, ...])). % 0.13/0.38 cnf(i_0_241, plain, (~empty(esk3_1(esk10_0))), inference(etableau_closure_rule, [i_0_241, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Child (12067) has found a proof. % 0.13/0.38 % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------