%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : HEN005-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 : n023.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:22 EDT 2022 % Result : Unsatisfiable 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : HEN005-2 : TPTP v8.1.0. Released v1.0.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n023.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Fri Jul 1 13:43:29 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S % 0.13/0.36 # and selection function SelectNewComplexAHP. % 0.13/0.36 # % 0.13/0.36 # Number of axioms: 16 Number of unprocessed: 16 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 16 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 10 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 6 extension rule candidate clauses % 0.13/0.37 # 10 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # Creating equality axioms % 0.13/0.37 # Ran out of tableaux, making start rules for all clauses % 0.13/0.37 # Returning from population with 20 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 20 tableaux to operate on % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 1 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 1 successful branch saturations after the branch. % 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_30, hypothesis, (less_equal(x,y))). % 0.13/0.37 cnf(i_0_31, hypothesis, (less_equal(y,z))). % 0.13/0.37 cnf(i_0_23, plain, (less_equal(X1,identity))). % 0.13/0.37 cnf(i_0_21, plain, (less_equal(zero,X1))). % 0.13/0.37 cnf(i_0_32, negated_conjecture, (~less_equal(x,z))). % 0.13/0.37 cnf(i_0_22, plain, (X1=X2|~less_equal(X2,X1)|~less_equal(X1,X2))). % 0.13/0.37 cnf(i_0_26, plain, (quotient(X1,identity,zero))). % 0.13/0.37 cnf(i_0_27, plain, (quotient(zero,X1,zero))). % 0.13/0.37 cnf(i_0_28, plain, (quotient(X1,X1,zero))). % 0.13/0.37 cnf(i_0_29, plain, (quotient(X1,zero,X1))). % 0.13/0.37 cnf(i_0_17, plain, (quotient(X1,X2,zero)|~less_equal(X1,X2))). % 0.13/0.37 cnf(i_0_24, plain, (quotient(X1,X2,divide(X1,X2)))). % 0.13/0.37 cnf(i_0_18, plain, (less_equal(X1,X2)|~quotient(X1,X2,zero))). % 0.13/0.37 cnf(i_0_19, plain, (less_equal(X3,X1)|~quotient(X1,X2,X3))). % 0.13/0.37 cnf(i_0_25, plain, (X3=X4|~quotient(X1,X2,X4)|~quotient(X1,X2,X3))). % 0.13/0.37 cnf(i_0_20, plain, (less_equal(X7,X8)|~quotient(X6,X5,X7)|~quotient(X3,X4,X8)|~quotient(X2,X4,X5)|~quotient(X1,X4,X6)|~quotient(X1,X2,X3))). % 0.13/0.37 cnf(i_0_106, plain, (X9=X9)). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 7 steps % 0.13/0.37 cnf(i_0_30, hypothesis, (less_equal(x,y)), inference(start_rule)). % 0.13/0.37 cnf(i_0_113, plain, (less_equal(x,y)), inference(extension_rule, [i_0_110])). % 0.13/0.37 cnf(i_0_167, plain, (less_equal(x,z)), inference(closure_rule, [i_0_32])). % 0.13/0.37 cnf(i_0_168, plain, ($false), inference(closure_rule, [i_0_106])). % 0.13/0.37 cnf(i_0_169, plain, (y!=z), inference(extension_rule, [i_0_22])). % 0.13/0.37 cnf(i_0_181, plain, (~less_equal(y,z)), inference(closure_rule, [i_0_31])). % 0.13/0.37 cnf(i_0_180, plain, (~less_equal(z,y)), inference(etableau_closure_rule, [i_0_180, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Child (30612) has found a proof. % 0.13/0.37 % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------