%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : BOO027-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 : n020.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 : Satisfiable 0.18s 0.36s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.11 % Problem : BOO027-1 : TPTP v8.1.0. Released v2.2.0. % 0.02/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.33 % Computer : n020.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 600 % 0.11/0.33 % DateTime : Wed Jun 1 17:47:08 EDT 2022 % 0.11/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S % 0.18/0.36 # and selection function SelectNewComplexAHP. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 6 Number of unprocessed: 6 % 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 # 6 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 6 unit axioms. % 0.18/0.36 # 1 start rule tableaux created. % 0.18/0.36 # 0 extension rule candidate clauses % 0.18/0.36 # 6 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 13 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 13 tableaux to operate on % 0.18/0.36 # 967 Satisfiable branch % 0.18/0.36 # Satisfiable branch found. % 0.18/0.36 # There were 1 total branch saturation attempts. % 0.18/0.36 # There were 0 of these attempts blocked. % 0.18/0.36 # There were 0 deferred branch saturation attempts. % 0.18/0.36 # There were 0 free duplicated saturations. % 0.18/0.36 # There were 0 total successful branch saturations. % 0.18/0.36 # There were 0 successful branch saturations in interreduction. % 0.18/0.36 # There were 0 successful branch saturations on the branch. % 0.18/0.36 # There were 0 successful branch saturations after the branch. % 0.18/0.36 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.36 # Begin clausification derivation % 0.18/0.36 % 0.18/0.36 # End clausification derivation % 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.36 cnf(i_0_8, plain, (add(X1,inverse(X1))=one)). % 0.18/0.36 cnf(i_0_7, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(X2,add(X1,X3)))). % 0.18/0.36 cnf(i_0_10, plain, (add(multiply(X1,inverse(X2)),multiply(X2,add(X1,inverse(X2))))=X1)). % 0.18/0.36 cnf(i_0_11, plain, (add(multiply(X1,inverse(X2)),multiply(X1,add(X1,inverse(X2))))=X1)). % 0.18/0.36 cnf(i_0_9, plain, (add(multiply(X1,inverse(X1)),multiply(X2,one))=X2)). % 0.18/0.36 cnf(i_0_12, negated_conjecture, (add(a,a)!=a)). % 0.18/0.36 cnf(i_0_14, plain, (X4=X4)). % 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.36 # Begin printing tableau % 0.18/0.36 # Found 5 steps % 0.18/0.36 cnf(i_0_8, plain, (add(X7,inverse(X7))=one), inference(start_rule)). % 0.18/0.36 cnf(i_0_21, plain, (add(X7,inverse(X7))=one), inference(extension_rule, [i_0_19])). % 0.18/0.36 cnf(i_0_39, plain, (add(multiply(one,one),inverse(multiply(one,one)))!=one), inference(closure_rule, [i_0_8])). % 0.18/0.36 cnf(i_0_38, plain, (multiply(add(multiply(one,one),inverse(multiply(one,one))),add(X7,inverse(X7)))=multiply(one,one)), inference(extension_rule, [i_0_17])). % 0.18/0.36 cnf(i_0_49, plain, (multiply(one,one)!=add(multiply(multiply(one,one),inverse(X2)),multiply(X2,add(multiply(one,one),inverse(X2))))), inference(closure_rule, [i_0_10])). % 0.18/0.36 # End printing tableau % 0.18/0.36 # SZS output end % 0.18/0.36 # Branches closed with saturation will be marked with an "s" % 0.18/0.36 # Child (967) has found a proof. % 0.18/0.36 % 0.18/0.36 # Proof search is over... % 0.18/0.36 # Freeing feature tree %------------------------------------------------------------------------------