TSTP Solution File: SET012-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET012-2 : TPTP v8.1.0. Bugfixed v2.1.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 : n021.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 00:56:08 EDT 2022
% Result : Unsatisfiable 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET012-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 06:04:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 24 Number of unprocessed: 24
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.40 # The folding up rule is enabled...
% 0.13/0.40 # Local unification is enabled...
% 0.13/0.40 # Any saturation attempts will use folding labels...
% 0.13/0.40 # 24 beginning clauses after preprocessing and clausification
% 0.13/0.40 # Creating start rules for all 1 conjectures.
% 0.13/0.40 # There are 1 start rule candidates:
% 0.13/0.40 # Found 6 unit axioms.
% 0.13/0.40 # 1 start rule tableaux created.
% 0.13/0.40 # 18 extension rule candidate clauses
% 0.13/0.40 # 6 unit axiom clauses
% 0.13/0.40
% 0.13/0.40 # Requested 8, 32 cores available to the main process.
% 0.13/0.40 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.58 # There were 2 total branch saturation attempts.
% 0.20/0.58 # There were 0 of these attempts blocked.
% 0.20/0.58 # There were 0 deferred branch saturation attempts.
% 0.20/0.58 # There were 0 free duplicated saturations.
% 0.20/0.58 # There were 2 total successful branch saturations.
% 0.20/0.58 # There were 0 successful branch saturations in interreduction.
% 0.20/0.58 # There were 0 successful branch saturations on the branch.
% 0.20/0.58 # There were 2 successful branch saturations after the branch.
% 0.20/0.58 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.58 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.58 # Begin clausification derivation
% 0.20/0.58
% 0.20/0.58 # End clausification derivation
% 0.20/0.58 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.58 cnf(i_0_40, plain, (equal_sets(X1,X1))).
% 0.20/0.58 cnf(i_0_46, hypothesis, (equal_sets(complement(a),b))).
% 0.20/0.58 cnf(i_0_47, hypothesis, (equal_sets(complement(b),c))).
% 0.20/0.58 cnf(i_0_43, plain, (equal_elements(X1,X1))).
% 0.20/0.58 cnf(i_0_48, negated_conjecture, (~equal_sets(a,c))).
% 0.20/0.58 cnf(i_0_25, plain, (~member(X1,empty_set))).
% 0.20/0.58 cnf(i_0_38, plain, (subset(X1,X2)|~equal_sets(X2,X1))).
% 0.20/0.58 cnf(i_0_30, plain, (~member(X1,complement(X2))|~member(X1,X2))).
% 0.20/0.58 cnf(i_0_37, plain, (subset(X1,X2)|~equal_sets(X1,X2))).
% 0.20/0.58 cnf(i_0_41, plain, (equal_sets(X1,X2)|~equal_sets(X2,X1))).
% 0.20/0.58 cnf(i_0_44, plain, (equal_elements(X1,X2)|~equal_elements(X2,X1))).
% 0.20/0.58 cnf(i_0_29, plain, (member(X1,complement(X2))|member(X1,X2))).
% 0.20/0.58 cnf(i_0_42, plain, (equal_sets(X1,X2)|~equal_sets(X3,X2)|~equal_sets(X1,X3))).
% 0.20/0.58 cnf(i_0_36, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))).
% 0.20/0.58 cnf(i_0_35, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))).
% 0.20/0.58 cnf(i_0_28, plain, (subset(X1,X2)|~member(member_of_1_not_of_2(X1,X2),X2))).
% 0.20/0.58 cnf(i_0_27, plain, (subset(X1,X2)|member(member_of_1_not_of_2(X1,X2),X1))).
% 0.20/0.58 cnf(i_0_32, plain, (member(X1,union(X2,X3))|~member(X1,X3))).
% 0.20/0.58 cnf(i_0_39, plain, (equal_sets(X1,X2)|~subset(X1,X2)|~subset(X2,X1))).
% 0.20/0.58 cnf(i_0_26, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))).
% 0.20/0.58 cnf(i_0_45, plain, (equal_elements(X1,X2)|~equal_elements(X3,X2)|~equal_elements(X1,X3))).
% 0.20/0.58 cnf(i_0_31, plain, (member(X1,union(X2,X3))|~member(X1,X2))).
% 0.20/0.58 cnf(i_0_34, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))).
% 0.20/0.58 cnf(i_0_33, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3)))).
% 0.20/0.58 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.58 # Begin printing tableau
% 0.20/0.58 # Found 5 steps
% 0.20/0.58 cnf(i_0_48, negated_conjecture, (~equal_sets(a,c)), inference(start_rule)).
% 0.20/0.58 cnf(i_0_49, plain, (~equal_sets(a,c)), inference(extension_rule, [i_0_39])).
% 0.20/0.58 cnf(i_0_76, plain, (~subset(a,c)), inference(extension_rule, [i_0_38])).
% 0.20/0.58 cnf(i_0_77, plain, (~subset(c,a)), inference(etableau_closure_rule, [i_0_77, ...])).
% 0.20/0.58 cnf(i_0_93, plain, (~equal_sets(c,a)), inference(etableau_closure_rule, [i_0_93, ...])).
% 0.20/0.58 # End printing tableau
% 0.20/0.58 # SZS output end
% 0.20/0.58 # Branches closed with saturation will be marked with an "s"
% 0.20/0.58 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.58 # We now have 3 tableaux to operate on
% 0.20/0.58 # Found closed tableau during pool population.
% 0.20/0.58 # Proof search is over...
% 0.20/0.58 # Freeing feature tree
%------------------------------------------------------------------------------