%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP080-1 : TPTP v8.1.0. Bugfixed v2.3.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 : n024.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:19 EDT 2022 % Result : Unsatisfiable 1.16s 1.34s % Output : CNFRefutation 1.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : GRP080-1 : TPTP v8.1.0. Bugfixed v2.3.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.14/0.34 % Computer : n024.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Mon Jun 13 11:57:18 EDT 2022 % 0.14/0.34 % CPUTime : % 0.21/0.37 # No SInE strategy applied % 0.21/0.37 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S % 0.21/0.37 # and selection function SelectNewComplexAHP. % 0.21/0.37 # % 0.21/0.37 # Number of axioms: 3 Number of unprocessed: 3 % 0.21/0.37 # Tableaux proof search. % 0.21/0.37 # APR header successfully linked. % 0.21/0.37 # Hello from C++ % 1.10/1.27 # The folding up rule is enabled... % 1.10/1.27 # Local unification is enabled... % 1.10/1.27 # Any saturation attempts will use folding labels... % 1.10/1.27 # 3 beginning clauses after preprocessing and clausification % 1.10/1.27 # Creating start rules for all 1 conjectures. % 1.10/1.27 # There are 1 start rule candidates: % 1.10/1.27 # Found 2 unit axioms. % 1.10/1.27 # 1 start rule tableaux created. % 1.10/1.27 # 1 extension rule candidate clauses % 1.10/1.27 # 2 unit axiom clauses % 1.10/1.27 % 1.10/1.27 # Requested 8, 32 cores available to the main process. % 1.10/1.27 # There are not enough tableaux to fork, creating more from the initial 1 % 1.10/1.27 # Creating equality axioms % 1.10/1.27 # Ran out of tableaux, making start rules for all clauses % 1.16/1.34 # There were 1 total branch saturation attempts. % 1.16/1.34 # There were 0 of these attempts blocked. % 1.16/1.34 # There were 0 deferred branch saturation attempts. % 1.16/1.34 # There were 0 free duplicated saturations. % 1.16/1.34 # There were 1 total successful branch saturations. % 1.16/1.34 # There were 0 successful branch saturations in interreduction. % 1.16/1.34 # There were 0 successful branch saturations on the branch. % 1.16/1.34 # There were 1 successful branch saturations after the branch. % 1.16/1.34 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.16/1.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.16/1.34 # Begin clausification derivation % 1.16/1.34 % 1.16/1.34 # End clausification derivation % 1.16/1.34 # Begin listing active clauses obtained from FOF to CNF conversion % 1.16/1.34 cnf(i_0_9, plain, (double_divide(X1,double_divide(X1,identity))=identity)). % 1.16/1.34 cnf(i_0_6, plain, (double_divide(double_divide(identity,double_divide(X1,double_divide(X2,identity))),double_divide(double_divide(X2,double_divide(X3,X1)),identity))=X3)). % 1.16/1.34 cnf(i_0_10, negated_conjecture, (double_divide(double_divide(a2,identity),identity)!=a2|double_divide(double_divide(a1,double_divide(a1,identity)),identity)!=identity|double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity)!=double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity))). % 1.16/1.34 cnf(i_0_23, plain, (X4=X4)). % 1.16/1.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.16/1.34 # Begin printing tableau % 1.16/1.34 # Found 6 steps % 1.16/1.34 cnf(i_0_9, plain, (double_divide(X8,double_divide(X8,identity))=identity), inference(start_rule)). % 1.16/1.34 cnf(i_0_28, plain, (double_divide(X8,double_divide(X8,identity))=identity), inference(extension_rule, [i_0_27])). % 1.16/1.34 cnf(i_0_45, plain, (double_divide(X9,double_divide(X9,identity))!=identity), inference(closure_rule, [i_0_9])). % 1.16/1.34 cnf(i_0_44, plain, (double_divide(double_divide(X9,double_divide(X9,identity)),double_divide(X8,double_divide(X8,identity)))=double_divide(identity,identity)), inference(extension_rule, [i_0_26])). % 1.16/1.34 cnf(i_0_56, plain, (double_divide(identity,identity)!=double_divide(double_divide(identity,double_divide(X1,double_divide(X2,identity))),double_divide(double_divide(X2,double_divide(double_divide(identity,identity),X1)),identity))), inference(closure_rule, [i_0_6])). % 1.16/1.34 cnf(i_0_54, plain, (double_divide(double_divide(X9,double_divide(X9,identity)),double_divide(X8,double_divide(X8,identity)))=double_divide(double_divide(identity,double_divide(X1,double_divide(X2,identity))),double_divide(double_divide(X2,double_divide(double_divide(identity,identity),X1)),identity))), inference(etableau_closure_rule, [i_0_54, ...])). % 1.16/1.34 # End printing tableau % 1.16/1.34 # SZS output end % 1.16/1.34 # Branches closed with saturation will be marked with an "s" % 1.16/1.34 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 1.16/1.34 # We now have 8 tableaux to operate on % 1.16/1.34 # Found closed tableau during pool population. % 1.16/1.34 # Proof search is over... % 1.16/1.34 # Freeing feature tree %------------------------------------------------------------------------------