%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP012+5 : TPTP v8.1.0. Released v3.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 : n026.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:03:56 EDT 2022 % Result : Theorem 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP012+5 : TPTP v8.1.0. Released v3.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.13/0.34 % Computer : n026.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Tue Jun 14 13:58:51 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_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: 10 Number of unprocessed: 10 % 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.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 10 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 10 conjectures. % 0.13/0.36 # There are 10 start rule candidates: % 0.13/0.36 # Found 8 unit axioms. % 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.36 # 10 start rule tableaux created. % 0.13/0.36 # 2 extension rule candidate clauses % 0.13/0.36 # 8 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 1 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 1 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_2, negated_conjecture, (product(esk4_0,esk3_0,esk6_0))). % 0.13/0.37 cnf(i_0_3, negated_conjecture, (product(inverse(esk3_0),inverse(esk4_0),esk5_0))). % 0.13/0.37 cnf(i_0_7, negated_conjecture, (product(X1,esk1_0,X1))). % 0.13/0.37 cnf(i_0_6, negated_conjecture, (product(esk1_0,X1,X1))). % 0.13/0.37 cnf(i_0_5, negated_conjecture, (product(X1,inverse(X1),esk1_0))). % 0.13/0.37 cnf(i_0_4, negated_conjecture, (product(inverse(X1),X1,esk1_0))). % 0.13/0.37 cnf(i_0_10, negated_conjecture, (product(X1,X2,esk2_2(X1,X2)))). % 0.13/0.37 cnf(i_0_1, negated_conjecture, (~product(inverse(esk5_0),inverse(esk6_0),esk1_0))). % 0.13/0.37 cnf(i_0_8, negated_conjecture, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))). % 0.13/0.37 cnf(i_0_9, negated_conjecture, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 8 steps % 0.13/0.37 cnf(i_0_6, negated_conjecture, (product(esk1_0,esk1_0,esk1_0)), inference(start_rule)). % 0.13/0.37 cnf(i_0_23, plain, (product(esk1_0,esk1_0,esk1_0)), inference(extension_rule, [i_0_9])). % 0.13/0.37 cnf(i_0_27, plain, (product(inverse(esk5_0),inverse(esk6_0),esk1_0)), inference(closure_rule, [i_0_1])). % 0.13/0.37 cnf(i_0_29, plain, (~product(inverse(esk6_0),esk1_0,inverse(esk6_0))), inference(closure_rule, [i_0_7])). % 0.13/0.37 cnf(i_0_30, plain, (~product(inverse(esk5_0),inverse(esk6_0),esk1_0)), inference(extension_rule, [i_0_8])). % 0.13/0.37 cnf(i_0_32, plain, (~product(X10,inverse(esk6_0),esk2_2(X10,inverse(esk6_0)))), inference(closure_rule, [i_0_10])). % 0.13/0.37 cnf(i_0_33, plain, (~product(inverse(esk2_2(X10,inverse(esk6_0))),esk2_2(X10,inverse(esk6_0)),esk1_0)), inference(closure_rule, [i_0_4])). % 0.13/0.37 cnf(i_0_34, plain, (~product(inverse(esk2_2(X10,inverse(esk6_0))),X10,inverse(esk5_0))), inference(etableau_closure_rule, [i_0_34, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Child (29338) has found a proof. % 0.13/0.37 % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------