%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP093-1 : TPTP v8.1.0. Bugfixed v2.7.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 : n003.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 : Sat Jul 16 09:04:22 EDT 2022 % Result : Unsatisfiable 0.19s 0.42s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : GRP093-1 : TPTP v8.1.0. Bugfixed v2.7.0. % 0.03/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.33 % Computer : n003.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 : Tue Jun 14 07:44:10 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S % 0.12/0.36 # and selection function SelectNewComplexAHP. % 0.12/0.36 # % 0.12/0.36 # Number of axioms: 3 Number of unprocessed: 3 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.19/0.38 # The folding up rule is enabled... % 0.19/0.38 # Local unification is enabled... % 0.19/0.38 # Any saturation attempts will use folding labels... % 0.19/0.38 # 3 beginning clauses after preprocessing and clausification % 0.19/0.38 # Creating start rules for all 1 conjectures. % 0.19/0.38 # There are 1 start rule candidates: % 0.19/0.38 # Found 2 unit axioms. % 0.19/0.38 # 1 start rule tableaux created. % 0.19/0.38 # 1 extension rule candidate clauses % 0.19/0.38 # 2 unit axiom clauses % 0.19/0.38 % 0.19/0.38 # Requested 8, 32 cores available to the main process. % 0.19/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.38 # Creating equality axioms % 0.19/0.38 # Ran out of tableaux, making start rules for all clauses % 0.19/0.42 # There were 2 total branch saturation attempts. % 0.19/0.42 # There were 0 of these attempts blocked. % 0.19/0.42 # There were 0 deferred branch saturation attempts. % 0.19/0.42 # There were 0 free duplicated saturations. % 0.19/0.42 # There were 2 total successful branch saturations. % 0.19/0.42 # There were 0 successful branch saturations in interreduction. % 0.19/0.42 # There were 0 successful branch saturations on the branch. % 0.19/0.42 # There were 2 successful branch saturations after the branch. % 0.19/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # Begin clausification derivation % 0.19/0.42 % 0.19/0.42 # End clausification derivation % 0.19/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.42 cnf(i_0_9, plain, (divide(X1,X1)=identity)). % 0.19/0.42 cnf(i_0_6, plain, (divide(divide(identity,divide(divide(divide(X1,X2),X3),X1)),X3)=X2)). % 0.19/0.42 cnf(i_0_10, negated_conjecture, (divide(b4,divide(identity,a4))!=divide(a4,divide(identity,b4))|divide(divide(divide(identity,b2),divide(identity,b2)),divide(identity,a2))!=a2|divide(divide(identity,a1),divide(identity,a1))!=divide(divide(identity,b1),divide(identity,b1))|divide(divide(a3,divide(identity,b3)),divide(identity,c3))!=divide(a3,divide(identity,divide(b3,divide(identity,c3)))))). % 0.19/0.42 cnf(i_0_31, plain, (X4=X4)). % 0.19/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.42 # Begin printing tableau % 0.19/0.42 # Found 6 steps % 0.19/0.42 cnf(i_0_9, plain, (divide(X12,X12)=identity), inference(start_rule)). % 0.19/0.42 cnf(i_0_36, plain, (divide(X12,X12)=identity), inference(extension_rule, [i_0_35])). % 0.19/0.42 cnf(i_0_55, plain, (divide(X12,X12)!=identity), inference(closure_rule, [i_0_9])). % 0.19/0.42 cnf(i_0_54, plain, (divide(divide(X12,X12),divide(X12,X12))=divide(identity,identity)), inference(extension_rule, [i_0_34])). % 0.19/0.42 cnf(i_0_66, plain, (identity!=divide(divide(X12,X12),divide(X12,X12))), inference(closure_rule, [i_0_9])). % 0.19/0.42 cnf(i_0_65, plain, (identity=divide(identity,identity)), inference(etableau_closure_rule, [i_0_65, ...])). % 0.19/0.42 # End printing tableau % 0.19/0.42 # SZS output end % 0.19/0.42 # Branches closed with saturation will be marked with an "s" % 0.19/0.42 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.19/0.42 # We now have 8 tableaux to operate on % 0.19/0.42 # Found closed tableau during pool population. % 0.19/0.42 # Proof search is over... % 0.19/0.42 # Freeing feature tree %------------------------------------------------------------------------------