%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : BOO038-1 : TPTP v8.1.0. Released 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 : n022.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:30 EDT 2022 % Result : Unsatisfiable 2.42s 2.59s % Output : CNFRefutation 2.42s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : BOO038-1 : TPTP v8.1.0. Released v2.5.0. % 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n022.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Wed Jun 1 20:09:37 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 2 Number of unprocessed: 2 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 2.24/2.44 # The folding up rule is enabled... % 2.24/2.44 # Local unification is enabled... % 2.24/2.44 # Any saturation attempts will use folding labels... % 2.24/2.44 # 2 beginning clauses after preprocessing and clausification % 2.24/2.44 # Creating start rules for all 1 conjectures. % 2.24/2.44 # There are 1 start rule candidates: % 2.24/2.44 # Found 1 unit axioms. % 2.24/2.44 # 1 start rule tableaux created. % 2.24/2.44 # 1 extension rule candidate clauses % 2.24/2.44 # 1 unit axiom clauses % 2.24/2.44 % 2.24/2.44 # Requested 8, 32 cores available to the main process. % 2.24/2.44 # There are not enough tableaux to fork, creating more from the initial 1 % 2.24/2.44 # Creating equality axioms % 2.24/2.44 # Ran out of tableaux, making start rules for all clauses % 2.42/2.59 # There were 1 total branch saturation attempts. % 2.42/2.59 # There were 0 of these attempts blocked. % 2.42/2.59 # There were 0 deferred branch saturation attempts. % 2.42/2.59 # There were 0 free duplicated saturations. % 2.42/2.59 # There were 1 total successful branch saturations. % 2.42/2.59 # There were 0 successful branch saturations in interreduction. % 2.42/2.59 # There were 0 successful branch saturations on the branch. % 2.42/2.59 # There were 1 successful branch saturations after the branch. % 2.42/2.59 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.42/2.59 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.42/2.59 # Begin clausification derivation % 2.42/2.59 % 2.42/2.59 # End clausification derivation % 2.42/2.59 # Begin listing active clauses obtained from FOF to CNF conversion % 2.42/2.59 cnf(i_0_3, plain, (inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4))))))))=X3)). % 2.42/2.59 cnf(i_0_4, negated_conjecture, (add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b))))!=a|add(add(a,b),c)!=add(a,add(b,c))|add(b,a)!=add(a,b))). % 2.42/2.59 cnf(i_0_17, plain, (X5=X5)). % 2.42/2.59 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.42/2.59 # Begin printing tableau % 2.42/2.59 # Found 5 steps % 2.42/2.59 cnf(i_0_3, plain, (inverse(add(inverse(add(inverse(add(X4,X8)),add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4))))))))),inverse(add(X4,inverse(add(inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))),inverse(add(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4))))))),X11))))))))=add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))), inference(start_rule)). % 2.42/2.59 cnf(i_0_23, plain, (inverse(add(inverse(add(inverse(add(X4,X8)),add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4))))))))),inverse(add(X4,inverse(add(inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))),inverse(add(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4))))))),X11))))))))=add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))), inference(extension_rule, [i_0_22])). % 2.42/2.59 cnf(i_0_41, plain, (inverse(inverse(add(inverse(add(inverse(add(X4,X8)),add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4))))))))),inverse(add(X4,inverse(add(inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))),inverse(add(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4))))))),X11)))))))))=inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4))))))))), inference(extension_rule, [i_0_20])). % 2.42/2.59 cnf(i_0_52, plain, (inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4))))))))!=X3), inference(closure_rule, [i_0_3])). % 2.42/2.59 cnf(i_0_50, plain, (inverse(inverse(add(inverse(add(inverse(add(X4,X8)),add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4))))))))),inverse(add(X4,inverse(add(inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))),inverse(add(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4))))))),X11)))))))))=X3), inference(etableau_closure_rule, [i_0_50, ...])). % 2.42/2.59 # End printing tableau % 2.42/2.59 # SZS output end % 2.42/2.59 # Branches closed with saturation will be marked with an "s" % 2.42/2.59 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 2.42/2.59 # We now have 7 tableaux to operate on % 2.42/2.59 # Found closed tableau during pool population. % 2.42/2.59 # Proof search is over... % 2.42/2.59 # Freeing feature tree %------------------------------------------------------------------------------