%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ALG235-1 : TPTP v8.1.0. Released v4.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 : 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 16:52:14 EDT 2022 % Result : Unsatisfiable 0.18s 0.38s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : ALG235-1 : TPTP v8.1.0. Released v4.0.0. % 0.03/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 : n027.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 : Wed Jun 8 16:10:41 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN % 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 4 Number of unprocessed: 4 % 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 # 4 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 4 unit axioms. % 0.18/0.36 # 1 start rule tableaux created. % 0.18/0.36 # 0 extension rule candidate clauses % 0.18/0.36 # 4 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 8 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 8 tableaux to operate on % 0.18/0.38 # There were 1 total branch saturation attempts. % 0.18/0.38 # There were 0 of these attempts blocked. % 0.18/0.38 # There were 0 deferred branch saturation attempts. % 0.18/0.38 # There were 0 free duplicated saturations. % 0.18/0.38 # There were 1 total successful branch saturations. % 0.18/0.38 # There were 0 successful branch saturations in interreduction. % 0.18/0.38 # There were 0 successful branch saturations on the branch. % 0.18/0.38 # There were 1 successful branch saturations after the branch. % 0.18/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.38 # Begin clausification derivation % 0.18/0.38 % 0.18/0.38 # End clausification derivation % 0.18/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.38 cnf(i_0_5, plain, (mult(X1,mult(X2,mult(X1,X2)))=mult(X1,X2))). % 0.18/0.38 cnf(i_0_6, plain, (mult(X1,mult(X2,mult(X3,X4)))=mult(X3,mult(X2,mult(X1,X4))))). % 0.18/0.38 cnf(i_0_7, plain, (mult(mult(X1,mult(X2,mult(X3,X2))),X4)=mult(X1,mult(X4,mult(mult(X3,X2),X4))))). % 0.18/0.38 cnf(i_0_8, negated_conjecture, (mult(a,mult(c,mult(a,mult(b,mult(d,c)))))!=mult(a,mult(b,mult(d,c))))). % 0.18/0.38 cnf(i_0_10, plain, (X5=X5)). % 0.18/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.38 # Begin printing tableau % 0.18/0.38 # Found 9 steps % 0.18/0.38 cnf(i_0_5, plain, (mult(a,mult(mult(b,mult(d,c)),mult(a,mult(b,mult(d,c)))))=mult(a,mult(b,mult(d,c)))), inference(start_rule)). % 0.18/0.38 cnf(i_0_15, plain, (mult(a,mult(mult(b,mult(d,c)),mult(a,mult(b,mult(d,c)))))=mult(a,mult(b,mult(d,c)))), inference(extension_rule, [i_0_13])). % 0.18/0.38 cnf(i_0_24, plain, (mult(a,mult(c,mult(a,mult(b,mult(d,c)))))=mult(a,mult(b,mult(d,c)))), inference(closure_rule, [i_0_8])). % 0.18/0.38 cnf(i_0_25, plain, (mult(a,mult(c,mult(a,mult(b,mult(d,c)))))!=mult(a,mult(mult(b,mult(d,c)),mult(a,mult(b,mult(d,c)))))), inference(extension_rule, [i_0_13])). % 0.18/0.38 cnf(i_0_35, plain, (mult(a,mult(c,mult(a,mult(b,mult(d,c)))))!=mult(a,mult(mult(c,mult(a,mult(b,mult(d,c)))),mult(a,mult(c,mult(a,mult(b,mult(d,c)))))))), inference(extension_rule, [i_0_11])). % 0.18/0.38 cnf(i_0_36, plain, (mult(a,mult(mult(c,mult(a,mult(b,mult(d,c)))),mult(a,mult(c,mult(a,mult(b,mult(d,c)))))))!=mult(a,mult(mult(b,mult(d,c)),mult(a,mult(b,mult(d,c)))))), inference(extension_rule, [i_0_14])). % 0.18/0.38 cnf(i_0_42, plain, ($false), inference(closure_rule, [i_0_10])). % 0.18/0.38 cnf(i_0_38, plain, (mult(a,mult(mult(c,mult(a,mult(b,mult(d,c)))),mult(a,mult(c,mult(a,mult(b,mult(d,c)))))))!=mult(a,mult(c,mult(a,mult(b,mult(d,c)))))), inference(closure_rule, [i_0_5])). % 0.18/0.38 cnf(i_0_43, plain, (mult(mult(c,mult(a,mult(b,mult(d,c)))),mult(a,mult(c,mult(a,mult(b,mult(d,c))))))!=mult(mult(b,mult(d,c)),mult(a,mult(b,mult(d,c))))), inference(etableau_closure_rule, [i_0_43, ...])). % 0.18/0.38 # End printing tableau % 0.18/0.38 # SZS output end % 0.18/0.38 # Branches closed with saturation will be marked with an "s" % 0.18/0.38 # Child (7509) has found a proof. % 0.18/0.38 % 0.18/0.38 # Proof search is over... % 0.18/0.38 # Freeing feature tree %------------------------------------------------------------------------------