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