TSTP Solution File: COL121-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : COL121-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 : n027.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:24:59 EDT 2022
% Result : Unsatisfiable 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL121-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/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 : n027.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 May 31 15:58:32 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.36 # No SInE strategy applied
% 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.36 #
% 0.19/0.36 # Presaturation interreduction done
% 0.19/0.36 # Number of axioms: 10 Number of unprocessed: 10
% 0.19/0.36 # Tableaux proof search.
% 0.19/0.36 # APR header successfully linked.
% 0.19/0.36 # Hello from C++
% 0.19/0.36 # The folding up rule is enabled...
% 0.19/0.36 # Local unification is enabled...
% 0.19/0.36 # Any saturation attempts will use folding labels...
% 0.19/0.36 # 10 beginning clauses after preprocessing and clausification
% 0.19/0.36 # Creating start rules for all 6 conjectures.
% 0.19/0.36 # There are 6 start rule candidates:
% 0.19/0.36 # Found 3 unit axioms.
% 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.36 # 6 start rule tableaux created.
% 0.19/0.36 # 7 extension rule candidate clauses
% 0.19/0.36 # 3 unit axiom clauses
% 0.19/0.36
% 0.19/0.36 # Requested 8, 32 cores available to the main process.
% 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 6
% 0.19/0.36 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.36 # We now have 13 tableaux to operate on
% 0.19/0.54 # There were 1 total branch saturation attempts.
% 0.19/0.54 # There were 0 of these attempts blocked.
% 0.19/0.54 # There were 0 deferred branch saturation attempts.
% 0.19/0.54 # There were 0 free duplicated saturations.
% 0.19/0.54 # There were 1 total successful branch saturations.
% 0.19/0.54 # There were 0 successful branch saturations in interreduction.
% 0.19/0.54 # There were 0 successful branch saturations on the branch.
% 0.19/0.54 # There were 1 successful branch saturations after the branch.
% 0.19/0.54 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.54 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.54 # Begin clausification derivation
% 0.19/0.54
% 0.19/0.54 # End clausification derivation
% 0.19/0.54 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.54 cnf(i_0_15, negated_conjecture, (c_Comb_Odiamond(v_r,t_a))).
% 0.19/0.54 cnf(i_0_16, negated_conjecture, (c_in(c_Pair(v_ya,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)))).
% 0.19/0.54 cnf(i_0_17, negated_conjecture, (c_in(c_Pair(v_y,v_xaa,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)))).
% 0.19/0.54 cnf(i_0_20, negated_conjecture, (~c_in(c_Pair(v_z,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))|~c_in(c_Pair(v_xaa,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)))).
% 0.19/0.54 cnf(i_0_18, negated_conjecture, (c_in(c_Pair(v_ya,v_x(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))|~c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)))).
% 0.19/0.54 cnf(i_0_13, plain, (c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3))|~c_in(X1,X2,tc_prod(X3,X3)))).
% 0.19/0.54 cnf(i_0_19, negated_conjecture, (c_in(c_Pair(X1,v_x(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))|~c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)))).
% 0.19/0.54 cnf(i_0_14, 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.19/0.54 cnf(i_0_12, plain, (c_in(c_Pair(X1,c_Comb_Odiamond__strip__lemmaE__1(X2,X1,X3,X4),X4,X4),X2,tc_prod(X4,X4))|~c_in(c_Pair(X5,X1,X4,X4),c_Transitive__Closure_Ortrancl(X2,X4),tc_prod(X4,X4))|~c_in(c_Pair(X5,X3,X4,X4),X2,tc_prod(X4,X4))|~c_Comb_Odiamond(X2,X4))).
% 0.19/0.54 cnf(i_0_11, plain, (c_in(c_Pair(X1,c_Comb_Odiamond__strip__lemmaE__1(X2,X3,X1,X4),X4,X4),c_Transitive__Closure_Ortrancl(X2,X4),tc_prod(X4,X4))|~c_in(c_Pair(X5,X3,X4,X4),c_Transitive__Closure_Ortrancl(X2,X4),tc_prod(X4,X4))|~c_in(c_Pair(X5,X1,X4,X4),X2,tc_prod(X4,X4))|~c_Comb_Odiamond(X2,X4))).
% 0.19/0.54 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.54 # Begin printing tableau
% 0.19/0.54 # Found 5 steps
% 0.19/0.54 cnf(i_0_19, negated_conjecture, (c_in(c_Pair(v_xaa,v_x(v_xaa),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))|~c_in(c_Pair(v_y,v_xaa,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))), inference(start_rule)).
% 0.19/0.54 cnf(i_0_22, plain, (~c_in(c_Pair(v_y,v_xaa,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))), inference(closure_rule, [i_0_17])).
% 0.19/0.54 cnf(i_0_21, plain, (c_in(c_Pair(v_xaa,v_x(v_xaa),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))), inference(extension_rule, [i_0_20])).
% 0.19/0.54 cnf(i_0_47, plain, (~c_in(c_Pair(v_z,v_x(v_xaa),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))), inference(extension_rule, [i_0_13])).
% 0.19/0.54 cnf(i_0_50, plain, (~c_in(c_Pair(v_z,v_x(v_xaa),t_a,t_a),v_r,tc_prod(t_a,t_a))), inference(etableau_closure_rule, [i_0_50, ...])).
% 0.19/0.54 # End printing tableau
% 0.19/0.54 # SZS output end
% 0.19/0.54 # Branches closed with saturation will be marked with an "s"
% 0.19/0.54 # Child (30688) has found a proof.
% 0.19/0.54
% 0.19/0.54 # Proof search is over...
% 0.19/0.54 # Freeing feature tree
%------------------------------------------------------------------------------