%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM836+1 : TPTP v8.1.0. Released v4.1.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 : n007.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 : Mon Jul 18 09:45:59 EDT 2022 % Result : Theorem 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM836+1 : TPTP v8.1.0. Released v4.1.0. % 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n007.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jul 5 08:04:12 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 23 Number of unprocessed: 17 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 17 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 2 conjectures. % 0.12/0.36 # There are 2 start rule candidates: % 0.12/0.36 # Found 11 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 2 start rule tableaux created. % 0.12/0.36 # 6 extension rule candidate clauses % 0.12/0.36 # 11 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.36 # Creating equality axioms % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 19 tableaux to operate on % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 1 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 1 successful branch saturations after the branch. % 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_2, negated_conjecture, (greater(vd203,vd204))). % 0.12/0.37 cnf(i_0_1, negated_conjecture, (less(vd203,vd204))). % 0.12/0.37 cnf(i_0_6, plain, (greater(vplus(X1,X2),X1))). % 0.12/0.37 cnf(i_0_4, plain, (less(X1,vplus(X1,X2)))). % 0.12/0.37 cnf(i_0_17, plain, (vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3)))). % 0.12/0.37 cnf(i_0_14, plain, (vplus(X1,X2)=vplus(X2,X1))). % 0.12/0.37 cnf(i_0_3, plain, (vd204!=vd203)). % 0.12/0.37 cnf(i_0_24, plain, (vplus(X1,v1)!=v1)). % 0.12/0.37 cnf(i_0_21, plain, (vplus(X1,v1)!=X1)). % 0.12/0.37 cnf(i_0_13, plain, (vplus(X1,X2)!=X2)). % 0.12/0.37 cnf(i_0_9, plain, (vplus(X1,X2)!=X1)). % 0.12/0.37 cnf(i_0_20, plain, (vplus(v1,vskolem2(X1))=X1|X1=v1)). % 0.12/0.37 cnf(i_0_12, plain, (X1=X2|vplus(X3,X1)!=vplus(X3,X2))). % 0.12/0.37 cnf(i_0_22, plain, (X1=X2|vplus(X1,v1)!=vplus(X2,v1))). % 0.12/0.37 cnf(i_0_5, plain, (vplus(X1,esk1_2(X2,X1))=X2|~less(X1,X2))). % 0.12/0.37 cnf(i_0_7, plain, (vplus(X1,esk2_2(X1,X2))=X2|~greater(X2,X1))). % 0.12/0.37 cnf(i_0_8, plain, (vplus(X1,esk3_2(X2,X1))=X2|vplus(X2,esk4_2(X2,X1))=X1|X2=X1)). % 0.12/0.37 cnf(i_0_84, plain, (X81=X81)). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 4 steps % 0.12/0.37 cnf(i_0_4, plain, (less(X7,vplus(X7,X6))), inference(start_rule)). % 0.12/0.37 cnf(i_0_95, plain, (less(X7,vplus(X7,X6))), inference(extension_rule, [i_0_5])). % 0.12/0.37 cnf(i_0_156, plain, (vplus(X7,esk1_2(vplus(X7,X6),X7))=vplus(X7,X6)), inference(extension_rule, [i_0_12])). % 0.12/0.37 cnf(i_0_160, plain, (esk1_2(vplus(X7,X6),X7)=X6), inference(etableau_closure_rule, [i_0_160, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Child (7796) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------