%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP040-3 : 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 : n029.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:07 EDT 2022 % Result : Unsatisfiable 0.18s 0.37s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GRP040-3 : TPTP v8.1.0. Released v1.0.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n029.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jun 14 07:12:10 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic C07_19_nc_SAT001_MinMin_rr % 0.18/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 17 Number of unprocessed: 17 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 17 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 1 conjectures. % 0.18/0.36 # There are 1 start rule candidates: % 0.18/0.36 # Found 11 unit axioms. % 0.18/0.36 # 1 start rule tableaux created. % 0.18/0.36 # 6 extension rule candidate clauses % 0.18/0.36 # 11 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.18/0.36 # Creating equality axioms % 0.18/0.36 # Ran out of tableaux, making start rules for all clauses % 0.18/0.36 # Returning from population with 20 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 20 tableaux to operate on % 0.18/0.37 # There were 1 total branch saturation attempts. % 0.18/0.37 # There were 0 of these attempts blocked. % 0.18/0.37 # There were 0 deferred branch saturation attempts. % 0.18/0.37 # There were 0 free duplicated saturations. % 0.18/0.37 # There were 1 total successful branch saturations. % 0.18/0.37 # There were 0 successful branch saturations in interreduction. % 0.18/0.37 # There were 0 successful branch saturations on the branch. % 0.18/0.37 # There were 1 successful branch saturations after the branch. % 0.18/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # Begin clausification derivation % 0.18/0.37 % 0.18/0.37 # End clausification derivation % 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.37 cnf(i_0_30, hypothesis, (subgroup_member(b))). % 0.18/0.37 cnf(i_0_34, negated_conjecture, (inverse(inverse(X1))=X1)). % 0.18/0.37 cnf(i_0_33, hypothesis, (product(a,c,d))). % 0.18/0.37 cnf(i_0_19, plain, (product(X1,identity,X1))). % 0.18/0.37 cnf(i_0_18, plain, (product(identity,X1,X1))). % 0.18/0.37 cnf(i_0_21, plain, (product(X1,inverse(X1),identity))). % 0.18/0.37 cnf(i_0_20, plain, (product(inverse(X1),X1,identity))). % 0.18/0.37 cnf(i_0_32, hypothesis, (product(b,inverse(a),c))). % 0.18/0.37 cnf(i_0_22, plain, (product(X1,X2,multiply(X1,X2)))). % 0.18/0.37 cnf(i_0_29, hypothesis, (~subgroup_member(a))). % 0.18/0.37 cnf(i_0_31, hypothesis, (~subgroup_member(d))). % 0.18/0.37 cnf(i_0_27, plain, (subgroup_member(element_in_O2(X1,X2))|subgroup_member(X1)|subgroup_member(X2))). % 0.18/0.37 cnf(i_0_26, plain, (subgroup_member(X1)|~subgroup_member(X2)|~subgroup_member(X3)|~product(X3,inverse(X2),X1))). % 0.18/0.37 cnf(i_0_23, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.18/0.37 cnf(i_0_28, plain, (subgroup_member(X1)|subgroup_member(X2)|product(X1,element_in_O2(X1,X2),X2))). % 0.18/0.37 cnf(i_0_25, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))). % 0.18/0.37 cnf(i_0_24, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 0.18/0.37 cnf(i_0_57, plain, (X7=X7)). % 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.37 # Begin printing tableau % 0.18/0.37 # Found 6 steps % 0.18/0.37 cnf(i_0_30, hypothesis, (subgroup_member(b)), inference(start_rule)). % 0.18/0.37 cnf(i_0_66, plain, (subgroup_member(b)), inference(extension_rule, [i_0_64])). % 0.18/0.37 cnf(i_0_137, plain, (subgroup_member(a)), inference(closure_rule, [i_0_29])). % 0.18/0.37 cnf(i_0_138, plain, (b!=a), inference(extension_rule, [i_0_23])). % 0.18/0.37 cnf(i_0_151, plain, (~product(a,identity,a)), inference(closure_rule, [i_0_19])). % 0.18/0.37 cnf(i_0_152, plain, (~product(a,identity,b)), inference(etableau_closure_rule, [i_0_152, ...])). % 0.18/0.37 # End printing tableau % 0.18/0.37 # SZS output end % 0.18/0.37 # Branches closed with saturation will be marked with an "s" % 0.18/0.37 # Child (24410) has found a proof. % 0.18/0.37 % 0.18/0.37 # Proof search is over... % 0.18/0.37 # Freeing feature tree %------------------------------------------------------------------------------