TSTP Solution File: LAT276-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LAT276-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 : n008.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 04:50:01 EDT 2022
% Result : Unsatisfiable 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LAT276-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/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.34 % Computer : n008.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 : Wed Jun 29 15:20:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 12 Number of unprocessed: 12
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # 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 # 12 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 6 conjectures.
% 0.12/0.37 # There are 6 start rule candidates:
% 0.12/0.37 # Found 3 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 6 start rule tableaux created.
% 0.12/0.37 # 9 extension rule candidate clauses
% 0.12/0.37 # 3 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 6
% 0.12/0.37 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 15 tableaux to operate on
% 0.12/0.38 # There were 3 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 3 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 3 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_20, plain, (c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A)).
% 0.12/0.38 cnf(i_0_13, negated_conjecture, (c_lessequals(v_S,v_A,tc_set(t_a)))).
% 0.12/0.38 cnf(i_0_24, plain, (c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r)).
% 0.12/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_xa,v_A,t_a)|c_in(v_xa,v_S,t_a))).
% 0.12/0.38 cnf(i_0_16, negated_conjecture, (c_in(v_xa,v_S,t_a)|~c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)))).
% 0.12/0.38 cnf(i_0_19, plain, (c_in(X1,X2,X3)|~c_in(X1,X4,X3)|~c_lessequals(X4,X2,tc_set(X3)))).
% 0.12/0.38 cnf(i_0_18, negated_conjecture, (c_in(c_Pair(X1,v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_xa,v_S,t_a)|~c_in(X1,v_S,t_a))).
% 0.12/0.38 cnf(i_0_17, negated_conjecture, (~c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)))).
% 0.12/0.38 cnf(i_0_23, plain, (c_in(c_Pair(X1,c_Tarski_Olub(X2,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(X1,X2,t_a)|~c_lessequals(X2,v_A,tc_set(t_a)))).
% 0.12/0.38 cnf(i_0_22, plain, (c_in(c_Pair(c_Tarski_Olub(X1,v_cl,t_a),X2,t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(c_Pair(v_sko__4mP(X2,X1,v_r),X2,t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(X2,v_A,t_a)|~c_lessequals(X1,v_A,tc_set(t_a)))).
% 0.12/0.38 cnf(i_0_21, plain, (c_in(c_Pair(c_Tarski_Olub(X1,v_cl,t_a),X2,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mP(X2,X1,v_r),X1,t_a)|~c_in(X2,v_A,t_a)|~c_lessequals(X1,v_A,tc_set(t_a)))).
% 0.12/0.38 cnf(i_0_14, negated_conjecture, (c_in(c_Pair(X1,v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(X1,v_S,t_a))).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 7 steps
% 0.12/0.38 cnf(i_0_17, negated_conjecture, (~c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a))), inference(start_rule)).
% 0.12/0.38 cnf(i_0_28, plain, (~c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a))), inference(extension_rule, [i_0_19])).
% 0.12/0.38 cnf(i_0_117, plain, (~c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a))), inference(extension_rule, [i_0_23])).
% 0.12/0.38 cnf(i_0_121, plain, (~c_lessequals(v_S,v_A,tc_set(t_a))), inference(closure_rule, [i_0_13])).
% 0.12/0.38 cnf(i_0_29, plain, (~c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a))), inference(etableau_closure_rule, [i_0_29, ...])).
% 0.12/0.38 cnf(i_0_118, plain, (~c_lessequals(v_r,v_r,tc_set(tc_prod(t_a,t_a)))), inference(etableau_closure_rule, [i_0_118, ...])).
% 0.12/0.38 cnf(i_0_120, plain, (~c_in(v_xa,v_S,t_a)), inference(etableau_closure_rule, [i_0_120, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # There were 3 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 3 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 3 successful branch saturations after the branch.
% 0.12/0.38 # There were 3 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 3 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 3 successful branch saturations after the branch.
% 0.12/0.38 # Child (13195) has found a proof.
% 0.12/0.38
% 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_20, plain, (c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A)).
% 0.12/0.38 cnf(i_0_13, negated_conjecture, (c_lessequals(v_S,v_A,tc_set(t_a)))).
% 0.12/0.38 cnf(i_0_24, plain, (c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r)).
% 0.12/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_xa,v_A,t_a)|c_in(v_xa,v_S,t_a))).
% 0.12/0.38 cnf(i_0_16, negated_conjecture, (c_in(v_xa,v_S,t_a)|~c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)))).
% 0.12/0.38 cnf(i_0_19, plain, (c_in(X1,X2,X3)|~c_in(X1,X4,X3)|~c_lessequals(X4,X2,tc_set(X3)))).
% 0.12/0.38 cnf(i_0_18, negated_conjecture, (c_in(c_Pair(X1,v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_xa,v_S,t_a)|~c_in(X1,v_S,t_a))).
% 0.12/0.38 cnf(i_0_17, negated_conjecture, (~c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)))).
% 0.12/0.38 cnf(i_0_23, plain, (c_in(c_Pair(X1,c_Tarski_Olub(X2,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(X1,X2,t_a)|~c_lessequals(X2,v_A,tc_set(t_a)))).
% 0.12/0.38 cnf(i_0_22, plain, (c_in(c_Pair(c_Tarski_Olub(X1,v_cl,t_a),X2,t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(c_Pair(v_sko__4mP(X2,X1,v_r),X2,t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(X2,v_A,t_a)|~c_lessequals(X1,v_A,tc_set(t_a)))).
% 0.12/0.38 cnf(i_0_21, plain, (c_in(c_Pair(c_Tarski_Olub(X1,v_cl,t_a),X2,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mP(X2,X1,v_r),X1,t_a)|~c_in(X2,v_A,t_a)|~c_lessequals(X1,v_A,tc_set(t_a)))).
% 0.12/0.38 cnf(i_0_14, negated_conjecture, (c_in(c_Pair(X1,v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(X1,v_S,t_a))).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 7 steps
% 0.12/0.38 cnf(i_0_16, negated_conjecture, (c_in(v_xa,v_S,t_a)|~c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a))), inference(start_rule)).
% 0.12/0.38 cnf(i_0_33, plain, (c_in(v_xa,v_S,t_a)), inference(extension_rule, [i_0_19])).
% 0.12/0.38 cnf(i_0_118, plain, (~c_lessequals(v_S,v_A,tc_set(t_a))), inference(closure_rule, [i_0_13])).
% 0.12/0.38 cnf(i_0_116, plain, (c_in(v_xa,v_A,t_a)), inference(extension_rule, [i_0_23])).
% 0.12/0.38 cnf(i_0_34, plain, (~c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a))), inference(etableau_closure_rule, [i_0_34, ...])).
% 0.12/0.38 cnf(i_0_119, plain, (c_in(c_Pair(v_xa,c_Tarski_Olub(v_A,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a))), inference(etableau_closure_rule, [i_0_119, ...])).
% 0.12/0.38 cnf(i_0_121, plain, (~c_lessequals(v_A,v_A,tc_set(t_a))), inference(etableau_closure_rule, [i_0_121, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # Proof search is over...
% 0.12/0.38 # Freeing feature tree
%------------------------------------------------------------------------------