%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU147+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 : n032.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:10 EDT 2022 % Result : Theorem 0.16s 0.35s % Output : CNFRefutation 0.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.11 % Problem : SEU147+1 : TPTP v8.1.0. Released v3.3.0. % 0.09/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.31 % Computer : n032.cluster.edu % 0.11/0.31 % Model : x86_64 x86_64 % 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.31 % Memory : 8042.1875MB % 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.31 % CPULimit : 300 % 0.11/0.31 % WCLimit : 600 % 0.11/0.31 % DateTime : Mon Jun 20 02:12:03 EDT 2022 % 0.11/0.31 % CPUTime : % 0.16/0.34 # No SInE strategy applied % 0.16/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.16/0.34 # and selection function SelectUnlessUniqMax. % 0.16/0.34 # % 0.16/0.34 # Presaturation interreduction done % 0.16/0.34 # Number of axioms: 17 Number of unprocessed: 17 % 0.16/0.34 # Tableaux proof search. % 0.16/0.34 # APR header successfully linked. % 0.16/0.34 # Hello from C++ % 0.16/0.34 # The folding up rule is enabled... % 0.16/0.34 # Local unification is enabled... % 0.16/0.34 # Any saturation attempts will use folding labels... % 0.16/0.34 # 17 beginning clauses after preprocessing and clausification % 0.16/0.34 # Creating start rules for all 1 conjectures. % 0.16/0.34 # There are 1 start rule candidates: % 0.16/0.34 # Found 6 unit axioms. % 0.16/0.34 # 1 start rule tableaux created. % 0.16/0.34 # 11 extension rule candidate clauses % 0.16/0.34 # 6 unit axiom clauses % 0.16/0.34 % 0.16/0.34 # Requested 8, 32 cores available to the main process. % 0.16/0.34 # There are not enough tableaux to fork, creating more from the initial 1 % 0.16/0.35 # There were 2 total branch saturation attempts. % 0.16/0.35 # There were 0 of these attempts blocked. % 0.16/0.35 # There were 0 deferred branch saturation attempts. % 0.16/0.35 # There were 0 free duplicated saturations. % 0.16/0.35 # There were 2 total successful branch saturations. % 0.16/0.35 # There were 0 successful branch saturations in interreduction. % 0.16/0.35 # There were 0 successful branch saturations on the branch. % 0.16/0.35 # There were 2 successful branch saturations after the branch. % 0.16/0.35 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.16/0.35 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.16/0.35 # Begin clausification derivation % 0.16/0.35 % 0.16/0.35 # End clausification derivation % 0.16/0.35 # Begin listing active clauses obtained from FOF to CNF conversion % 0.16/0.35 cnf(i_0_13, plain, (empty(empty_set))). % 0.16/0.35 cnf(i_0_14, plain, (empty(esk3_0))). % 0.16/0.35 cnf(i_0_16, plain, (subset(X1,X1))). % 0.16/0.35 cnf(i_0_4, plain, (in(X1,singleton(X1)))). % 0.16/0.35 cnf(i_0_17, negated_conjecture, (powerset(empty_set)!=singleton(empty_set))). % 0.16/0.35 cnf(i_0_15, plain, (~empty(esk4_0))). % 0.16/0.35 cnf(i_0_20, plain, (X1=empty_set|~subset(X1,empty_set))). % 0.16/0.35 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.16/0.35 cnf(i_0_5, plain, (X1=X2|~in(X1,singleton(X2)))). % 0.16/0.35 cnf(i_0_2, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))). % 0.16/0.35 cnf(i_0_3, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))). % 0.16/0.35 cnf(i_0_8, plain, (in(X1,powerset(X2))|~subset(X1,X2))). % 0.16/0.35 cnf(i_0_9, plain, (subset(X1,X2)|~in(X1,powerset(X2)))). % 0.16/0.35 cnf(i_0_18, plain, (X1=X2|in(esk5_2(X1,X2),X1)|in(esk5_2(X1,X2),X2))). % 0.16/0.35 cnf(i_0_19, plain, (X1=X2|~in(esk5_2(X1,X2),X2)|~in(esk5_2(X1,X2),X1))). % 0.16/0.35 cnf(i_0_7, plain, (X1=powerset(X2)|~subset(esk2_2(X2,X1),X2)|~in(esk2_2(X2,X1),X1))). % 0.16/0.35 cnf(i_0_6, plain, (X1=powerset(X2)|subset(esk2_2(X2,X1),X2)|in(esk2_2(X2,X1),X1))). % 0.16/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.16/0.35 # Begin printing tableau % 0.16/0.35 # Found 5 steps % 0.16/0.35 cnf(i_0_17, negated_conjecture, (powerset(empty_set)!=singleton(empty_set)), inference(start_rule)). % 0.16/0.35 cnf(i_0_26, plain, (powerset(empty_set)!=singleton(empty_set)), inference(extension_rule, [i_0_6])). % 0.16/0.35 cnf(i_0_53, plain, (subset(esk2_2(empty_set,singleton(empty_set)),empty_set)), inference(extension_rule, [i_0_20])). % 0.16/0.35 cnf(i_0_54, plain, (in(esk2_2(empty_set,singleton(empty_set)),singleton(empty_set))), inference(etableau_closure_rule, [i_0_54, ...])). % 0.16/0.35 cnf(i_0_55, plain, (esk2_2(empty_set,singleton(empty_set))=empty_set), inference(etableau_closure_rule, [i_0_55, ...])). % 0.16/0.35 # End printing tableau % 0.16/0.35 # SZS output end % 0.16/0.35 # Branches closed with saturation will be marked with an "s" % 0.16/0.35 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 0.16/0.35 # We now have 7 tableaux to operate on % 0.16/0.35 # Found closed tableau during pool population. % 0.16/0.35 # Proof search is over... % 0.16/0.35 # Freeing feature tree %------------------------------------------------------------------------------