%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : BOO031-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 : n018.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:29 EDT 2022 % Result : Unsatisfiable 3.06s 0.74s % Output : CNFRefutation 3.06s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : BOO031-1 : TPTP v8.1.0. Released v2.2.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 : n018.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 1 22:48:14 EDT 2022 % 0.12/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: 12 Number of unprocessed: 12 % 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 # 12 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 12 unit axioms. % 0.18/0.36 # 1 start rule tableaux created. % 0.18/0.36 # 0 extension rule candidate clauses % 0.18/0.36 # 12 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 19 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 19 tableaux to operate on % 3.06/0.74 # There were 1 total branch saturation attempts. % 3.06/0.74 # There were 0 of these attempts blocked. % 3.06/0.74 # There were 0 deferred branch saturation attempts. % 3.06/0.74 # There were 0 free duplicated saturations. % 3.06/0.74 # There were 1 total successful branch saturations. % 3.06/0.74 # There were 0 successful branch saturations in interreduction. % 3.06/0.74 # There were 0 successful branch saturations on the branch. % 3.06/0.74 # There were 1 successful branch saturations after the branch. % 3.06/0.74 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.06/0.74 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.06/0.74 # Begin clausification derivation % 3.06/0.74 % 3.06/0.74 # End clausification derivation % 3.06/0.74 # Begin listing active clauses obtained from FOF to CNF conversion % 3.06/0.74 cnf(i_0_21, plain, (multiply(X1,inverse(X1))=n0)). % 3.06/0.74 cnf(i_0_20, plain, (add(X1,inverse(X1))=n1)). % 3.06/0.74 cnf(i_0_16, plain, (multiply(n1,X1)=X1)). % 3.06/0.74 cnf(i_0_19, plain, (add(n0,X1)=X1)). % 3.06/0.74 cnf(i_0_23, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 3.06/0.74 cnf(i_0_22, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). % 3.06/0.74 cnf(i_0_17, plain, (multiply(X1,add(X2,add(X1,X3)))=X1)). % 3.06/0.74 cnf(i_0_14, plain, (add(X1,multiply(X2,multiply(X1,X3)))=X1)). % 3.06/0.74 cnf(i_0_18, plain, (multiply(add(X1,X2),multiply(add(X2,X3),X2))=X2)). % 3.06/0.74 cnf(i_0_15, plain, (add(multiply(X1,X2),add(multiply(X2,X3),X2))=X2)). % 3.06/0.74 cnf(i_0_13, plain, (add(multiply(X1,X2),add(multiply(X2,X3),multiply(X3,X1)))=multiply(add(X1,X2),multiply(add(X2,X3),add(X3,X1))))). % 3.06/0.74 cnf(i_0_24, negated_conjecture, (add(multiply(b,a),multiply(c,a))!=multiply(a,add(b,c)))). % 3.06/0.75 cnf(i_0_26, plain, (X4=X4)). % 3.06/0.75 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 3.06/0.75 # Begin printing tableau % 3.06/0.75 # Found 6 steps % 3.06/0.75 cnf(i_0_21, plain, (multiply(X7,inverse(X7))=n0), inference(start_rule)). % 3.06/0.75 cnf(i_0_33, plain, (multiply(X7,inverse(X7))=n0), inference(extension_rule, [i_0_31])). % 3.06/0.75 cnf(i_0_57, plain, (multiply(add(n0,n0),inverse(add(n0,n0)))!=n0), inference(closure_rule, [i_0_21])). % 3.06/0.75 cnf(i_0_56, plain, (add(multiply(add(n0,n0),inverse(add(n0,n0))),multiply(X7,inverse(X7)))=add(n0,n0)), inference(extension_rule, [i_0_29])). % 3.06/0.75 cnf(i_0_67, plain, (add(n0,n0)!=multiply(n1,add(n0,n0))), inference(closure_rule, [i_0_16])). % 3.06/0.75 cnf(i_0_65, plain, (add(multiply(add(n0,n0),inverse(add(n0,n0))),multiply(X7,inverse(X7)))=multiply(n1,add(n0,n0))), inference(etableau_closure_rule, [i_0_65, ...])). % 3.06/0.75 # End printing tableau % 3.06/0.75 # SZS output end % 3.06/0.75 # Branches closed with saturation will be marked with an "s" % 3.06/0.75 # Child (13680) has found a proof. % 3.06/0.75 % 3.06/0.75 # Proof search is over... % 3.06/0.75 # Freeing feature tree %------------------------------------------------------------------------------