TSTP Solution File: SET841-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET841-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:08 EDT 2022
% Result : Unsatisfiable 0.20s 0.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET841-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.14 % 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 : n027.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 : Sun Jul 10 01:29:47 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.38 # No SInE strategy applied
% 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.38 #
% 0.20/0.38 # Presaturation interreduction done
% 0.20/0.38 # Number of axioms: 7 Number of unprocessed: 7
% 0.20/0.38 # Tableaux proof search.
% 0.20/0.38 # APR header successfully linked.
% 0.20/0.38 # Hello from C++
% 0.20/0.38 # The folding up rule is enabled...
% 0.20/0.38 # Local unification is enabled...
% 0.20/0.38 # Any saturation attempts will use folding labels...
% 0.20/0.38 # 7 beginning clauses after preprocessing and clausification
% 0.20/0.38 # Creating start rules for all 5 conjectures.
% 0.20/0.38 # There are 5 start rule candidates:
% 0.20/0.38 # Found 6 unit axioms.
% 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.38 # 5 start rule tableaux created.
% 0.20/0.38 # 1 extension rule candidate clauses
% 0.20/0.38 # 6 unit axiom clauses
% 0.20/0.38
% 0.20/0.38 # Requested 8, 32 cores available to the main process.
% 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 5
% 0.20/0.39 # There were 5 total branch saturation attempts.
% 0.20/0.39 # There were 0 of these attempts blocked.
% 0.20/0.39 # There were 0 deferred branch saturation attempts.
% 0.20/0.39 # There were 0 free duplicated saturations.
% 0.20/0.39 # There were 5 total successful branch saturations.
% 0.20/0.39 # There were 3 successful branch saturations in interreduction.
% 0.20/0.39 # There were 0 successful branch saturations on the branch.
% 0.20/0.39 # There were 2 successful branch saturations after the branch.
% 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # Begin clausification derivation
% 0.20/0.39
% 0.20/0.39 # End clausification derivation
% 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39 cnf(i_0_11, negated_conjecture, (c_Zorn_Osucc(v_S,v_m,t_a)=v_m)).
% 0.20/0.39 cnf(i_0_13, negated_conjecture, (c_lessequals(v_x,v_m,tc_set(tc_set(t_a))))).
% 0.20/0.39 cnf(i_0_10, negated_conjecture, (c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))))).
% 0.20/0.39 cnf(i_0_12, negated_conjecture, (c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))))).
% 0.20/0.39 cnf(i_0_8, plain, (c_lessequals(X1,X1,tc_set(X2)))).
% 0.20/0.39 cnf(i_0_14, negated_conjecture, (~c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))))).
% 0.20/0.39 cnf(i_0_9, plain, (X1=X2|c_lessequals(c_Zorn_Osucc(X3,X1,X4),X2,tc_set(tc_set(X4)))|~c_in(X2,c_Zorn_OTFin(X3,X4),tc_set(tc_set(X4)))|~c_in(X1,c_Zorn_OTFin(X3,X4),tc_set(tc_set(X4)))|~c_lessequals(X1,X2,tc_set(tc_set(X4))))).
% 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.39 # Begin printing tableau
% 0.20/0.39 # Found 10 steps
% 0.20/0.39 cnf(i_0_10, negated_conjecture, (c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))), inference(start_rule)).
% 0.20/0.39 cnf(i_0_17, plain, (c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))), inference(extension_rule, [i_0_9])).
% 0.20/0.39 cnf(i_0_32, plain, (~c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))), inference(closure_rule, [i_0_12])).
% 0.20/0.39 cnf(i_0_31, plain, (c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a)))), inference(extension_rule, [i_0_9])).
% 0.20/0.39 cnf(i_0_57, plain, (~c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))), inference(closure_rule, [i_0_12])).
% 0.20/0.39 cnf(i_0_30, plain, (v_x=v_m), inference(etableau_closure_rule, [i_0_30, ...])).
% 0.20/0.39 cnf(i_0_34, plain, (~c_lessequals(v_m,v_x,tc_set(tc_set(t_a)))), inference(etableau_closure_rule, [i_0_34, ...])).
% 0.20/0.39 cnf(i_0_55, plain, (c_Zorn_Osucc(v_S,v_m,t_a)=v_x), inference(etableau_closure_rule, [i_0_55, ...])).
% 0.20/0.39 cnf(i_0_56, plain, (c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_Osucc(v_S,v_m,t_a),t_a),v_x,tc_set(tc_set(t_a)))), inference(etableau_closure_rule, [i_0_56, ...])).
% 0.20/0.39 cnf(i_0_58, plain, (~c_in(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))), inference(etableau_closure_rule, [i_0_58, ...])).
% 0.20/0.39 # End printing tableau
% 0.20/0.39 # SZS output end
% 0.20/0.39 # Branches closed with saturation will be marked with an "s"
% 0.20/0.39 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.39 # We now have 5 tableaux to operate on
% 0.20/0.39 # Found closed tableau during pool population.
% 0.20/0.39 # Proof search is over...
% 0.20/0.39 # Freeing feature tree
%------------------------------------------------------------------------------