%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV486+1 : TPTP v8.1.0. Released v4.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 : 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 : Wed Jul 20 18:21:22 EDT 2022 % Result : Theorem 0.21s 0.55s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : SWV486+1 : TPTP v8.1.0. Released v4.0.0. % 0.13/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.36 % Computer : n024.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Tue Jun 14 20:11:18 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 23 Number of unprocessed: 23 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 23 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 4 conjectures. % 0.14/0.39 # There are 4 start rule candidates: % 0.14/0.39 # Found 10 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 4 start rule tableaux created. % 0.14/0.39 # 13 extension rule candidate clauses % 0.14/0.39 # 10 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 4 % 0.14/0.39 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 14 tableaux to operate on % 0.21/0.55 # Creating equality axioms % 0.21/0.55 # Ran out of tableaux, making start rules for all clauses % 0.21/0.55 # There were 1 total branch saturation attempts. % 0.21/0.55 # There were 0 of these attempts blocked. % 0.21/0.55 # There were 0 deferred branch saturation attempts. % 0.21/0.55 # There were 0 free duplicated saturations. % 0.21/0.55 # There were 1 total successful branch saturations. % 0.21/0.55 # There were 0 successful branch saturations in interreduction. % 0.21/0.55 # There were 0 successful branch saturations on the branch. % 0.21/0.55 # There were 1 successful branch saturations after the branch. % 0.21/0.55 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.55 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.55 # Begin clausification derivation % 0.21/0.55 % 0.21/0.55 # End clausification derivation % 0.21/0.55 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.55 cnf(i_0_21, negated_conjecture, (int_leq(int_one,esk2_0))). % 0.21/0.55 cnf(i_0_19, negated_conjecture, (int_leq(esk3_0,n))). % 0.21/0.55 cnf(i_0_20, negated_conjecture, (int_less(esk2_0,esk3_0))). % 0.21/0.55 cnf(i_0_7, plain, (int_less(int_zero,int_one))). % 0.21/0.55 cnf(i_0_9, plain, (plus(X1,int_zero)=X1)). % 0.21/0.55 cnf(i_0_1, plain, (int_leq(X1,X1))). % 0.21/0.55 cnf(i_0_8, plain, (plus(X1,X2)=plus(X2,X1))). % 0.21/0.55 cnf(i_0_16, plain, (real_one!=real_zero)). % 0.21/0.55 cnf(i_0_18, negated_conjecture, (a(esk2_0,esk3_0)!=real_zero)). % 0.21/0.55 cnf(i_0_5, plain, (~int_less(X1,X1))). % 0.21/0.55 cnf(i_0_15, plain, (int_leq(int_one,X1)|~int_less(int_zero,X1))). % 0.21/0.55 cnf(i_0_14, plain, (int_less(int_zero,X1)|~int_leq(int_one,X1))). % 0.21/0.55 cnf(i_0_2, plain, (int_leq(X1,X2)|~int_less(X1,X2))). % 0.21/0.55 cnf(i_0_6, plain, (int_less(X1,X2)|int_leq(X2,X1))). % 0.21/0.55 cnf(i_0_3, plain, (X1=X2|int_less(X1,X2)|~int_leq(X1,X2))). % 0.21/0.55 cnf(i_0_12, plain, (int_less(int_zero,esk1_2(X1,X2))|~int_less(X1,X2))). % 0.21/0.55 cnf(i_0_4, plain, (int_less(X1,X2)|~int_less(X3,X2)|~int_less(X1,X3))). % 0.21/0.55 cnf(i_0_11, plain, (int_less(X1,plus(X1,X2))|~int_less(int_zero,X2))). % 0.21/0.55 cnf(i_0_13, plain, (plus(X1,esk1_2(X1,X2))=X2|~int_less(X1,X2))). % 0.21/0.55 cnf(i_0_17, hypothesis, (epred1_2(X1,X2)|~int_leq(X2,n)|~int_leq(X1,n)|~int_leq(int_one,X2)|~int_leq(int_one,X1))). % 0.21/0.55 cnf(i_0_10, plain, (int_leq(plus(X1,X2),plus(X3,X4))|~int_less(X1,X3)|~int_leq(X2,X4))). % 0.21/0.55 cnf(i_0_22, plain, (a(X1,plus(X1,X2))=real_zero|~epred1_2(X3,plus(X3,X2))|~int_less(int_zero,X2)|~int_leq(int_one,X1)|~int_leq(X1,X3))). % 0.21/0.55 cnf(i_0_23, plain, (qr(plus(X1,X2),X1)=a(plus(X1,X2),X1)|~epred1_2(plus(X3,X2),X3)|~int_less(int_zero,X2)|~int_leq(int_one,X1)|~int_leq(X1,X3))). % 0.21/0.55 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.55 # Begin printing tableau % 0.21/0.55 # Found 5 steps % 0.21/0.55 cnf(i_0_20, negated_conjecture, (int_less(esk2_0,esk3_0)), inference(start_rule)). % 0.21/0.55 cnf(i_0_30, plain, (int_less(esk2_0,esk3_0)), inference(extension_rule, [i_0_4])). % 0.21/0.55 cnf(i_0_84, plain, (int_less(esk3_0,esk3_0)), inference(closure_rule, [i_0_5])). % 0.21/0.55 cnf(i_0_86, plain, (~int_less(esk3_0,esk2_0)), inference(extension_rule, [i_0_6])). % 0.21/0.55 cnf(i_0_192, plain, (int_leq(esk2_0,esk3_0)), inference(etableau_closure_rule, [i_0_192, ...])). % 0.21/0.55 # End printing tableau % 0.21/0.55 # SZS output end % 0.21/0.55 # Branches closed with saturation will be marked with an "s" % 0.21/0.55 # Child (31380) has found a proof. % 0.21/0.55 % 0.21/0.55 # Proof search is over... % 0.21/0.55 # Freeing feature tree %------------------------------------------------------------------------------