%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ALG003-1 : TPTP v8.1.0. Bugfixed v2.5.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 : n032.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 16:51:07 EDT 2022 % Result : Unsatisfiable 1.58s 1.77s % Output : CNFRefutation 1.58s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.05/0.10 % Problem : ALG003-1 : TPTP v8.1.0. Bugfixed v2.5.0. % 0.05/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.10/0.29 % Computer : n032.cluster.edu % 0.10/0.29 % Model : x86_64 x86_64 % 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.29 % Memory : 8042.1875MB % 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.29 % CPULimit : 300 % 0.10/0.29 % WCLimit : 600 % 0.10/0.29 % DateTime : Wed Jun 8 01:24:51 EDT 2022 % 0.10/0.29 % CPUTime : % 0.14/0.32 # No SInE strategy applied % 0.14/0.32 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y % 0.14/0.32 # and selection function SelectMaxLComplexAvoidPosPred. % 0.14/0.32 # % 0.14/0.32 # Number of axioms: 5 Number of unprocessed: 5 % 0.14/0.32 # Tableaux proof search. % 0.14/0.32 # APR header successfully linked. % 0.14/0.32 # Hello from C++ % 1.40/1.63 # The folding up rule is enabled... % 1.40/1.63 # Local unification is enabled... % 1.40/1.63 # Any saturation attempts will use folding labels... % 1.40/1.63 # 5 beginning clauses after preprocessing and clausification % 1.40/1.63 # Creating start rules for all 1 conjectures. % 1.40/1.63 # There are 1 start rule candidates: % 1.40/1.63 # Found 3 unit axioms. % 1.40/1.63 # 1 start rule tableaux created. % 1.40/1.63 # 2 extension rule candidate clauses % 1.40/1.63 # 3 unit axiom clauses % 1.40/1.63 % 1.40/1.63 # Requested 8, 32 cores available to the main process. % 1.40/1.63 # There are not enough tableaux to fork, creating more from the initial 1 % 1.58/1.77 # There were 1 total branch saturation attempts. % 1.58/1.77 # There were 0 of these attempts blocked. % 1.58/1.77 # There were 0 deferred branch saturation attempts. % 1.58/1.77 # There were 0 free duplicated saturations. % 1.58/1.77 # There were 1 total successful branch saturations. % 1.58/1.77 # There were 0 successful branch saturations in interreduction. % 1.58/1.77 # There were 0 successful branch saturations on the branch. % 1.58/1.77 # There were 1 successful branch saturations after the branch. % 1.58/1.77 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.58/1.77 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.58/1.77 # Begin clausification derivation % 1.58/1.77 % 1.58/1.77 # End clausification derivation % 1.58/1.77 # Begin listing active clauses obtained from FOF to CNF conversion % 1.58/1.77 cnf(i_0_9, hypothesis, (multiply(an_element,an_element)=an_element)). % 1.58/1.77 cnf(i_0_7, plain, (X2=X4|multiply(X1,X4)!=X3|multiply(X1,X2)!=X3)). % 1.58/1.77 cnf(i_0_6, plain, (X1=X4|multiply(X4,X2)!=X3|multiply(X1,X2)!=X3)). % 1.58/1.77 cnf(i_0_8, plain, (multiply(multiply(X1,X2),multiply(X3,X4))=multiply(multiply(X1,X3),multiply(X2,X4)))). % 1.58/1.77 cnf(i_0_10, negated_conjecture, (multiply(multiply(a,multiply(d,c)),multiply(multiply(b,e),f))!=multiply(multiply(a,multiply(b,c)),multiply(multiply(d,e),f)))). % 1.58/1.77 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.58/1.77 # Begin printing tableau % 1.58/1.77 # Found 6 steps % 1.58/1.77 cnf(i_0_10, negated_conjecture, (multiply(multiply(a,multiply(d,c)),multiply(multiply(b,e),f))!=multiply(multiply(a,multiply(b,c)),multiply(multiply(d,e),f))), inference(start_rule)). % 1.58/1.77 cnf(i_0_11, plain, (multiply(multiply(a,multiply(d,c)),multiply(multiply(b,e),f))!=multiply(multiply(a,multiply(b,c)),multiply(multiply(d,e),f))), inference(extension_rule, [i_0_6])). % 1.58/1.77 cnf(i_0_16, plain, (multiply(multiply(multiply(a,multiply(b,c)),multiply(multiply(d,e),f)),multiply(X10,X9))!=multiply(multiply(multiply(a,multiply(b,c)),X10),multiply(multiply(multiply(d,e),f),X9))), inference(closure_rule, [i_0_8])). % 1.58/1.77 cnf(i_0_17, plain, (multiply(multiply(multiply(a,multiply(d,c)),multiply(multiply(b,e),f)),multiply(X10,X9))!=multiply(multiply(multiply(a,multiply(b,c)),X10),multiply(multiply(multiply(d,e),f),X9))), inference(extension_rule, [i_0_7])). % 1.58/1.77 cnf(i_0_19, plain, (multiply(multiply(X1,X2),multiply(multiply(multiply(a,multiply(b,c)),X10),multiply(multiply(multiply(d,e),f),X9)))!=multiply(multiply(X1,multiply(multiply(a,multiply(b,c)),X10)),multiply(X2,multiply(multiply(multiply(d,e),f),X9)))), inference(closure_rule, [i_0_8])). % 1.58/1.77 cnf(i_0_20, plain, (multiply(multiply(X1,X2),multiply(multiply(multiply(a,multiply(d,c)),multiply(multiply(b,e),f)),multiply(X10,X9)))!=multiply(multiply(X1,multiply(multiply(a,multiply(b,c)),X10)),multiply(X2,multiply(multiply(multiply(d,e),f),X9)))), inference(etableau_closure_rule, [i_0_20, ...])). % 1.58/1.77 # End printing tableau % 1.58/1.77 # SZS output end % 1.58/1.77 # Branches closed with saturation will be marked with an "s" % 1.58/1.77 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 1.58/1.77 # We now have 2 tableaux to operate on % 1.58/1.77 # Found closed tableau during pool population. % 1.58/1.77 # Proof search is over... % 1.58/1.77 # Freeing feature tree %------------------------------------------------------------------------------