%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET886+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 : n023.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:03:36 EDT 2022 % Result : Theorem 0.18s 0.37s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET886+1 : TPTP v8.1.0. Released v3.2.0. % 0.12/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 : n023.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 : Mon Jul 11 09:03:55 EDT 2022 % 0.12/0.34 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I % 0.18/0.36 # and selection function SelectCQArEqLast. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 7 Number of unprocessed: 7 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 7 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 2 conjectures. % 0.18/0.36 # There are 2 start rule candidates: % 0.18/0.36 # Found 6 unit axioms. % 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.36 # 2 start rule tableaux created. % 0.18/0.36 # 1 extension rule candidate clauses % 0.18/0.36 # 6 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.18/0.36 # Creating equality axioms % 0.18/0.36 # Ran out of tableaux, making start rules for all clauses % 0.18/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 8 tableaux to operate on % 0.18/0.37 # There were 1 total branch saturation attempts. % 0.18/0.37 # There were 0 of these attempts blocked. % 0.18/0.37 # There were 0 deferred branch saturation attempts. % 0.18/0.37 # There were 0 free duplicated saturations. % 0.18/0.37 # There were 1 total successful branch saturations. % 0.18/0.37 # There were 0 successful branch saturations in interreduction. % 0.18/0.37 # There were 0 successful branch saturations on the branch. % 0.18/0.37 # There were 1 successful branch saturations after the branch. % 0.18/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.37 # Begin clausification derivation % 0.18/0.37 % 0.18/0.37 # End clausification derivation % 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.37 cnf(i_0_4, plain, (subset(X1,X1))). % 0.18/0.37 cnf(i_0_7, negated_conjecture, (subset(unordered_pair(esk3_0,esk4_0),unordered_pair(esk5_0,esk5_0)))). % 0.18/0.37 cnf(i_0_2, plain, (empty(esk1_0))). % 0.18/0.37 cnf(i_0_1, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.18/0.37 cnf(i_0_6, negated_conjecture, (unordered_pair(esk5_0,esk5_0)!=unordered_pair(esk3_0,esk4_0))). % 0.18/0.37 cnf(i_0_3, plain, (~empty(esk2_0))). % 0.18/0.37 cnf(i_0_5, plain, (X1=X2|~subset(unordered_pair(X1,X3),unordered_pair(X2,X2)))). % 0.18/0.37 cnf(i_0_19, plain, (X16=X16)). % 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.37 # Begin printing tableau % 0.18/0.37 # Found 5 steps % 0.18/0.37 cnf(i_0_4, plain, (subset(unordered_pair(X2,X2),unordered_pair(X2,X2))), inference(start_rule)). % 0.18/0.37 cnf(i_0_26, plain, (subset(unordered_pair(X2,X2),unordered_pair(X2,X2))), inference(extension_rule, [i_0_5])). % 0.18/0.37 cnf(i_0_35, plain, (X2=X2), inference(extension_rule, [i_0_23])). % 0.18/0.37 cnf(i_0_65, plain, (unordered_pair(X1,X2)!=unordered_pair(X2,X1)), inference(closure_rule, [i_0_1])). % 0.18/0.37 cnf(i_0_63, plain, (unordered_pair(X2,unordered_pair(X1,X2))=unordered_pair(X2,unordered_pair(X2,X1))), inference(etableau_closure_rule, [i_0_63, ...])). % 0.18/0.37 # End printing tableau % 0.18/0.37 # SZS output end % 0.18/0.37 # Branches closed with saturation will be marked with an "s" % 0.18/0.37 # There were 1 total branch saturation attempts. % 0.18/0.37 # There were 0 of these attempts blocked. % 0.18/0.37 # There were 0 deferred branch saturation attempts. % 0.18/0.37 # There were 0 free duplicated saturations. % 0.18/0.37 # There were 1 total successful branch saturations. % 0.18/0.37 # There were 0 successful branch saturations in interreduction. % 0.18/0.37 # There were 0 successful branch saturations on the branch. % 0.18/0.37 # There were 1 successful branch saturations after the branch. % 0.18/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.37 # Begin clausification derivation % 0.18/0.37 % 0.18/0.37 # End clausification derivation % 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.37 cnf(i_0_4, plain, (subset(X1,X1))). % 0.18/0.37 cnf(i_0_7, negated_conjecture, (subset(unordered_pair(esk3_0,esk4_0),unordered_pair(esk5_0,esk5_0)))). % 0.18/0.37 cnf(i_0_2, plain, (empty(esk1_0))). % 0.18/0.37 cnf(i_0_1, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.18/0.37 cnf(i_0_6, negated_conjecture, (unordered_pair(esk5_0,esk5_0)!=unordered_pair(esk3_0,esk4_0))). % 0.18/0.37 cnf(i_0_3, plain, (~empty(esk2_0))). % 0.18/0.37 cnf(i_0_5, plain, (X1=X2|~subset(unordered_pair(X1,X3),unordered_pair(X2,X2)))). % 0.18/0.37 cnf(i_0_19, plain, (X16=X16)). % 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.37 # Begin printing tableau % 0.18/0.37 # Found 5 steps % 0.18/0.37 cnf(i_0_7, negated_conjecture, (subset(unordered_pair(esk3_0,esk4_0),unordered_pair(esk5_0,esk5_0))), inference(start_rule)). % 0.18/0.37 cnf(i_0_27, plain, (subset(unordered_pair(esk3_0,esk4_0),unordered_pair(esk5_0,esk5_0))), inference(extension_rule, [i_0_5])). % 0.18/0.37 cnf(i_0_54, plain, (esk3_0=esk5_0), inference(extension_rule, [i_0_23])). % 0.18/0.37 cnf(i_0_132, plain, (unordered_pair(esk3_0,esk4_0)=unordered_pair(esk5_0,esk5_0)), inference(closure_rule, [i_0_6])). % 0.18/0.37 cnf(i_0_134, plain, (esk4_0!=esk5_0), inference(etableau_closure_rule, [i_0_134, ...])). % 0.18/0.37 # End printing tableau % 0.18/0.37 # SZS output end % 0.18/0.37 # Branches closed with saturation will be marked with an "s" % 0.18/0.37 # Child (14075) has found a proof. % 0.18/0.37 % 0.18/0.37 # There were 1 total branch saturation attempts. % 0.18/0.37 # There were 0 of these attempts blocked. % 0.18/0.37 # There were 0 deferred branch saturation attempts. % 0.18/0.37 # There were 0 free duplicated saturations. % 0.18/0.37 # There were 1 total successful branch saturations. % 0.18/0.37 # There were 0 successful branch saturations in interreduction. % 0.18/0.37 # There were 0 successful branch saturations on the branch. % 0.18/0.37 # There were 1 successful branch saturations after the branch. % 0.18/0.37 # Proof search is over... % 0.18/0.37 # Freeing feature tree %------------------------------------------------------------------------------