%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP029-2 : TPTP v8.1.0. Released v1.0.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 : n025.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:04:02 EDT 2022 % Result : Unsatisfiable 0.20s 0.40s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP029-2 : TPTP v8.1.0. Released v1.0.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 : n025.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 03:01:54 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 16 Number of unprocessed: 16 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.20/0.40 # The folding up rule is enabled... % 0.20/0.40 # Local unification is enabled... % 0.20/0.40 # Any saturation attempts will use folding labels... % 0.20/0.40 # 16 beginning clauses after preprocessing and clausification % 0.20/0.40 # Creating start rules for all 1 conjectures. % 0.20/0.40 # There are 1 start rule candidates: % 0.20/0.40 # Found 5 unit axioms. % 0.20/0.40 # 1 start rule tableaux created. % 0.20/0.40 # 11 extension rule candidate clauses % 0.20/0.40 # 5 unit axiom clauses % 0.20/0.40 % 0.20/0.40 # Requested 8, 32 cores available to the main process. % 0.20/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.40 # There were 1 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 1 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 1 successful branch saturations after the branch. % 0.20/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_17, plain, (equalish(X1,X1))). % 0.20/0.40 cnf(i_0_30, plain, (product(identity,X1,X1))). % 0.20/0.40 cnf(i_0_31, plain, (product(inverse(X1),X1,identity))). % 0.20/0.40 cnf(i_0_26, plain, (product(X1,X2,multiply(X1,X2)))). % 0.20/0.40 cnf(i_0_32, negated_conjecture, (~product(not_right_identity(X1),X1,not_right_identity(X1)))). % 0.20/0.40 cnf(i_0_18, plain, (equalish(X1,X2)|~equalish(X2,X1))). % 0.20/0.40 cnf(i_0_25, plain, (equalish(inverse(X1),inverse(X2))|~equalish(X1,X2))). % 0.20/0.40 cnf(i_0_19, plain, (equalish(X1,X2)|~equalish(X3,X2)|~equalish(X1,X3))). % 0.20/0.40 cnf(i_0_27, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.20/0.40 cnf(i_0_24, plain, (product(X1,X2,X3)|~product(X1,X2,X4)|~equalish(X4,X3))). % 0.20/0.40 cnf(i_0_23, plain, (product(X1,X2,X3)|~product(X1,X4,X3)|~equalish(X4,X2))). % 0.20/0.40 cnf(i_0_21, plain, (equalish(multiply(X1,X2),multiply(X1,X3))|~equalish(X2,X3))). % 0.20/0.40 cnf(i_0_22, plain, (product(X1,X2,X3)|~product(X4,X2,X3)|~equalish(X4,X1))). % 0.20/0.40 cnf(i_0_20, plain, (equalish(multiply(X1,X2),multiply(X3,X2))|~equalish(X1,X3))). % 0.20/0.40 cnf(i_0_29, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))). % 0.20/0.40 cnf(i_0_28, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.40 # Begin printing tableau % 0.20/0.40 # Found 7 steps % 0.20/0.40 cnf(i_0_32, negated_conjecture, (~product(not_right_identity(identity),identity,not_right_identity(identity))), inference(start_rule)). % 0.20/0.40 cnf(i_0_33, plain, (~product(not_right_identity(identity),identity,not_right_identity(identity))), inference(extension_rule, [i_0_28])). % 0.20/0.40 cnf(i_0_62, plain, (~product(identity,not_right_identity(identity),not_right_identity(identity))), inference(closure_rule, [i_0_30])). % 0.20/0.40 cnf(i_0_63, plain, (~product(inverse(not_right_identity(identity)),not_right_identity(identity),identity)), inference(closure_rule, [i_0_31])). % 0.20/0.40 cnf(i_0_64, plain, (~product(not_right_identity(identity),inverse(not_right_identity(identity)),identity)), inference(extension_rule, [i_0_24])). % 0.20/0.40 cnf(i_0_76, plain, (~product(not_right_identity(identity),inverse(not_right_identity(identity)),multiply(not_right_identity(identity),inverse(not_right_identity(identity))))), inference(closure_rule, [i_0_26])). % 0.20/0.40 cnf(i_0_77, plain, (~equalish(multiply(not_right_identity(identity),inverse(not_right_identity(identity))),identity)), inference(etableau_closure_rule, [i_0_77, ...])). % 0.20/0.40 # End printing tableau % 0.20/0.40 # SZS output end % 0.20/0.40 # Branches closed with saturation will be marked with an "s" % 0.20/0.40 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.20/0.40 # We now have 4 tableaux to operate on % 0.20/0.40 # Found closed tableau during pool population. % 0.20/0.40 # Proof search is over... % 0.20/0.40 # Freeing feature tree %------------------------------------------------------------------------------