TSTP Solution File: SET643+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET643+3 : TPTP v8.1.0. Released v2.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 : n003.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:01:40 EDT 2022
% Result : Theorem 0.20s 0.37s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET643+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/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.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 04:09:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic C07_19_nc_SAT001_MinMin_rr
% 0.20/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.20/0.37 #
% 0.20/0.37 # Presaturation interreduction done
% 0.20/0.37 # Number of axioms: 44 Number of unprocessed: 31
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 31 beginning clauses after preprocessing and clausification
% 0.20/0.37 # Creating start rules for all 1 conjectures.
% 0.20/0.37 # There are 1 start rule candidates:
% 0.20/0.37 # Found 6 unit axioms.
% 0.20/0.37 # 1 start rule tableaux created.
% 0.20/0.37 # 25 extension rule candidate clauses
% 0.20/0.37 # 6 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.37 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done.
% 0.20/0.37 # There were 0 total branch saturation attempts.
% 0.20/0.37 # There were 0 of these attempts blocked.
% 0.20/0.37 # There were 0 deferred branch saturation attempts.
% 0.20/0.37 # There were 0 free duplicated saturations.
% 0.20/0.37 # There were 0 total successful branch saturations.
% 0.20/0.37 # There were 0 successful branch saturations in interreduction.
% 0.20/0.37 # There were 0 successful branch saturations on the branch.
% 0.20/0.37 # There were 0 successful branch saturations after the branch.
% 0.20/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.37 # Begin clausification derivation
% 0.20/0.37
% 0.20/0.37 # End clausification derivation
% 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.37 cnf(i_0_41, plain, (ilf_type(X1,set_type))).
% 0.20/0.37 cnf(i_0_20, plain, (subset(X1,X1))).
% 0.20/0.37 cnf(i_0_15, plain, (ilf_type(esk4_1(X1),subset_type(X1)))).
% 0.20/0.37 cnf(i_0_11, plain, (ilf_type(esk3_2(X1,X2),relation_type(X2,X1)))).
% 0.20/0.37 cnf(i_0_42, negated_conjecture, (~ilf_type(cross_product(esk12_0,esk13_0),relation_type(esk12_0,esk13_0)))).
% 0.20/0.37 cnf(i_0_26, plain, (~empty(power_set(X1)))).
% 0.20/0.37 cnf(i_0_39, plain, (relation_like(X1)|~empty(X1))).
% 0.20/0.37 cnf(i_0_32, plain, (~empty(X1)|~member(X2,X1))).
% 0.20/0.37 cnf(i_0_30, plain, (empty(X1)|member(esk8_1(X1),X1))).
% 0.20/0.37 cnf(i_0_40, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
% 0.20/0.37 cnf(i_0_34, plain, (relation_like(X1)|member(esk11_1(X1),X1))).
% 0.20/0.37 cnf(i_0_29, plain, (empty(X1)|ilf_type(esk7_1(X1),member_type(X1)))).
% 0.20/0.37 cnf(i_0_16, plain, (subset(X1,X2)|~member(esk5_2(X1,X2),X2))).
% 0.20/0.37 cnf(i_0_21, plain, (member(X1,power_set(X2))|~member(esk6_2(X1,X2),X2))).
% 0.20/0.37 cnf(i_0_33, plain, (relation_like(X1)|esk11_1(X1)!=ordered_pair(X2,X3))).
% 0.20/0.37 cnf(i_0_28, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))).
% 0.20/0.37 cnf(i_0_13, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))).
% 0.20/0.37 cnf(i_0_10, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
% 0.20/0.37 cnf(i_0_1, plain, (ilf_type(X1,relation_type(X2,X3))|~subset(X1,cross_product(X2,X3)))).
% 0.20/0.37 cnf(i_0_27, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))).
% 0.20/0.37 cnf(i_0_14, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))).
% 0.20/0.37 cnf(i_0_17, plain, (member(esk5_2(X1,X2),X1)|subset(X1,X2))).
% 0.20/0.37 cnf(i_0_19, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))).
% 0.20/0.37 cnf(i_0_9, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))).
% 0.20/0.37 cnf(i_0_22, plain, (member(esk6_2(X1,X2),X1)|member(X1,power_set(X2)))).
% 0.20/0.37 cnf(i_0_24, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))).
% 0.20/0.37 cnf(i_0_5, plain, (member(esk1_3(X1,X2,X3),X1)|~member(X3,cross_product(X1,X2)))).
% 0.20/0.37 cnf(i_0_4, plain, (member(esk2_3(X1,X2,X3),X2)|~member(X3,cross_product(X1,X2)))).
% 0.20/0.37 cnf(i_0_36, plain, (ordered_pair(esk9_2(X1,X2),esk10_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))).
% 0.20/0.37 cnf(i_0_3, plain, (ordered_pair(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3))=X3|~member(X3,cross_product(X1,X2)))).
% 0.20/0.37 cnf(i_0_2, plain, (member(ordered_pair(X1,X2),cross_product(X3,X4))|~member(X2,X4)|~member(X1,X3))).
% 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.37 # Begin printing tableau
% 0.20/0.37 # Found 3 steps
% 0.20/0.37 cnf(i_0_42, negated_conjecture, (~ilf_type(cross_product(esk12_0,esk13_0),relation_type(esk12_0,esk13_0))), inference(start_rule)).
% 0.20/0.37 cnf(i_0_46, plain, (~ilf_type(cross_product(esk12_0,esk13_0),relation_type(esk12_0,esk13_0))), inference(extension_rule, [i_0_1])).
% 0.20/0.37 cnf(i_0_73, plain, (~subset(cross_product(esk12_0,esk13_0),cross_product(esk12_0,esk13_0))), inference(closure_rule, [i_0_20])).
% 0.20/0.37 # End printing tableau
% 0.20/0.37 # SZS output end
% 0.20/0.37 # Branches closed with saturation will be marked with an "s"
% 0.20/0.37 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.37 # We now have 2 tableaux to operate on
% 0.20/0.37 # Found closed tableau during pool population.
% 0.20/0.37 # Proof search is over...
% 0.20/0.37 # Freeing feature tree
%------------------------------------------------------------------------------