TSTP Solution File: SET865-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET865-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 : n017.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:28 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.11/0.12 % Problem : SET865-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/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 : n017.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 : Sat Jul 9 17:01:02 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: 8 Number of unprocessed: 8
% 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 # 8 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 4 conjectures.
% 0.12/0.36 # There are 4 start rule candidates:
% 0.12/0.36 # Found 2 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 4 start rule tableaux created.
% 0.12/0.36 # 6 extension rule candidate clauses
% 0.12/0.36 # 2 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 are not enough tableaux to fork, creating more from the initial 4
% 0.12/0.36 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 12 tableaux to operate on
% 0.12/0.36 # Closed tableau found in foldup close cycle with 3 folds and 2 closures done.
% 0.12/0.36 # There were 0 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 0 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 0 successful branch saturations after the branch.
% 0.12/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox/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_16, plain, (c_lessequals(c_Zorn_Omaxchain(X1,X2),c_Zorn_Ochain(X1,X2),tc_set(tc_set(tc_set(X2)))))).
% 0.12/0.36 cnf(i_0_14, plain, (c_in(c_Zorn_OHausdorff__1(X1,X2),c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2))))).
% 0.12/0.36 cnf(i_0_12, negated_conjecture, (v_x(X1)!=X1|~c_in(X1,v_S,tc_set(t_a)))).
% 0.12/0.36 cnf(i_0_10, negated_conjecture, (c_in(v_x(X1),v_S,tc_set(t_a))|~c_in(X1,v_S,tc_set(t_a)))).
% 0.12/0.36 cnf(i_0_9, negated_conjecture, (c_in(c_Union(X1,t_a),v_S,tc_set(t_a))|~c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))))).
% 0.12/0.36 cnf(i_0_11, negated_conjecture, (c_lessequals(X1,v_x(X1),tc_set(t_a))|~c_in(X1,v_S,tc_set(t_a)))).
% 0.12/0.36 cnf(i_0_13, plain, (c_in(X1,X2,X3)|~c_lessequals(X4,X2,tc_set(X3))|~c_in(X1,X4,X3))).
% 0.12/0.36 cnf(i_0_15, plain, (c_Union(X1,X2)=X3|~c_lessequals(c_Union(X1,X2),X3,tc_set(X2))|~c_in(X1,c_Zorn_Omaxchain(X4,X2),tc_set(tc_set(X2)))|~c_in(X3,X4,tc_set(X2)))).
% 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 11 steps
% 0.12/0.36 cnf(i_0_9, negated_conjecture, (c_in(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_S,tc_set(t_a))|~c_in(c_Zorn_OHausdorff__1(v_S,t_a),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))), inference(start_rule)).
% 0.12/0.36 cnf(i_0_19, plain, (c_in(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_S,tc_set(t_a))), inference(extension_rule, [i_0_12])).
% 0.12/0.36 cnf(i_0_68, plain, (v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a))!=c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a)), inference(extension_rule, [i_0_15])).
% 0.12/0.36 cnf(i_0_75, plain, (~c_in(c_Zorn_OHausdorff__1(v_S,t_a),c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a)))), inference(closure_rule, [i_0_14])).
% 0.12/0.36 cnf(i_0_74, plain, (~c_lessequals(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a)),tc_set(t_a))), inference(extension_rule, [i_0_11])).
% 0.12/0.36 cnf(i_0_81, plain, (~c_in(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_S,tc_set(t_a))), inference(closure_rule, [i_0_19])).
% 0.12/0.36 cnf(i_0_76, plain, (~c_in(v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a)),v_S,tc_set(t_a))), inference(extension_rule, [i_0_10])).
% 0.12/0.36 cnf(i_0_88, plain, (~c_in(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_S,tc_set(t_a))), inference(closure_rule, [i_0_19])).
% 0.12/0.36 cnf(i_0_20, plain, (~c_in(c_Zorn_OHausdorff__1(v_S,t_a),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))), inference(extension_rule, [i_0_13])).
% 0.12/0.36 cnf(i_0_90, plain, (~c_lessequals(c_Zorn_Omaxchain(v_S,t_a),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(tc_set(t_a))))), inference(closure_rule, [i_0_16])).
% 0.12/0.36 cnf(i_0_91, plain, (~c_in(c_Zorn_OHausdorff__1(v_S,t_a),c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a)))), inference(closure_rule, [i_0_14])).
% 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.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_16, plain, (c_lessequals(c_Zorn_Omaxchain(X1,X2),c_Zorn_Ochain(X1,X2),tc_set(tc_set(tc_set(X2)))))).
% 0.12/0.37 cnf(i_0_14, plain, (c_in(c_Zorn_OHausdorff__1(X1,X2),c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2))))).
% 0.12/0.37 cnf(i_0_12, negated_conjecture, (v_x(X1)!=X1|~c_in(X1,v_S,tc_set(t_a)))).
% 0.12/0.37 cnf(i_0_10, negated_conjecture, (c_in(v_x(X1),v_S,tc_set(t_a))|~c_in(X1,v_S,tc_set(t_a)))).
% 0.12/0.37 cnf(i_0_9, negated_conjecture, (c_in(c_Union(X1,t_a),v_S,tc_set(t_a))|~c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))))).
% 0.12/0.37 cnf(i_0_11, negated_conjecture, (c_lessequals(X1,v_x(X1),tc_set(t_a))|~c_in(X1,v_S,tc_set(t_a)))).
% 0.12/0.37 cnf(i_0_13, plain, (c_in(X1,X2,X3)|~c_lessequals(X4,X2,tc_set(X3))|~c_in(X1,X4,X3))).
% 0.12/0.37 cnf(i_0_15, plain, (c_Union(X1,X2)=X3|~c_lessequals(c_Union(X1,X2),X3,tc_set(X2))|~c_in(X1,c_Zorn_Omaxchain(X4,X2),tc_set(tc_set(X2)))|~c_in(X3,X4,tc_set(X2)))).
% 0.12/0.37 cnf(i_0_122, plain, (X5=X5)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 5 steps
% 0.12/0.37 cnf(i_0_122, plain, (X8=X8), inference(start_rule)).
% 0.12/0.37 cnf(i_0_151, plain, (X8=X8), inference(extension_rule, [i_0_126])).
% 0.12/0.37 cnf(i_0_176, plain, ($false), inference(closure_rule, [i_0_122])).
% 0.12/0.37 cnf(i_0_174, plain, (c_Union(X8,X5)=c_Union(X8,X5)), inference(extension_rule, [i_0_127])).
% 0.12/0.37 cnf(i_0_374, plain, (tc_set(c_Union(X8,X5))=tc_set(c_Union(X8,X5))), inference(etableau_closure_rule, [i_0_374, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_16, plain, (c_lessequals(c_Zorn_Omaxchain(X1,X2),c_Zorn_Ochain(X1,X2),tc_set(tc_set(tc_set(X2)))))).
% 0.12/0.37 cnf(i_0_14, plain, (c_in(c_Zorn_OHausdorff__1(X1,X2),c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2))))).
% 0.12/0.37 cnf(i_0_12, negated_conjecture, (v_x(X1)!=X1|~c_in(X1,v_S,tc_set(t_a)))).
% 0.12/0.37 cnf(i_0_10, negated_conjecture, (c_in(v_x(X1),v_S,tc_set(t_a))|~c_in(X1,v_S,tc_set(t_a)))).
% 0.12/0.37 cnf(i_0_9, negated_conjecture, (c_in(c_Union(X1,t_a),v_S,tc_set(t_a))|~c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))))).
% 0.12/0.37 cnf(i_0_11, negated_conjecture, (c_lessequals(X1,v_x(X1),tc_set(t_a))|~c_in(X1,v_S,tc_set(t_a)))).
% 0.12/0.37 cnf(i_0_13, plain, (c_in(X1,X2,X3)|~c_lessequals(X4,X2,tc_set(X3))|~c_in(X1,X4,X3))).
% 0.12/0.37 cnf(i_0_15, plain, (c_Union(X1,X2)=X3|~c_lessequals(c_Union(X1,X2),X3,tc_set(X2))|~c_in(X1,c_Zorn_Omaxchain(X4,X2),tc_set(tc_set(X2)))|~c_in(X3,X4,tc_set(X2)))).
% 0.12/0.37 cnf(i_0_85, plain, (X5=X5)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 5 steps
% 0.12/0.37 cnf(i_0_85, plain, (X6=X6), inference(start_rule)).
% 0.12/0.37 cnf(i_0_114, plain, (X6=X6), inference(extension_rule, [i_0_89])).
% 0.12/0.37 cnf(i_0_139, plain, ($false), inference(closure_rule, [i_0_85])).
% 0.12/0.37 cnf(i_0_137, plain, (c_Union(X6,X5)=c_Union(X6,X5)), inference(extension_rule, [i_0_90])).
% 0.12/0.37 cnf(i_0_335, plain, (tc_set(c_Union(X6,X5))=tc_set(c_Union(X6,X5))), inference(etableau_closure_rule, [i_0_335, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Child (11138) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------