%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP774+1 : TPTP v8.1.0. Released v4.1.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 : n009.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 : Sat Jul 16 09:08:24 EDT 2022 % Result : Theorem 153.61s 31.20s % Output : CNFRefutation 153.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP774+1 : TPTP v8.1.0. Released v4.1.0. % 0.07/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 : n009.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 13 04:21:38 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.12/0.37 # and selection function SelectCQIPrecWNTNp. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 8 Number of unprocessed: 8 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 1.66/1.90 # The folding up rule is enabled... % 1.66/1.90 # Local unification is enabled... % 1.66/1.90 # Any saturation attempts will use folding labels... % 1.66/1.90 # 8 beginning clauses after preprocessing and clausification % 1.66/1.90 # Creating start rules for all 3 conjectures. % 1.66/1.90 # There are 3 start rule candidates: % 1.66/1.90 # Found 5 unit axioms. % 1.66/1.90 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 1.66/1.90 # 3 start rule tableaux created. % 1.66/1.90 # 3 extension rule candidate clauses % 1.66/1.90 # 5 unit axiom clauses % 1.66/1.90 % 1.66/1.90 # Requested 8, 32 cores available to the main process. % 1.66/1.90 # There are not enough tableaux to fork, creating more from the initial 3 % 13.23/13.43 # Creating equality axioms % 13.23/13.43 # Ran out of tableaux, making start rules for all clauses % 13.23/13.43 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 13.23/13.43 # We now have 11 tableaux to operate on % 153.61/31.20 # There were 15 total branch saturation attempts. % 153.61/31.20 # There were 0 of these attempts blocked. % 153.61/31.20 # There were 0 deferred branch saturation attempts. % 153.61/31.20 # There were 0 free duplicated saturations. % 153.61/31.20 # There were 2 total successful branch saturations. % 153.61/31.20 # There were 0 successful branch saturations in interreduction. % 153.61/31.20 # There were 0 successful branch saturations on the branch. % 153.61/31.20 # There were 2 successful branch saturations after the branch. % 153.61/31.20 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 153.61/31.20 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 153.61/31.20 # Begin clausification derivation % 153.61/31.20 % 153.61/31.20 # End clausification derivation % 153.61/31.20 # Begin listing active clauses obtained from FOF to CNF conversion % 153.61/31.20 cnf(i_0_8, negated_conjecture, (d(esk1_0,esk2_0))). % 153.61/31.20 cnf(i_0_7, negated_conjecture, (d(esk3_0,esk4_0))). % 153.61/31.20 cnf(i_0_2, plain, (product(X1,X1)=X1)). % 153.61/31.20 cnf(i_0_1, plain, (product(product(X1,X2),X3)=product(X1,product(X2,X3)))). % 153.61/31.20 cnf(i_0_6, negated_conjecture, (~d(product(esk1_0,esk3_0),product(esk2_0,esk4_0)))). % 153.61/31.20 cnf(i_0_4, plain, (product(X1,product(X2,X1))=X1|~d(X2,X1))). % 153.61/31.20 cnf(i_0_5, plain, (product(X1,product(X2,X1))=X1|~d(X1,X2))). % 153.61/31.20 cnf(i_0_3, plain, (d(X1,X2)|product(X2,product(X1,X2))!=X2|product(X1,product(X2,X1))!=X1)). % 153.61/31.20 cnf(i_0_775601, plain, (X20=X20)). % 153.61/31.20 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 153.61/31.20 # Begin printing tableau % 153.61/31.20 # Found 9 steps % 153.61/31.20 cnf(i_0_1, plain, (product(product(product(esk1_0,esk3_0),esk1_0),esk3_0)=product(product(esk1_0,esk3_0),product(esk1_0,esk3_0))), inference(start_rule)). % 153.61/31.20 cnf(i_0_775610, plain, (product(product(product(esk1_0,esk3_0),esk1_0),esk3_0)=product(product(esk1_0,esk3_0),product(esk1_0,esk3_0))), inference(extension_rule, [i_0_775604])). % 153.61/31.20 cnf(i_0_775654, plain, (product(product(esk1_0,esk3_0),product(esk1_0,esk3_0))!=product(esk1_0,esk3_0)), inference(closure_rule, [i_0_2])). % 153.61/31.20 cnf(i_0_775652, plain, (product(product(product(esk1_0,esk3_0),esk1_0),esk3_0)=product(esk1_0,esk3_0)), inference(extension_rule, [i_0_775606])). % 153.61/31.20 cnf(i_0_1274416, plain, (d(product(esk1_0,esk3_0),product(esk2_0,esk4_0))), inference(closure_rule, [i_0_6])). % 153.61/31.20 cnf(i_0_1274418, plain, (product(product(esk2_0,esk4_0),product(esk2_0,esk4_0))!=product(esk2_0,esk4_0)), inference(closure_rule, [i_0_2])). % 153.61/31.20 cnf(i_0_1274419, plain, (~d(product(product(product(esk1_0,esk3_0),esk1_0),esk3_0),product(product(esk2_0,esk4_0),product(esk2_0,esk4_0)))), inference(extension_rule, [i_0_3])). % 153.61/31.20 cnf(i_0_1380257, plain, (product(product(product(esk2_0,esk4_0),product(esk2_0,esk4_0)),product(product(product(product(esk1_0,esk3_0),esk1_0),esk3_0),product(product(esk2_0,esk4_0),product(esk2_0,esk4_0))))!=product(product(esk2_0,esk4_0),product(esk2_0,esk4_0))), inference(etableau_closure_rule, [i_0_1380257, ...])). % 153.61/31.20 cnf(i_0_1380258, plain, (product(product(product(product(esk1_0,esk3_0),esk1_0),esk3_0),product(product(product(esk2_0,esk4_0),product(esk2_0,esk4_0)),product(product(product(esk1_0,esk3_0),esk1_0),esk3_0)))!=product(product(product(esk1_0,esk3_0),esk1_0),esk3_0)), inference(etableau_closure_rule, [i_0_1380258, ...])). % 153.61/31.20 # End printing tableau % 153.61/31.20 # SZS output end % 153.61/31.20 # Branches closed with saturation will be marked with an "s" % 154.32/31.22 # Child (7760) has found a proof. % 154.32/31.22 % 154.32/31.22 # Proof search is over... % 154.32/31.22 # Freeing feature tree %------------------------------------------------------------------------------