%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP044-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 : 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:04:09 EDT 2022 % Result : Unsatisfiable 0.14s 0.38s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP044-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.14/0.35 % Computer : n009.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Tue Jun 14 02:31:23 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN % 0.14/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 10 Number of unprocessed: 10 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.14/0.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 10 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 1 conjectures. % 0.14/0.38 # There are 1 start rule candidates: % 0.14/0.38 # Found 6 unit axioms. % 0.14/0.38 # 1 start rule tableaux created. % 0.14/0.38 # 4 extension rule candidate clauses % 0.14/0.38 # 6 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.38 # There were 1 total branch saturation attempts. % 0.14/0.38 # There were 0 of these attempts blocked. % 0.14/0.38 # There were 0 deferred branch saturation attempts. % 0.14/0.38 # There were 0 free duplicated saturations. % 0.14/0.38 # There were 1 total successful branch saturations. % 0.14/0.38 # There were 0 successful branch saturations in interreduction. % 0.14/0.38 # There were 0 successful branch saturations on the branch. % 0.14/0.38 # There were 1 successful branch saturations after the branch. % 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # Begin clausification derivation % 0.14/0.38 % 0.14/0.38 # End clausification derivation % 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.38 cnf(i_0_19, hypothesis, (product(a,c,result))). % 0.14/0.38 cnf(i_0_18, hypothesis, (equalish(a,b))). % 0.14/0.38 cnf(i_0_11, plain, (product(identity,X1,X1))). % 0.14/0.38 cnf(i_0_12, plain, (product(inverse(X1),X1,identity))). % 0.14/0.38 cnf(i_0_13, plain, (product(X1,X2,multiply(X1,X2)))). % 0.14/0.38 cnf(i_0_20, negated_conjecture, (~product(b,c,result))). % 0.14/0.38 cnf(i_0_17, plain, (product(X1,X2,X3)|~equalish(X4,X3)|~product(X1,X2,X4))). % 0.14/0.38 cnf(i_0_14, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.14/0.38 cnf(i_0_16, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))). % 0.14/0.38 cnf(i_0_15, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.38 # Begin printing tableau % 0.14/0.38 # Found 7 steps % 0.14/0.38 cnf(i_0_20, negated_conjecture, (~product(b,c,result)), inference(start_rule)). % 0.14/0.38 cnf(i_0_21, plain, (~product(b,c,result)), inference(extension_rule, [i_0_15])). % 0.14/0.38 cnf(i_0_33, plain, (~product(a,c,result)), inference(closure_rule, [i_0_19])). % 0.14/0.38 cnf(i_0_34, plain, (~product(identity,c,c)), inference(closure_rule, [i_0_11])). % 0.14/0.38 cnf(i_0_35, plain, (~product(b,identity,a)), inference(extension_rule, [i_0_17])). % 0.14/0.38 cnf(i_0_38, plain, (~product(b,identity,multiply(b,identity))), inference(closure_rule, [i_0_13])). % 0.14/0.38 cnf(i_0_37, plain, (~equalish(multiply(b,identity),a)), inference(etableau_closure_rule, [i_0_37, ...])). % 0.14/0.38 # End printing tableau % 0.14/0.38 # SZS output end % 0.14/0.38 # Branches closed with saturation will be marked with an "s" % 0.14/0.38 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 0.14/0.38 # We now have 3 tableaux to operate on % 0.14/0.38 # Found closed tableau during pool population. % 0.14/0.38 # Proof search is over... % 0.14/0.38 # Freeing feature tree %------------------------------------------------------------------------------