%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : HEN007-2 : TPTP v8.1.0. Released v1.0.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 : n004.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 12:52:26 EDT 2022 % Result : Unsatisfiable 0.21s 0.40s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : HEN007-2 : TPTP v8.1.0. Released v1.0.0. % 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.35 % Computer : n004.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Fri Jul 1 13:21:38 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.38 # No SInE strategy applied % 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.38 # % 0.14/0.38 # Presaturation interreduction done % 0.14/0.38 # Number of axioms: 19 Number of unprocessed: 19 % 0.14/0.38 # Tableaux proof search. % 0.14/0.38 # APR header successfully linked. % 0.14/0.38 # Hello from C++ % 0.21/0.40 # The folding up rule is enabled... % 0.21/0.40 # Local unification is enabled... % 0.21/0.40 # Any saturation attempts will use folding labels... % 0.21/0.40 # 19 beginning clauses after preprocessing and clausification % 0.21/0.40 # Creating start rules for all 1 conjectures. % 0.21/0.40 # There are 1 start rule candidates: % 0.21/0.40 # Found 11 unit axioms. % 0.21/0.40 # 1 start rule tableaux created. % 0.21/0.40 # 8 extension rule candidate clauses % 0.21/0.40 # 11 unit axiom clauses % 0.21/0.40 % 0.21/0.40 # Requested 8, 32 cores available to the main process. % 0.21/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.21/0.40 # There were 1 total branch saturation attempts. % 0.21/0.40 # There were 0 of these attempts blocked. % 0.21/0.40 # There were 0 deferred branch saturation attempts. % 0.21/0.40 # There were 0 free duplicated saturations. % 0.21/0.40 # There were 1 total successful branch saturations. % 0.21/0.40 # There were 0 successful branch saturations in interreduction. % 0.21/0.40 # There were 0 successful branch saturations on the branch. % 0.21/0.40 # There were 1 successful branch saturations after the branch. % 0.21/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.40 # Begin clausification derivation % 0.21/0.40 % 0.21/0.40 # End clausification derivation % 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.40 cnf(i_0_35, hypothesis, (less_equal(x,y))). % 0.21/0.40 cnf(i_0_26, plain, (less_equal(X1,identity))). % 0.21/0.40 cnf(i_0_24, plain, (less_equal(zero,X1))). % 0.21/0.40 cnf(i_0_37, hypothesis, (quotient(z,x,zQx))). % 0.21/0.40 cnf(i_0_36, hypothesis, (quotient(z,y,zQy))). % 0.21/0.40 cnf(i_0_31, plain, (quotient(X1,X1,zero))). % 0.21/0.40 cnf(i_0_32, plain, (quotient(X1,zero,X1))). % 0.21/0.40 cnf(i_0_29, plain, (quotient(X1,identity,zero))). % 0.21/0.40 cnf(i_0_30, plain, (quotient(zero,X1,zero))). % 0.21/0.40 cnf(i_0_27, plain, (quotient(X1,X2,divide(X1,X2)))). % 0.21/0.40 cnf(i_0_38, negated_conjecture, (~less_equal(zQy,zQx))). % 0.21/0.40 cnf(i_0_25, plain, (X1=X2|~less_equal(X2,X1)|~less_equal(X1,X2))). % 0.21/0.40 cnf(i_0_20, plain, (quotient(X1,X2,zero)|~less_equal(X1,X2))). % 0.21/0.40 cnf(i_0_21, plain, (less_equal(X1,X2)|~quotient(X1,X2,zero))). % 0.21/0.40 cnf(i_0_22, plain, (less_equal(X1,X2)|~quotient(X2,X3,X1))). % 0.21/0.40 cnf(i_0_33, plain, (less_equal(X1,X2)|~less_equal(X3,X2)|~less_equal(X1,X3))). % 0.21/0.40 cnf(i_0_28, plain, (X1=X2|~quotient(X3,X4,X2)|~quotient(X3,X4,X1))). % 0.21/0.40 cnf(i_0_34, plain, (less_equal(X1,X2)|~quotient(X3,X4,X1)|~quotient(X3,X2,X5)|~less_equal(X5,X4))). % 0.21/0.40 cnf(i_0_23, plain, (less_equal(X1,X2)|~quotient(X3,X4,X1)|~quotient(X5,X6,X2)|~quotient(X7,X6,X4)|~quotient(X8,X6,X3)|~quotient(X8,X7,X5))). % 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.40 # Begin printing tableau % 0.21/0.40 # Found 6 steps % 0.21/0.40 cnf(i_0_38, negated_conjecture, (~less_equal(zQy,zQx)), inference(start_rule)). % 0.21/0.40 cnf(i_0_39, plain, (~less_equal(zQy,zQx)), inference(extension_rule, [i_0_34])). % 0.21/0.40 cnf(i_0_56, plain, (~quotient(z,y,zQy)), inference(closure_rule, [i_0_36])). % 0.21/0.40 cnf(i_0_57, plain, (~quotient(z,zQx,divide(z,zQx))), inference(closure_rule, [i_0_27])). % 0.21/0.40 cnf(i_0_58, plain, (~less_equal(divide(z,zQx),y)), inference(extension_rule, [i_0_21])). % 0.21/0.40 cnf(i_0_121, plain, (~quotient(divide(z,zQx),y,zero)), inference(etableau_closure_rule, [i_0_121, ...])). % 0.21/0.41 # End printing tableau % 0.21/0.41 # SZS output end % 0.21/0.41 # Branches closed with saturation will be marked with an "s" % 0.21/0.41 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.21/0.41 # We now have 4 tableaux to operate on % 0.21/0.41 # Found closed tableau during pool population. % 0.21/0.41 # Proof search is over... % 0.21/0.41 # Freeing feature tree %------------------------------------------------------------------------------