%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET977+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 : n024.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:13 EDT 2022 % Result : Theorem 0.12s 0.36s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.11 % Problem : SET977+1 : TPTP v8.1.0. Released v3.2.0. % 0.09/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 : n024.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 : Sat Jul 9 22:43:43 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 16 Number of unprocessed: 16 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 16 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 2 conjectures. % 0.12/0.36 # There are 2 start rule candidates: % 0.12/0.36 # Found 7 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 2 start rule tableaux created. % 0.12/0.36 # 9 extension rule candidate clauses % 0.12/0.36 # 7 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.36 # There were 1 total branch saturation attempts. % 0.12/0.36 # There were 0 of these attempts blocked. % 0.12/0.36 # There were 0 deferred branch saturation attempts. % 0.12/0.36 # There were 0 free duplicated saturations. % 0.12/0.36 # There were 1 total successful branch saturations. % 0.12/0.36 # There were 0 successful branch saturations in interreduction. % 0.12/0.36 # There were 0 successful branch saturations on the branch. % 0.12/0.36 # There were 1 successful branch saturations after the branch. % 0.12/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.36 # Begin clausification derivation % 0.12/0.36 % 0.12/0.36 # End clausification derivation % 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.36 cnf(i_0_6, plain, (empty(empty_set))). % 0.12/0.36 cnf(i_0_8, plain, (empty(esk2_0))). % 0.12/0.36 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.12/0.36 cnf(i_0_17, negated_conjecture, (esk4_0!=empty_set)). % 0.12/0.36 cnf(i_0_9, plain, (~empty(esk3_0))). % 0.12/0.36 cnf(i_0_4, plain, (~in(X1,empty_set))). % 0.12/0.36 cnf(i_0_7, plain, (~empty(unordered_pair(singleton(X1),unordered_pair(X1,X2))))). % 0.12/0.36 cnf(i_0_16, negated_conjecture, (cartesian_product2(singleton(esk5_0),esk4_0)=empty_set|cartesian_product2(esk4_0,singleton(esk5_0))=empty_set)). % 0.12/0.36 cnf(i_0_3, plain, (X1=empty_set|in(esk1_1(X1),X1))). % 0.12/0.36 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.12/0.36 cnf(i_0_14, plain, (X1=X2|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,singleton(X2))))). % 0.12/0.36 cnf(i_0_12, plain, (X1=X2|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(singleton(X2),X4)))). % 0.12/0.36 cnf(i_0_15, plain, (in(X1,X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,singleton(X4))))). % 0.12/0.36 cnf(i_0_11, plain, (in(X1,X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(singleton(X4),X2)))). % 0.12/0.36 cnf(i_0_13, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,singleton(X2)))|~in(X1,X3))). % 0.12/0.36 cnf(i_0_10, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(singleton(X1),X3))|~in(X2,X3))). % 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.36 # Begin printing tableau % 0.12/0.36 # Found 4 steps % 0.12/0.36 cnf(i_0_17, negated_conjecture, (esk4_0!=empty_set), inference(start_rule)). % 0.12/0.36 cnf(i_0_23, plain, (esk4_0!=empty_set), inference(extension_rule, [i_0_12])). % 0.12/0.36 cnf(i_0_67, plain, (~in(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,X12)),cartesian_product2(singleton(empty_set),X11))), inference(extension_rule, [i_0_15])). % 0.12/0.36 cnf(i_0_87, plain, (~in(unordered_pair(singleton(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,X12))),unordered_pair(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,X12)),X9)),cartesian_product2(cartesian_product2(singleton(empty_set),X11),singleton(X10)))), inference(etableau_closure_rule, [i_0_87, ...])). % 0.12/0.36 # End printing tableau % 0.12/0.36 # SZS output end % 0.12/0.36 # Branches closed with saturation will be marked with an "s" % 0.12/0.36 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 3 tableaux to operate on % 0.12/0.36 # Found closed tableau during pool population. % 0.12/0.36 # Proof search is over... % 0.12/0.36 # Freeing feature tree %------------------------------------------------------------------------------