%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP002-1 : 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 : n004.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:51 EDT 2022 % Result : Unsatisfiable 3.22s 0.86s % Output : CNFRefutation 3.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP002-1 : 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 : n004.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 05:17:24 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_S4d % 0.13/0.37 # and selection function SelectCQIPrecWNTNp. % 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.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 16 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 6 conjectures. % 0.13/0.37 # There are 6 start rule candidates: % 0.13/0.37 # Found 11 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 6 start rule tableaux created. % 0.13/0.37 # 5 extension rule candidate clauses % 0.13/0.37 # 11 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 6 % 0.13/0.37 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 16 tableaux to operate on % 3.22/0.86 # There were 2 total branch saturation attempts. % 3.22/0.86 # There were 0 of these attempts blocked. % 3.22/0.86 # There were 0 deferred branch saturation attempts. % 3.22/0.86 # There were 0 free duplicated saturations. % 3.22/0.86 # There were 2 total successful branch saturations. % 3.22/0.86 # There were 0 successful branch saturations in interreduction. % 3.22/0.86 # There were 0 successful branch saturations on the branch. % 3.22/0.86 # There were 2 successful branch saturations after the branch. % 3.22/0.86 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.22/0.86 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.22/0.86 # Begin clausification derivation % 3.22/0.86 % 3.22/0.86 # End clausification derivation % 3.22/0.86 # Begin listing active clauses obtained from FOF to CNF conversion % 3.22/0.86 cnf(i_0_27, negated_conjecture, (product(a,b,c))). % 3.22/0.86 cnf(i_0_30, negated_conjecture, (product(h,b,j))). % 3.22/0.86 cnf(i_0_28, negated_conjecture, (product(c,inverse(a),d))). % 3.22/0.86 cnf(i_0_29, negated_conjecture, (product(d,inverse(b),h))). % 3.22/0.86 cnf(i_0_18, plain, (product(X1,identity,X1))). % 3.22/0.86 cnf(i_0_31, negated_conjecture, (product(j,inverse(h),k))). % 3.22/0.86 cnf(i_0_17, plain, (product(identity,X1,X1))). % 3.22/0.86 cnf(i_0_20, plain, (product(X1,inverse(X1),identity))). % 3.22/0.86 cnf(i_0_19, plain, (product(inverse(X1),X1,identity))). % 3.22/0.86 cnf(i_0_21, plain, (product(X1,X2,multiply(X1,X2)))). % 3.22/0.86 cnf(i_0_32, negated_conjecture, (~product(k,inverse(b),identity))). % 3.22/0.86 cnf(i_0_26, hypothesis, (product(X1,X2,identity)|~product(X2,X2,X1))). % 3.22/0.86 cnf(i_0_25, hypothesis, (product(X1,X2,identity)|~product(X1,X1,X2))). % 3.22/0.86 cnf(i_0_22, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))). % 3.22/0.86 cnf(i_0_24, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))). % 3.22/0.86 cnf(i_0_23, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 3.22/0.86 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 3.22/0.86 # Begin printing tableau % 3.22/0.86 # Found 6 steps % 3.22/0.86 cnf(i_0_31, negated_conjecture, (product(j,inverse(h),k)), inference(start_rule)). % 3.22/0.86 cnf(i_0_34, plain, (product(j,inverse(h),k)), inference(extension_rule, [i_0_23])). % 3.22/0.86 cnf(i_0_66, plain, (~product(k,identity,k)), inference(closure_rule, [i_0_18])). % 3.22/0.86 cnf(i_0_65, plain, (product(j,j,k)), inference(extension_rule, [i_0_26])). % 3.22/0.86 cnf(i_0_67, plain, (~product(inverse(h),identity,j)), inference(etableau_closure_rule, [i_0_67, ...])). % 3.22/0.86 cnf(i_0_69, plain, (product(k,j,identity)), inference(etableau_closure_rule, [i_0_69, ...])). % 3.22/0.86 # End printing tableau % 3.22/0.86 # SZS output end % 3.22/0.86 # Branches closed with saturation will be marked with an "s" % 3.22/0.86 # Child (1427) has found a proof. % 3.22/0.86 % 3.22/0.86 # Proof search is over... % 3.22/0.86 # Freeing feature tree %------------------------------------------------------------------------------