%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL123-2 : TPTP v8.1.0. Released v3.2.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 : Fri Jul 15 00:25:00 EDT 2022 % Result : Unsatisfiable 0.14s 0.39s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : COL123-2 : TPTP v8.1.0. Released v3.2.0. % 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.35 % Computer : n019.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Tue May 31 09:56:40 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.38 # No SInE strategy applied % 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.38 # % 0.14/0.38 # Presaturation interreduction done % 0.14/0.38 # Number of axioms: 9 Number of unprocessed: 9 % 0.14/0.38 # Tableaux proof search. % 0.14/0.38 # APR header successfully linked. % 0.14/0.38 # Hello from C++ % 0.14/0.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 9 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 7 conjectures. % 0.14/0.38 # There are 7 start rule candidates: % 0.14/0.38 # Found 2 unit axioms. % 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.38 # 7 start rule tableaux created. % 0.14/0.38 # 7 extension rule candidate clauses % 0.14/0.38 # 2 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 7 % 0.14/0.38 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.14/0.38 # We now have 15 tableaux to operate on % 0.14/0.39 # There were 1 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 1 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 1 successful branch saturations after the branch. % 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_12, negated_conjecture, (c_in(c_Pair(v_y,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)))). % 0.14/0.39 cnf(i_0_13, negated_conjecture, (c_in(c_Pair(v_x,v_xb,t_a,t_a),v_r,tc_prod(t_a,t_a)))). % 0.14/0.39 cnf(i_0_16, negated_conjecture, (~c_in(c_Pair(v_xb,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))|~c_in(c_Pair(v_z,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)))). % 0.14/0.39 cnf(i_0_15, negated_conjecture, (c_in(c_Pair(v_y,v_xaa(X1),t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)))). % 0.14/0.39 cnf(i_0_14, negated_conjecture, (c_in(c_Pair(X1,v_xaa(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))|~c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)))). % 0.14/0.39 cnf(i_0_10, plain, (c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3))|~c_in(X1,X2,tc_prod(X3,X3)))). % 0.14/0.39 cnf(i_0_18, negated_conjecture, (c_in(c_Pair(X1,v_xa(X2,X3,X1),t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)))). % 0.14/0.39 cnf(i_0_17, negated_conjecture, (c_in(c_Pair(X1,v_xa(X2,X1,X3),t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)))). % 0.14/0.39 cnf(i_0_11, plain, (c_in(c_Pair(X1,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))|~c_in(c_Pair(X1,X5,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))|~c_in(c_Pair(X5,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3)))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 5 steps % 0.14/0.39 cnf(i_0_14, negated_conjecture, (c_in(c_Pair(v_xb,v_xaa(v_xb),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))|~c_in(c_Pair(v_x,v_xb,t_a,t_a),v_r,tc_prod(t_a,t_a))), inference(start_rule)). % 0.14/0.39 cnf(i_0_26, plain, (~c_in(c_Pair(v_x,v_xb,t_a,t_a),v_r,tc_prod(t_a,t_a))), inference(closure_rule, [i_0_13])). % 0.14/0.39 cnf(i_0_25, plain, (c_in(c_Pair(v_xb,v_xaa(v_xb),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))), inference(extension_rule, [i_0_10])). % 0.14/0.39 cnf(i_0_67, plain, (c_in(c_Pair(v_xb,v_xaa(v_xb),t_a,t_a),c_Transitive__Closure_Ortrancl(c_Transitive__Closure_Ortrancl(v_r,t_a),t_a),tc_prod(t_a,t_a))), inference(extension_rule, [i_0_10])). % 0.14/0.39 cnf(i_0_232, plain, (c_in(c_Pair(v_xb,v_xaa(v_xb),t_a,t_a),c_Transitive__Closure_Ortrancl(c_Transitive__Closure_Ortrancl(c_Transitive__Closure_Ortrancl(v_r,t_a),t_a),t_a),tc_prod(t_a,t_a))), inference(etableau_closure_rule, [i_0_232, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # Child (28357) has found a proof. % 0.14/0.39 % 0.14/0.39 # Proof search is over... % 0.14/0.39 # Freeing feature tree %------------------------------------------------------------------------------