%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LDA007-2 : TPTP v8.1.0. Bugfixed v2.6.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 : n019.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 : Sun Jul 17 16:43:30 EDT 2022 % Result : Unsatisfiable 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : LDA007-2 : TPTP v8.1.0. Bugfixed v2.6.0. % 0.11/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 : n019.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 : Mon May 30 04:28:25 EDT 2022 % 0.12/0.34 % 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: 20 Number of unprocessed: 20 % 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.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 20 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 15 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 5 extension rule candidate clauses % 0.12/0.37 # 15 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.37 # Creating equality axioms % 0.12/0.37 # Ran out of tableaux, making start rules for all clauses % 0.12/0.37 # Returning from population with 29 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 29 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 Unsatisfiable 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_34, plain, (critical_point(t)=k)). % 0.12/0.37 cnf(i_0_30, plain, (f(t,t)=tt)). % 0.12/0.37 cnf(i_0_36, plain, (f(t,k)=tk)). % 0.12/0.37 cnf(i_0_31, plain, (f(s,t)=st)). % 0.12/0.37 cnf(i_0_32, plain, (f(t,s)=ts)). % 0.12/0.37 cnf(i_0_33, plain, (f(tt,ts)=tt_ts)). % 0.12/0.37 cnf(i_0_35, plain, (f(s,k)=sk)). % 0.12/0.37 cnf(i_0_37, plain, (f(st,k)=stk)). % 0.12/0.37 cnf(i_0_38, plain, (f(ts,k)=tsk)). % 0.12/0.37 cnf(i_0_39, plain, (f(tt,k)=ttk)). % 0.12/0.37 cnf(i_0_23, plain, (a(X1,critical_point(X2))=critical_point(f(X1,X2)))). % 0.12/0.37 cnf(i_0_21, plain, (f(f(X1,X2),f(X1,X3))=f(X1,f(X2,X3)))). % 0.12/0.37 cnf(i_0_22, plain, (a(f(X1,X2),a(X1,X3))=a(X1,a(X2,X3)))). % 0.12/0.37 cnf(i_0_40, negated_conjecture, (f(tt_ts,tk)!=f(t,tsk))). % 0.12/0.37 cnf(i_0_24, plain, (~less(X1,X1))). % 0.12/0.37 cnf(i_0_27, plain, (a(X1,X2)=X2|~less(X2,critical_point(X1)))). % 0.12/0.37 cnf(i_0_29, plain, (a(f(X1,X2),X3)=X3|a(X2,X3)!=X3)). % 0.12/0.37 cnf(i_0_26, plain, (a(X1,X2)=X2|less(X2,a(X1,X2)))). % 0.12/0.37 cnf(i_0_25, plain, (less(a(X1,X2),a(X1,X3))|~less(X2,X3))). % 0.12/0.37 cnf(i_0_28, plain, (less(X1,a(X2,X1))|less(X1,critical_point(X2)))). % 0.12/0.37 cnf(i_0_52, plain, (X4=X4)). % 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 6 steps % 0.12/0.37 cnf(i_0_34, plain, (critical_point(t)=k), inference(start_rule)). % 0.12/0.37 cnf(i_0_60, plain, (critical_point(t)=k), inference(extension_rule, [i_0_59])). % 0.12/0.37 cnf(i_0_111, plain, (less(k,k)), inference(closure_rule, [i_0_24])). % 0.12/0.37 cnf(i_0_112, plain, ($false), inference(closure_rule, [i_0_52])). % 0.12/0.37 cnf(i_0_114, plain, (~less(k,critical_point(t))), inference(extension_rule, [i_0_28])). % 0.12/0.37 cnf(i_0_123, plain, (less(k,a(t,k))), inference(etableau_closure_rule, [i_0_123, ...])). % 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 # 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 Unsatisfiable 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_34, plain, (critical_point(t)=k)). % 0.12/0.37 cnf(i_0_30, plain, (f(t,t)=tt)). % 0.12/0.37 cnf(i_0_36, plain, (f(t,k)=tk)). % 0.12/0.37 cnf(i_0_31, plain, (f(s,t)=st)). % 0.12/0.37 cnf(i_0_32, plain, (f(t,s)=ts)). % 0.12/0.37 cnf(i_0_33, plain, (f(tt,ts)=tt_ts)). % 0.12/0.37 cnf(i_0_35, plain, (f(s,k)=sk)). % 0.12/0.37 cnf(i_0_37, plain, (f(st,k)=stk)). % 0.12/0.37 cnf(i_0_38, plain, (f(ts,k)=tsk)). % 0.12/0.37 cnf(i_0_39, plain, (f(tt,k)=ttk)). % 0.12/0.37 cnf(i_0_23, plain, (a(X1,critical_point(X2))=critical_point(f(X1,X2)))). % 0.12/0.37 cnf(i_0_21, plain, (f(f(X1,X2),f(X1,X3))=f(X1,f(X2,X3)))). % 0.12/0.37 cnf(i_0_22, plain, (a(f(X1,X2),a(X1,X3))=a(X1,a(X2,X3)))). % 0.12/0.37 cnf(i_0_40, negated_conjecture, (f(tt_ts,tk)!=f(t,tsk))). % 0.12/0.37 cnf(i_0_24, plain, (~less(X1,X1))). % 0.12/0.37 cnf(i_0_27, plain, (a(X1,X2)=X2|~less(X2,critical_point(X1)))). % 0.12/0.37 cnf(i_0_29, plain, (a(f(X1,X2),X3)=X3|a(X2,X3)!=X3)). % 0.12/0.37 cnf(i_0_26, plain, (a(X1,X2)=X2|less(X2,a(X1,X2)))). % 0.12/0.37 cnf(i_0_25, plain, (less(a(X1,X2),a(X1,X3))|~less(X2,X3))). % 0.12/0.37 cnf(i_0_28, plain, (less(X1,a(X2,X1))|less(X1,critical_point(X2)))). % 0.12/0.37 cnf(i_0_52, plain, (X4=X4)). % 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 6 steps % 0.12/0.37 cnf(i_0_34, plain, (critical_point(t)=k), inference(start_rule)). % 0.12/0.37 cnf(i_0_60, plain, (critical_point(t)=k), inference(extension_rule, [i_0_59])). % 0.12/0.37 cnf(i_0_111, plain, (less(k,k)), inference(closure_rule, [i_0_24])). % 0.12/0.37 cnf(i_0_113, plain, (critical_point(t)!=k), inference(closure_rule, [i_0_34])). % 0.12/0.37 cnf(i_0_114, plain, (~less(critical_point(t),critical_point(t))), inference(extension_rule, [i_0_28])). % 0.12/0.37 cnf(i_0_123, plain, (less(critical_point(t),a(t,critical_point(t)))), inference(etableau_closure_rule, [i_0_123, ...])). % 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 (12362) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------