TSTP Solution File: SET853-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET853-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 : Tue Jul 19 01:03:19 EDT 2022
% Result : Unsatisfiable 0.22s 0.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET853-2 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.36 % Computer : n027.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jul 9 18:11:32 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.39 # No SInE strategy applied
% 0.15/0.39 # Auto-Mode selected heuristic G_E___208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.15/0.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.15/0.39 #
% 0.15/0.39 # Presaturation interreduction done
% 0.15/0.39 # Number of axioms: 13 Number of unprocessed: 13
% 0.15/0.39 # Tableaux proof search.
% 0.15/0.39 # APR header successfully linked.
% 0.15/0.39 # Hello from C++
% 0.22/0.39 # The folding up rule is enabled...
% 0.22/0.39 # Local unification is enabled...
% 0.22/0.39 # Any saturation attempts will use folding labels...
% 0.22/0.39 # 13 beginning clauses after preprocessing and clausification
% 0.22/0.39 # Creating start rules for all 6 conjectures.
% 0.22/0.39 # There are 6 start rule candidates:
% 0.22/0.39 # Found 6 unit axioms.
% 0.22/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.22/0.39 # 6 start rule tableaux created.
% 0.22/0.39 # 7 extension rule candidate clauses
% 0.22/0.39 # 6 unit axiom clauses
% 0.22/0.39
% 0.22/0.39 # Requested 8, 32 cores available to the main process.
% 0.22/0.39 # There are not enough tableaux to fork, creating more from the initial 6
% 0.22/0.39 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux.
% 0.22/0.39 # We now have 17 tableaux to operate on
% 0.22/0.40 # There were 2 total branch saturation attempts.
% 0.22/0.40 # There were 0 of these attempts blocked.
% 0.22/0.40 # There were 0 deferred branch saturation attempts.
% 0.22/0.40 # There were 0 free duplicated saturations.
% 0.22/0.40 # There were 2 total successful branch saturations.
% 0.22/0.40 # There were 0 successful branch saturations in interreduction.
% 0.22/0.40 # There were 0 successful branch saturations on the branch.
% 0.22/0.40 # There were 2 successful branch saturations after the branch.
% 0.22/0.40 # There were 2 total branch saturation attempts.
% 0.22/0.40 # There were 0 of these attempts blocked.
% 0.22/0.40 # There were 0 deferred branch saturation attempts.
% 0.22/0.40 # There were 0 free duplicated saturations.
% 0.22/0.40 # There were 2 total successful branch saturations.
% 0.22/0.40 # There were 0 successful branch saturations in interreduction.
% 0.22/0.40 # There were 0 successful branch saturations on the branch.
% 0.22/0.40 # There were 2 successful branch saturations after the branch.
% 0.22/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.40 # Begin clausification derivation
% 0.22/0.40
% 0.22/0.40 # End clausification derivation
% 0.22/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.22/0.40 cnf(i_0_14, negated_conjecture, (c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))))).
% 0.22/0.40 cnf(i_0_15, negated_conjecture, (c_in(v_xa,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))))).
% 0.22/0.40 cnf(i_0_16, negated_conjecture, (c_lessequals(v_xa,c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))))).
% 0.22/0.40 cnf(i_0_21, plain, (c_lessequals(X1,X1,tc_set(X2)))).
% 0.22/0.40 cnf(i_0_17, negated_conjecture, (v_xa!=c_Zorn_Osucc(v_S,v_x,t_a))).
% 0.22/0.40 cnf(i_0_18, negated_conjecture, (~c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))))).
% 0.22/0.40 cnf(i_0_20, plain, (X1=X2|~c_lessequals(X2,X1,tc_set(X3))|~c_lessequals(X1,X2,tc_set(X3)))).
% 0.22/0.40 cnf(i_0_26, plain, (c_lessequals(X1,c_Zorn_Osucc(X2,X3,X4),tc_set(tc_set(X4)))|~c_lessequals(X1,X3,tc_set(tc_set(X4))))).
% 0.22/0.40 cnf(i_0_19, negated_conjecture, (X1=v_x|c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_x,tc_set(tc_set(t_a)))|~c_lessequals(X1,v_x,tc_set(tc_set(t_a)))|~c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))))).
% 0.22/0.40 cnf(i_0_24, plain, (c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3)!=X2|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))).
% 0.22/0.40 cnf(i_0_25, plain, (c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|~c_lessequals(c_Zorn_Osucc(X1,c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3),X3),X2,tc_set(tc_set(X3)))|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))).
% 0.22/0.40 cnf(i_0_23, plain, (c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3),X2,tc_set(tc_set(X3)))|c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))).
% 0.22/0.40 cnf(i_0_22, plain, (c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|c_in(c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3),c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))).
% 0.22/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.22/0.40 # Begin printing tableau
% 0.22/0.40 # Found 8 steps
% 0.22/0.40 cnf(i_0_17, negated_conjecture, (v_xa!=c_Zorn_Osucc(v_S,v_x,t_a)), inference(start_rule)).
% 0.22/0.40 cnf(i_0_32, plain, (v_xa!=c_Zorn_Osucc(v_S,v_x,t_a)), inference(extension_rule, [i_0_20])).
% 0.22/0.40 cnf(i_0_125, plain, (~c_lessequals(v_xa,c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a)))), inference(closure_rule, [i_0_16])).
% 0.22/0.40 cnf(i_0_124, plain, (~c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_xa,tc_set(tc_set(t_a)))), inference(extension_rule, [i_0_24])).
% 0.22/0.40 cnf(i_0_131, plain, (~c_in(v_xa,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))), inference(closure_rule, [i_0_15])).
% 0.22/0.40 cnf(i_0_132, plain, (~c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))), inference(closure_rule, [i_0_14])).
% 0.22/0.40 cnf(i_0_129, plain, (c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))), inference(etableau_closure_rule, [i_0_129, ...])).
% 0.22/0.40 cnf(i_0_130, plain, (c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a)!=v_x), inference(etableau_closure_rule, [i_0_130, ...])).
% 0.22/0.40 # End printing tableau
% 0.22/0.40 # SZS output end
% 0.22/0.40 # Branches closed with saturation will be marked with an "s"
% 0.22/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.40 # Begin clausification derivation
% 0.22/0.40
% 0.22/0.40 # End clausification derivation
% 0.22/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.22/0.40 cnf(i_0_14, negated_conjecture, (c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))))).
% 0.22/0.40 cnf(i_0_15, negated_conjecture, (c_in(v_xa,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))))).
% 0.22/0.40 cnf(i_0_16, negated_conjecture, (c_lessequals(v_xa,c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))))).
% 0.22/0.40 cnf(i_0_21, plain, (c_lessequals(X1,X1,tc_set(X2)))).
% 0.22/0.40 cnf(i_0_17, negated_conjecture, (v_xa!=c_Zorn_Osucc(v_S,v_x,t_a))).
% 0.22/0.40 cnf(i_0_18, negated_conjecture, (~c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))))).
% 0.22/0.40 cnf(i_0_20, plain, (X1=X2|~c_lessequals(X2,X1,tc_set(X3))|~c_lessequals(X1,X2,tc_set(X3)))).
% 0.22/0.40 cnf(i_0_26, plain, (c_lessequals(X1,c_Zorn_Osucc(X2,X3,X4),tc_set(tc_set(X4)))|~c_lessequals(X1,X3,tc_set(tc_set(X4))))).
% 0.22/0.40 cnf(i_0_19, negated_conjecture, (X1=v_x|c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_x,tc_set(tc_set(t_a)))|~c_lessequals(X1,v_x,tc_set(tc_set(t_a)))|~c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))))).
% 0.22/0.40 cnf(i_0_24, plain, (c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3)!=X2|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))).
% 0.22/0.40 cnf(i_0_25, plain, (c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|~c_lessequals(c_Zorn_Osucc(X1,c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3),X3),X2,tc_set(tc_set(X3)))|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))).
% 0.22/0.40 cnf(i_0_23, plain, (c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3),X2,tc_set(tc_set(X3)))|c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))).
% 0.22/0.40 cnf(i_0_22, plain, (c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))|c_lessequals(X4,X2,tc_set(tc_set(X3)))|c_in(c_Zorn_OTFin__linear__lemma1__1(X1,X2,X3),c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))|~c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))))).
% 0.22/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.22/0.40 # Begin printing tableau
% 0.22/0.40 # Found 8 steps
% 0.22/0.40 cnf(i_0_16, negated_conjecture, (c_lessequals(v_xa,c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a)))), inference(start_rule)).
% 0.22/0.40 cnf(i_0_33, plain, (c_lessequals(v_xa,c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a)))), inference(extension_rule, [i_0_20])).
% 0.22/0.40 cnf(i_0_123, plain, (v_xa=c_Zorn_Osucc(v_S,v_x,t_a)), inference(closure_rule, [i_0_17])).
% 0.22/0.40 cnf(i_0_125, plain, (~c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_xa,tc_set(tc_set(t_a)))), inference(extension_rule, [i_0_24])).
% 0.22/0.40 cnf(i_0_131, plain, (~c_in(v_xa,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))), inference(closure_rule, [i_0_15])).
% 0.22/0.40 cnf(i_0_132, plain, (~c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))), inference(closure_rule, [i_0_14])).
% 0.22/0.40 cnf(i_0_129, plain, (c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))), inference(etableau_closure_rule, [i_0_129, ...])).
% 0.22/0.40 cnf(i_0_130, plain, (c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a)!=v_x), inference(etableau_closure_rule, [i_0_130, ...])).
% 0.22/0.40 # End printing tableau
% 0.22/0.40 # SZS output end
% 0.22/0.40 # Branches closed with saturation will be marked with an "s"
% 0.22/0.40 # Child (18649) has found a proof.
% 0.22/0.40
% 0.22/0.40 # Proof search is over...
% 0.22/0.40 # Freeing feature tree
%------------------------------------------------------------------------------