%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : BOO023-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 : n023.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:28 EDT 2022 % Result : Unsatisfiable 5.25s 1.06s % Output : CNFRefutation 5.25s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : BOO023-1 : TPTP v8.1.0. Released v2.2.0. % 0.13/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.35 % Computer : n023.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Wed Jun 1 21:20:56 EDT 2022 % 0.20/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: 7 Number of unprocessed: 7 % 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.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 7 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 1 conjectures. % 0.20/0.38 # There are 1 start rule candidates: % 0.20/0.38 # Found 7 unit axioms. % 0.20/0.38 # 1 start rule tableaux created. % 0.20/0.38 # 0 extension rule candidate clauses % 0.20/0.38 # 7 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.38 # Creating equality axioms % 0.20/0.38 # Ran out of tableaux, making start rules for all clauses % 0.20/0.38 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.20/0.38 # We now have 14 tableaux to operate on % 5.25/1.06 # There were 1 total branch saturation attempts. % 5.25/1.06 # There were 0 of these attempts blocked. % 5.25/1.06 # There were 0 deferred branch saturation attempts. % 5.25/1.06 # There were 0 free duplicated saturations. % 5.25/1.06 # There were 1 total successful branch saturations. % 5.25/1.06 # There were 0 successful branch saturations in interreduction. % 5.25/1.06 # There were 0 successful branch saturations on the branch. % 5.25/1.06 # There were 1 successful branch saturations after the branch. % 5.25/1.06 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.25/1.06 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.25/1.06 # Begin clausification derivation % 5.25/1.06 % 5.25/1.06 # End clausification derivation % 5.25/1.06 # Begin listing active clauses obtained from FOF to CNF conversion % 5.25/1.06 cnf(i_0_11, plain, (add(X1,inverse(X1))=n1)). % 5.25/1.06 cnf(i_0_9, plain, (multiply(add(X1,X2),X2)=X2)). % 5.25/1.06 cnf(i_0_10, plain, (add(multiply(X2,X1),multiply(X3,X1))=multiply(X1,add(X2,X3)))). % 5.25/1.06 cnf(i_0_16, negated_conjecture, (multiply(add(a,b),add(a,c))!=add(a,multiply(b,c)))). % 5.25/1.06 cnf(i_0_14, plain, (add(multiply(X1,inverse(X2)),add(multiply(X1,X2),multiply(inverse(X2),X2)))=X1)). % 5.25/1.06 cnf(i_0_15, plain, (add(multiply(X1,inverse(X2)),add(multiply(X1,X1),multiply(inverse(X2),X1)))=X1)). % 5.25/1.06 cnf(i_0_13, plain, (add(multiply(X1,inverse(X1)),add(multiply(X1,X2),multiply(inverse(X1),X2)))=X2)). % 5.25/1.06 cnf(i_0_18, plain, (X4=X4)). % 5.25/1.06 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 5.25/1.06 # Begin printing tableau % 5.25/1.06 # Found 6 steps % 5.25/1.06 cnf(i_0_11, plain, (add(X9,inverse(X9))=n1), inference(start_rule)). % 5.25/1.06 cnf(i_0_25, plain, (add(X9,inverse(X9))=n1), inference(extension_rule, [i_0_21])). % 5.25/1.06 cnf(i_0_38, plain, (add(X9,inverse(X9))!=n1), inference(closure_rule, [i_0_11])). % 5.25/1.06 cnf(i_0_37, plain, (n1=n1), inference(extension_rule, [i_0_22])). % 5.25/1.06 cnf(i_0_104, plain, (add(X1,inverse(X1))!=n1), inference(closure_rule, [i_0_11])). % 5.25/1.06 cnf(i_0_102, plain, (add(n1,add(X1,inverse(X1)))=add(n1,n1)), inference(etableau_closure_rule, [i_0_102, ...])). % 5.25/1.06 # End printing tableau % 5.25/1.06 # SZS output end % 5.25/1.06 # Branches closed with saturation will be marked with an "s" % 5.25/1.06 # Child (25693) has found a proof. % 5.25/1.06 % 5.25/1.06 # Proof search is over... % 5.25/1.06 # Freeing feature tree %------------------------------------------------------------------------------