TSTP Solution File: SET016+4 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET016+4 : 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 : 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 00:56:18 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET016+4 : TPTP v8.1.0. Released v2.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 : 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 : Sun Jul 10 07:01:38 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_S04AI
% 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: 31 Number of unprocessed: 31
% 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.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 31 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 2 conjectures.
% 0.12/0.37 # There are 2 start rule candidates:
% 0.12/0.37 # Found 6 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 2 start rule tableaux created.
% 0.12/0.37 # 25 extension rule candidate clauses
% 0.12/0.37 # 6 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 2
% 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 Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/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_31, negated_conjecture, (equal_set(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)),unordered_pair(singleton(esk6_0),unordered_pair(esk6_0,esk7_0))))).
% 0.12/0.37 cnf(i_0_19, plain, (member(X1,singleton(X1)))).
% 0.12/0.37 cnf(i_0_21, plain, (member(X1,unordered_pair(X2,X1)))).
% 0.12/0.37 cnf(i_0_22, plain, (member(X1,unordered_pair(X1,X2)))).
% 0.12/0.37 cnf(i_0_30, negated_conjecture, (esk6_0!=esk4_0)).
% 0.12/0.37 cnf(i_0_15, plain, (~member(X1,empty_set))).
% 0.12/0.37 cnf(i_0_20, plain, (X1=X2|~member(X1,singleton(X2)))).
% 0.12/0.37 cnf(i_0_5, plain, (subset(X1,X2)|~equal_set(X2,X1))).
% 0.12/0.37 cnf(i_0_6, plain, (subset(X1,X2)|~equal_set(X1,X2))).
% 0.12/0.37 cnf(i_0_17, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))).
% 0.12/0.37 cnf(i_0_7, plain, (member(X1,power_set(X2))|~subset(X1,X2))).
% 0.12/0.37 cnf(i_0_8, plain, (subset(X1,X2)|~member(X1,power_set(X2)))).
% 0.12/0.37 cnf(i_0_4, plain, (equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2))).
% 0.12/0.37 cnf(i_0_2, plain, (member(esk1_2(X1,X2),X1)|subset(X1,X2))).
% 0.12/0.37 cnf(i_0_1, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))).
% 0.12/0.37 cnf(i_0_3, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))).
% 0.12/0.37 cnf(i_0_10, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))).
% 0.12/0.37 cnf(i_0_11, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))).
% 0.12/0.37 cnf(i_0_18, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))).
% 0.12/0.37 cnf(i_0_23, plain, (X1=X2|X1=X3|~member(X1,unordered_pair(X2,X3)))).
% 0.12/0.37 cnf(i_0_27, plain, (member(X1,product(X2))|~member(X1,esk3_2(X1,X2)))).
% 0.12/0.37 cnf(i_0_12, plain, (member(X1,union(X2,X3))|~member(X1,X3))).
% 0.12/0.37 cnf(i_0_13, plain, (member(X1,union(X2,X3))|~member(X1,X2))).
% 0.12/0.37 cnf(i_0_25, plain, (member(X1,esk2_2(X1,X2))|~member(X1,sum(X2)))).
% 0.12/0.37 cnf(i_0_28, plain, (member(esk3_2(X1,X2),X2)|member(X1,product(X2)))).
% 0.12/0.37 cnf(i_0_26, plain, (member(esk2_2(X1,X2),X2)|~member(X1,sum(X2)))).
% 0.12/0.37 cnf(i_0_14, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3)))).
% 0.12/0.37 cnf(i_0_29, plain, (member(X1,X2)|~member(X1,product(X3))|~member(X2,X3))).
% 0.12/0.37 cnf(i_0_9, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))).
% 0.12/0.37 cnf(i_0_24, plain, (member(X1,sum(X2))|~member(X1,X3)|~member(X3,X2))).
% 0.12/0.37 cnf(i_0_16, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))).
% 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 4 steps
% 0.12/0.37 cnf(i_0_31, negated_conjecture, (equal_set(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)),unordered_pair(singleton(esk6_0),unordered_pair(esk6_0,esk7_0)))), inference(start_rule)).
% 0.12/0.37 cnf(i_0_36, plain, (equal_set(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)),unordered_pair(singleton(esk6_0),unordered_pair(esk6_0,esk7_0)))), inference(extension_rule, [i_0_6])).
% 0.12/0.37 cnf(i_0_99, plain, (subset(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)),unordered_pair(singleton(esk6_0),unordered_pair(esk6_0,esk7_0)))), inference(extension_rule, [i_0_7])).
% 0.12/0.37 cnf(i_0_161, plain, (member(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)),power_set(unordered_pair(singleton(esk6_0),unordered_pair(esk6_0,esk7_0))))), inference(etableau_closure_rule, [i_0_161, ...])).
% 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 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 5 tableaux to operate on
% 0.12/0.37 # Found closed tableau during pool population.
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------