TSTP Solution File: SET860-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET860-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 : n019.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:25 EDT 2022
% Result : Unsatisfiable 0.12s 0.39s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET860-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.33 % Computer : n019.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 16:31:23 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_B07_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: 24 Number of unprocessed: 24
% 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 # 24 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 3 conjectures.
% 0.12/0.36 # There are 3 start rule candidates:
% 0.12/0.36 # Found 5 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 3 start rule tableaux created.
% 0.12/0.36 # 19 extension rule candidate clauses
% 0.12/0.36 # 5 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 3
% 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.39 # There were 1 total branch saturation attempts.
% 0.12/0.39 # There were 0 of these attempts blocked.
% 0.12/0.39 # There were 0 deferred branch saturation attempts.
% 0.12/0.39 # There were 0 free duplicated saturations.
% 0.12/0.39 # There were 1 total successful branch saturations.
% 0.12/0.39 # There were 0 successful branch saturations in interreduction.
% 0.12/0.39 # There were 0 successful branch saturations on the branch.
% 0.12/0.39 # There were 1 successful branch saturations after the branch.
% 0.12/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.39 # Begin clausification derivation
% 0.12/0.39
% 0.12/0.39 # End clausification derivation
% 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.39 cnf(i_0_35, plain, (c_in(X1,c_UNIV,X2))).
% 0.12/0.39 cnf(i_0_43, plain, (c_in(X1,c_insert(X1,X2,X3),X3))).
% 0.12/0.39 cnf(i_0_26, negated_conjecture, (~c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a)))).
% 0.12/0.39 cnf(i_0_25, negated_conjecture, (~c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a)))).
% 0.12/0.39 cnf(i_0_41, plain, (~c_in(X1,c_emptyset,X2))).
% 0.12/0.39 cnf(i_0_27, negated_conjecture, (c_lessequals(v_B,X1,tc_set(t_a))|c_lessequals(X1,v_A,tc_set(t_a))|~c_in(X1,v_C,tc_set(t_a)))).
% 0.12/0.39 cnf(i_0_29, plain, (c_in(X1,c_uminus(X2,tc_set(X3)),X3)|c_in(X1,X2,X3))).
% 0.12/0.39 cnf(i_0_28, plain, (~c_in(X1,c_uminus(X2,tc_set(X3)),X3)|~c_in(X1,X2,X3))).
% 0.12/0.39 cnf(i_0_32, plain, (c_in(X1,X2,X3)|~c_in(X1,c_inter(X4,X2,X3),X3))).
% 0.12/0.39 cnf(i_0_33, plain, (c_in(X1,X2,X3)|~c_in(X1,c_inter(X2,X4,X3),X3))).
% 0.12/0.39 cnf(i_0_48, plain, (X1=X2|~c_lessequals(X2,X1,tc_set(X3))|~c_lessequals(X1,X2,tc_set(X3)))).
% 0.12/0.39 cnf(i_0_36, plain, (c_in(X1,c_union(X2,X3,X4),X4)|~c_in(X1,X3,X4))).
% 0.12/0.39 cnf(i_0_47, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3))).
% 0.12/0.39 cnf(i_0_45, plain, (c_in(X1,X2,X3)|~c_in(X1,X4,X3)|~c_lessequals(X4,X2,tc_set(X3)))).
% 0.12/0.39 cnf(i_0_44, plain, (X1=X2|c_in(X1,X3,X4)|~c_in(X1,c_insert(X2,X3,X4),X4))).
% 0.12/0.39 cnf(i_0_42, plain, (c_in(X1,c_insert(X2,X3,X4),X4)|~c_in(X1,X3,X4))).
% 0.12/0.39 cnf(i_0_46, plain, (c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)|c_lessequals(X1,X2,tc_set(X3)))).
% 0.12/0.39 cnf(i_0_39, plain, (c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3)|~c_in(X1,c_Union(X2,X3),X3))).
% 0.12/0.39 cnf(i_0_37, plain, (c_in(X1,X2,X3)|c_in(X1,X4,X3)|~c_in(X1,c_union(X2,X4,X3),X3))).
% 0.12/0.39 cnf(i_0_34, plain, (c_in(X1,c_inter(X2,X3,X4),X4)|~c_in(X1,X2,X4)|~c_in(X1,X3,X4))).
% 0.12/0.39 cnf(i_0_38, plain, (c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3))|~c_in(X1,c_Union(X2,X3),X3))).
% 0.12/0.39 cnf(i_0_40, plain, (c_in(X1,c_Union(X2,X3),X3)|~c_in(X4,X2,tc_set(X3))|~c_in(X1,X4,X3))).
% 0.12/0.39 cnf(i_0_31, plain, (c_lessequals(c_uminus(X1,tc_set(X2)),c_uminus(X3,tc_set(X2)),tc_set(X2))|~c_lessequals(X3,X1,tc_set(X2)))).
% 0.12/0.39 cnf(i_0_30, plain, (c_lessequals(X1,X2,tc_set(X3))|~c_lessequals(c_uminus(X2,tc_set(X3)),c_uminus(X1,tc_set(X3)),tc_set(X3)))).
% 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.39 # Begin printing tableau
% 0.12/0.39 # Found 4 steps
% 0.12/0.39 cnf(i_0_25, negated_conjecture, (~c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a))), inference(start_rule)).
% 0.12/0.39 cnf(i_0_52, plain, (~c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a))), inference(extension_rule, [i_0_46])).
% 0.12/0.39 cnf(i_0_122, plain, (c_in(c_Main_OsubsetI__1(c_Union(v_C,t_a),v_A,t_a),c_Union(v_C,t_a),t_a)), inference(extension_rule, [i_0_28])).
% 0.12/0.39 cnf(i_0_146, plain, (~c_in(c_Main_OsubsetI__1(c_Union(v_C,t_a),v_A,t_a),c_uminus(c_Union(v_C,t_a),tc_set(t_a)),t_a)), inference(etableau_closure_rule, [i_0_146, ...])).
% 0.12/0.39 # End printing tableau
% 0.12/0.39 # SZS output end
% 0.12/0.39 # Branches closed with saturation will be marked with an "s"
% 0.12/0.39 # Child (11321) has found a proof.
% 0.12/0.39
% 0.12/0.39 # Proof search is over...
% 0.12/0.39 # Freeing feature tree
%------------------------------------------------------------------------------