%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV005-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 : 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 : Wed Jul 20 18:18:53 EDT 2022 % Result : Unsatisfiable 0.12s 0.36s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : SWV005-1 : TPTP v8.1.0. Released v1.0.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 : 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 : Thu Jun 16 06:17:24 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: 19 Number of unprocessed: 19 % 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 # 19 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 9 conjectures. % 0.12/0.36 # There are 9 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 # 9 start rule tableaux created. % 0.12/0.36 # 8 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 were 2 total branch saturation attempts. % 0.12/0.36 # There were 0 of these attempts blocked. % 0.12/0.36 # There were 0 deferred branch saturation attempts. % 0.12/0.36 # There were 0 free duplicated saturations. % 0.12/0.36 # There were 2 total successful branch saturations. % 0.12/0.36 # There were 1 successful branch saturations in interreduction. % 0.12/0.36 # There were 0 successful branch saturations on the branch. % 0.12/0.36 # There were 1 successful branch saturations after the branch. % 0.12/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.36 # Begin clausification derivation % 0.12/0.36 % 0.12/0.36 # End clausification derivation % 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.36 cnf(i_0_37, negated_conjecture, (less_than(l,n))). % 0.12/0.36 cnf(i_0_38, negated_conjecture, (less_than(one,l))). % 0.12/0.36 cnf(i_0_23, plain, (successor(predecessor(X1))=X1)). % 0.12/0.36 cnf(i_0_22, plain, (predecessor(successor(X1))=X1)). % 0.12/0.36 cnf(i_0_27, plain, (less_than(X1,successor(X1)))). % 0.12/0.36 cnf(i_0_39, negated_conjecture, (less_than(a(k),a(predecessor(l))))). % 0.12/0.36 cnf(i_0_26, plain, (less_than(predecessor(X1),X1))). % 0.12/0.36 cnf(i_0_34, negated_conjecture, (~less_than(n,k))). % 0.12/0.36 cnf(i_0_35, negated_conjecture, (~less_than(k,l))). % 0.12/0.36 cnf(i_0_36, negated_conjecture, (~less_than(k,i))). % 0.12/0.36 cnf(i_0_30, plain, (~less_than(X1,X1))). % 0.12/0.36 cnf(i_0_31, plain, (~less_than(X1,X2)|~less_than(X2,X1))). % 0.12/0.36 cnf(i_0_25, plain, (X1=X2|successor(X1)!=successor(X2))). % 0.12/0.36 cnf(i_0_24, plain, (X1=X2|predecessor(X1)!=predecessor(X2))). % 0.12/0.36 cnf(i_0_40, negated_conjecture, (less_than(X1,l)|~less_than(a(X1),a(k))|~less_than(X1,successor(n)))). % 0.12/0.36 cnf(i_0_42, negated_conjecture, (~less_than(a(X1),a(predecessor(X1)))|~less_than(X1,l)|~less_than(one,X1))). % 0.12/0.36 cnf(i_0_29, plain, (X1=X2|less_than(X1,X2)|less_than(X2,X1))). % 0.12/0.36 cnf(i_0_41, negated_conjecture, (less_than(n,X1)|less_than(X1,l)|~less_than(a(X1),a(predecessor(l))))). % 0.12/0.36 cnf(i_0_28, plain, (less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3))). % 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.36 # Begin printing tableau % 0.12/0.36 # Found 6 steps % 0.12/0.36 cnf(i_0_35, negated_conjecture, (~less_than(k,l)), inference(start_rule)). % 0.12/0.36 cnf(i_0_53, plain, (~less_than(k,l)), inference(extension_rule, [i_0_28])). % 0.12/0.36 cnf(i_0_95, plain, (~less_than(predecessor(l),l)), inference(closure_rule, [i_0_26])). % 0.12/0.36 cnf(i_0_96, plain, (~less_than(k,predecessor(l))), inference(extension_rule, [i_0_29])). % 0.12/0.36 cnf(i_0_112, plain, (predecessor(l)=k), inference(etableau_closure_rule, [i_0_112, ...])). % 0.12/0.36 cnf(i_0_114, plain, (less_than(predecessor(l),k)), inference(etableau_closure_rule, [i_0_114, ...])). % 0.12/0.36 # End printing tableau % 0.12/0.36 # SZS output end % 0.12/0.36 # Branches closed with saturation will be marked with an "s" % 0.12/0.36 # There were 1 total branch saturation attempts. % 0.12/0.36 # There were 0 of these attempts blocked. % 0.12/0.36 # There were 0 deferred branch saturation attempts. % 0.12/0.36 # There were 0 free duplicated saturations. % 0.12/0.36 # There were 1 total successful branch saturations. % 0.12/0.36 # There were 0 successful branch saturations in interreduction. % 0.12/0.36 # There were 0 successful branch saturations on the branch. % 0.12/0.36 # There were 1 successful branch saturations after the branch. % 0.12/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.36 # Begin clausification derivation % 0.12/0.36 % 0.12/0.36 # End clausification derivation % 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.36 cnf(i_0_37, negated_conjecture, (less_than(l,n))). % 0.12/0.36 cnf(i_0_38, negated_conjecture, (less_than(one,l))). % 0.12/0.36 cnf(i_0_23, plain, (successor(predecessor(X1))=X1)). % 0.12/0.36 cnf(i_0_22, plain, (predecessor(successor(X1))=X1)). % 0.12/0.36 cnf(i_0_27, plain, (less_than(X1,successor(X1)))). % 0.12/0.36 cnf(i_0_39, negated_conjecture, (less_than(a(k),a(predecessor(l))))). % 0.12/0.36 cnf(i_0_26, plain, (less_than(predecessor(X1),X1))). % 0.12/0.36 cnf(i_0_34, negated_conjecture, (~less_than(n,k))). % 0.12/0.36 cnf(i_0_35, negated_conjecture, (~less_than(k,l))). % 0.12/0.36 cnf(i_0_36, negated_conjecture, (~less_than(k,i))). % 0.12/0.36 cnf(i_0_30, plain, (~less_than(X1,X1))). % 0.12/0.36 cnf(i_0_31, plain, (~less_than(X1,X2)|~less_than(X2,X1))). % 0.12/0.36 cnf(i_0_25, plain, (X1=X2|successor(X1)!=successor(X2))). % 0.12/0.36 cnf(i_0_24, plain, (X1=X2|predecessor(X1)!=predecessor(X2))). % 0.12/0.36 cnf(i_0_40, negated_conjecture, (less_than(X1,l)|~less_than(a(X1),a(k))|~less_than(X1,successor(n)))). % 0.12/0.36 cnf(i_0_42, negated_conjecture, (~less_than(a(X1),a(predecessor(X1)))|~less_than(X1,l)|~less_than(one,X1))). % 0.12/0.36 cnf(i_0_29, plain, (X1=X2|less_than(X1,X2)|less_than(X2,X1))). % 0.12/0.36 cnf(i_0_41, negated_conjecture, (less_than(n,X1)|less_than(X1,l)|~less_than(a(X1),a(predecessor(l))))). % 0.12/0.36 cnf(i_0_28, plain, (less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3))). % 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.36 # Begin printing tableau % 0.12/0.36 # Found 5 steps % 0.12/0.36 cnf(i_0_39, negated_conjecture, (less_than(a(k),a(predecessor(l)))), inference(start_rule)). % 0.12/0.36 cnf(i_0_55, plain, (less_than(a(k),a(predecessor(l)))), inference(extension_rule, [i_0_31])). % 0.12/0.36 cnf(i_0_59, plain, (~less_than(a(predecessor(l)),a(k))), inference(extension_rule, [i_0_28])). % 0.12/0.36 cnf(i_0_68, plain, (~less_than(predecessor(a(k)),a(k))), inference(closure_rule, [i_0_26])). % 0.12/0.36 cnf(i_0_69, plain, (~less_than(a(predecessor(l)),predecessor(a(k)))), inference(etableau_closure_rule, [i_0_69, ...])). % 0.12/0.36 # End printing tableau % 0.12/0.36 # SZS output end % 0.12/0.36 # Branches closed with saturation will be marked with an "s" % 0.12/0.36 # There were 2 total branch saturation attempts. % 0.12/0.36 # There were 0 of these attempts blocked. % 0.12/0.36 # There were 0 deferred branch saturation attempts. % 0.12/0.36 # There were 0 free duplicated saturations. % 0.12/0.36 # There were 2 total successful branch saturations. % 0.12/0.36 # There were 0 successful branch saturations in interreduction. % 0.12/0.36 # There were 0 successful branch saturations on the branch. % 0.12/0.36 # There were 2 successful branch saturations after the branch. % 0.12/0.36 # Child (30358) has found a proof. % 0.12/0.36 % 0.12/0.36 # Proof search is over... % 0.12/0.36 # Freeing feature tree %------------------------------------------------------------------------------