%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : BOO034-1 : TPTP v8.1.0. Released v2.2.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 : n027.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 : Thu Jul 14 23:38:29 EDT 2022 % Result : Unsatisfiable 0.20s 0.41s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : BOO034-1 : TPTP v8.1.0. Released v2.2.0. % 0.04/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 : n027.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 : Wed Jun 1 19:00:19 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.20/0.38 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.20/0.38 # % 0.20/0.38 # Number of axioms: 6 Number of unprocessed: 6 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.39 # The folding up rule is enabled... % 0.20/0.39 # Local unification is enabled... % 0.20/0.39 # Any saturation attempts will use folding labels... % 0.20/0.39 # 6 beginning clauses after preprocessing and clausification % 0.20/0.39 # Creating start rules for all 1 conjectures. % 0.20/0.39 # There are 1 start rule candidates: % 0.20/0.39 # Found 6 unit axioms. % 0.20/0.39 # 1 start rule tableaux created. % 0.20/0.39 # 0 extension rule candidate clauses % 0.20/0.39 # 6 unit axiom clauses % 0.20/0.39 % 0.20/0.39 # Requested 8, 32 cores available to the main process. % 0.20/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.39 # Creating equality axioms % 0.20/0.39 # Ran out of tableaux, making start rules for all clauses % 0.20/0.39 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.20/0.39 # We now have 11 tableaux to operate on % 0.20/0.41 # There were 1 total branch saturation attempts. % 0.20/0.41 # There were 0 of these attempts blocked. % 0.20/0.41 # There were 0 deferred branch saturation attempts. % 0.20/0.41 # There were 0 free duplicated saturations. % 0.20/0.41 # There were 1 total successful branch saturations. % 0.20/0.41 # There were 0 successful branch saturations in interreduction. % 0.20/0.41 # There were 0 successful branch saturations on the branch. % 0.20/0.41 # There were 1 successful branch saturations after the branch. % 0.20/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.41 # Begin clausification derivation % 0.20/0.41 % 0.20/0.41 # End clausification derivation % 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.41 cnf(i_0_8, plain, (multiply(X1,X2,X2)=X2)). % 0.20/0.41 cnf(i_0_9, plain, (multiply(X1,X1,X2)=X1)). % 0.20/0.41 cnf(i_0_11, plain, (multiply(X1,X2,inverse(X2))=X1)). % 0.20/0.41 cnf(i_0_10, plain, (multiply(inverse(X1),X1,X2)=X2)). % 0.20/0.41 cnf(i_0_7, plain, (multiply(multiply(X1,X2,X3),X4,multiply(X1,X2,X5))=multiply(X1,X2,multiply(X3,X4,X5)))). % 0.20/0.41 cnf(i_0_12, negated_conjecture, (multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c))!=b)). % 0.20/0.41 cnf(i_0_14, plain, (X6=X6)). % 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.41 # Begin printing tableau % 0.20/0.41 # Found 6 steps % 0.20/0.41 cnf(i_0_9, plain, (multiply(b,b,multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)))=b), inference(start_rule)). % 0.20/0.41 cnf(i_0_21, plain, (multiply(b,b,multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)))=b), inference(extension_rule, [i_0_17])). % 0.20/0.41 cnf(i_0_44, plain, (multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c))=b), inference(closure_rule, [i_0_12])). % 0.20/0.41 cnf(i_0_45, plain, (multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c))!=multiply(b,b,multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)))), inference(extension_rule, [i_0_17])). % 0.20/0.41 cnf(i_0_140, plain, (multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c))!=multiply(X1,multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)),multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)))), inference(closure_rule, [i_0_8])). % 0.20/0.41 cnf(i_0_141, plain, (multiply(X1,multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)),multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)))!=multiply(b,b,multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)))), inference(etableau_closure_rule, [i_0_141, ...])). % 0.20/0.41 # End printing tableau % 0.20/0.41 # SZS output end % 0.20/0.41 # Branches closed with saturation will be marked with an "s" % 0.20/0.41 # There were 1 total branch saturation attempts. % 0.20/0.41 # There were 0 of these attempts blocked. % 0.20/0.41 # There were 0 deferred branch saturation attempts. % 0.20/0.41 # There were 0 free duplicated saturations. % 0.20/0.41 # There were 1 total successful branch saturations. % 0.20/0.41 # There were 0 successful branch saturations in interreduction. % 0.20/0.41 # There were 0 successful branch saturations on the branch. % 0.20/0.41 # There were 1 successful branch saturations after the branch. % 0.20/0.41 # Child (7114) has found a proof. % 0.20/0.41 % 0.20/0.41 # Proof search is over... % 0.20/0.41 # Freeing feature tree %------------------------------------------------------------------------------