%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV006-1 : 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 : n021.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:18:53 EDT 2022 % Result : Unsatisfiable 0.20s 0.37s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SWV006-1 : TPTP v8.1.0. Released v1.0.0. % 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n021.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Tue Jun 14 19:28:28 EDT 2022 % 0.12/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 18 Number of unprocessed: 18 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 18 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 8 conjectures. % 0.20/0.37 # There are 8 start rule candidates: % 0.20/0.37 # Found 10 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 8 start rule tableaux created. % 0.20/0.37 # 8 extension rule candidate clauses % 0.20/0.37 # 10 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done. % 0.20/0.37 # There were 0 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 0 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 0 successful branch saturations after the branch. % 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_35, negated_conjecture, (less_than(i,n))). % 0.20/0.37 cnf(i_0_34, negated_conjecture, (less_than(i,m))). % 0.20/0.37 cnf(i_0_37, negated_conjecture, (less_than(a(i),a(m)))). % 0.20/0.37 cnf(i_0_22, plain, (successor(predecessor(X1))=X1)). % 0.20/0.37 cnf(i_0_21, plain, (predecessor(successor(X1))=X1)). % 0.20/0.37 cnf(i_0_26, plain, (less_than(X1,successor(X1)))). % 0.20/0.37 cnf(i_0_25, plain, (less_than(predecessor(X1),X1))). % 0.20/0.37 cnf(i_0_33, negated_conjecture, (~less_than(n,m))). % 0.20/0.37 cnf(i_0_36, negated_conjecture, (~less_than(i,one))). % 0.20/0.37 cnf(i_0_29, plain, (~less_than(X1,X1))). % 0.20/0.37 cnf(i_0_30, plain, (~less_than(X1,X2)|~less_than(X2,X1))). % 0.20/0.37 cnf(i_0_24, plain, (X1=X2|successor(X1)!=successor(X2))). % 0.20/0.37 cnf(i_0_23, plain, (X1=X2|predecessor(X1)!=predecessor(X2))). % 0.20/0.37 cnf(i_0_38, negated_conjecture, (less_than(X1,i)|~less_than(a(X1),a(m))|~less_than(X1,successor(n)))). % 0.20/0.37 cnf(i_0_40, negated_conjecture, (~less_than(a(X1),a(predecessor(X1)))|~less_than(X1,i)|~less_than(one,X1))). % 0.20/0.37 cnf(i_0_39, negated_conjecture, (less_than(n,X1)|less_than(X1,i)|~less_than(a(X1),a(predecessor(i)))|~less_than(one,i))). % 0.20/0.37 cnf(i_0_28, plain, (X1=X2|less_than(X1,X2)|less_than(X2,X1))). % 0.20/0.37 cnf(i_0_27, plain, (less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3))). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 6 steps % 0.20/0.37 cnf(i_0_38, negated_conjecture, (less_than(i,i)|~less_than(a(i),a(m))|~less_than(i,successor(n))), inference(start_rule)). % 0.20/0.37 cnf(i_0_48, plain, (less_than(i,i)), inference(closure_rule, [i_0_29])). % 0.20/0.37 cnf(i_0_49, plain, (~less_than(a(i),a(m))), inference(closure_rule, [i_0_37])). % 0.20/0.37 cnf(i_0_50, plain, (~less_than(i,successor(n))), inference(extension_rule, [i_0_27])). % 0.20/0.37 cnf(i_0_94, plain, (~less_than(n,successor(n))), inference(closure_rule, [i_0_26])). % 0.20/0.37 cnf(i_0_95, plain, (~less_than(i,n)), inference(closure_rule, [i_0_35])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # Child (2701) has found a proof. % 0.20/0.37 % 0.20/0.37 # Proof search is over... % 0.20/0.37 # Freeing feature tree %------------------------------------------------------------------------------