TSTP Solution File: SET701+4 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET701+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 : n007.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:02:06 EDT 2022
% Result : Theorem 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET701+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/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 : n007.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 20:48:16 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___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 33 Number of unprocessed: 33
% 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 # 33 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 4 conjectures.
% 0.12/0.36 # There are 4 start rule candidates:
% 0.12/0.36 # Found 6 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 4 start rule tableaux created.
% 0.12/0.36 # 27 extension rule candidate clauses
% 0.12/0.36 # 6 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 4
% 0.12/0.36 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 13 tableaux to operate on
% 0.18/0.50 # There were 2 total branch saturation attempts.
% 0.18/0.50 # There were 0 of these attempts blocked.
% 0.18/0.50 # There were 0 deferred branch saturation attempts.
% 0.18/0.50 # There were 0 free duplicated saturations.
% 0.18/0.50 # There were 2 total successful branch saturations.
% 0.18/0.50 # There were 0 successful branch saturations in interreduction.
% 0.18/0.50 # There were 0 successful branch saturations on the branch.
% 0.18/0.50 # There were 2 successful branch saturations after the branch.
% 0.18/0.50 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.50 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.50 # Begin clausification derivation
% 0.18/0.50
% 0.18/0.50 # End clausification derivation
% 0.18/0.50 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.50 cnf(i_0_33, negated_conjecture, (subset(esk4_0,esk7_0))).
% 0.18/0.50 cnf(i_0_32, negated_conjecture, (subset(esk5_0,esk7_0))).
% 0.18/0.50 cnf(i_0_19, plain, (member(X1,singleton(X1)))).
% 0.18/0.50 cnf(i_0_21, plain, (member(X1,unordered_pair(X2,X1)))).
% 0.18/0.50 cnf(i_0_22, plain, (member(X1,unordered_pair(X1,X2)))).
% 0.18/0.50 cnf(i_0_15, plain, (~member(X1,empty_set))).
% 0.18/0.50 cnf(i_0_5, plain, (subset(X1,X2)|~equal_set(X2,X1))).
% 0.18/0.50 cnf(i_0_6, plain, (subset(X1,X2)|~equal_set(X1,X2))).
% 0.18/0.50 cnf(i_0_30, negated_conjecture, (subset(intersection(esk4_0,difference(esk7_0,esk5_0)),intersection(esk6_0,difference(esk7_0,esk6_0)))|subset(esk4_0,esk5_0))).
% 0.18/0.50 cnf(i_0_7, plain, (member(X1,power_set(X2))|~subset(X1,X2))).
% 0.18/0.50 cnf(i_0_8, plain, (subset(X1,X2)|~member(X1,power_set(X2)))).
% 0.18/0.50 cnf(i_0_10, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))).
% 0.18/0.50 cnf(i_0_11, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))).
% 0.18/0.50 cnf(i_0_18, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))).
% 0.18/0.50 cnf(i_0_17, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))).
% 0.18/0.50 cnf(i_0_4, plain, (equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2))).
% 0.18/0.50 cnf(i_0_20, plain, (X1=X2|~member(X1,singleton(X2)))).
% 0.18/0.50 cnf(i_0_2, plain, (member(esk1_2(X1,X2),X1)|subset(X1,X2))).
% 0.18/0.50 cnf(i_0_1, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))).
% 0.18/0.50 cnf(i_0_31, negated_conjecture, (~subset(intersection(esk4_0,difference(esk7_0,esk5_0)),intersection(esk6_0,difference(esk7_0,esk6_0)))|~subset(esk4_0,esk5_0))).
% 0.18/0.50 cnf(i_0_23, plain, (X1=X2|X1=X3|~member(X1,unordered_pair(X2,X3)))).
% 0.18/0.50 cnf(i_0_3, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))).
% 0.18/0.50 cnf(i_0_12, plain, (member(X1,union(X2,X3))|~member(X1,X3))).
% 0.18/0.50 cnf(i_0_13, plain, (member(X1,union(X2,X3))|~member(X1,X2))).
% 0.18/0.50 cnf(i_0_16, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))).
% 0.18/0.50 cnf(i_0_28, plain, (member(esk3_2(X1,X2),X2)|member(X1,product(X2)))).
% 0.18/0.50 cnf(i_0_24, plain, (member(X1,sum(X2))|~member(X1,X3)|~member(X3,X2))).
% 0.18/0.50 cnf(i_0_9, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))).
% 0.18/0.50 cnf(i_0_25, plain, (member(X1,esk2_2(X1,X2))|~member(X1,sum(X2)))).
% 0.18/0.50 cnf(i_0_26, plain, (member(esk2_2(X1,X2),X2)|~member(X1,sum(X2)))).
% 0.18/0.50 cnf(i_0_27, plain, (member(X1,product(X2))|~member(X1,esk3_2(X1,X2)))).
% 0.18/0.50 cnf(i_0_14, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3)))).
% 0.18/0.50 cnf(i_0_29, plain, (member(X1,X2)|~member(X1,product(X3))|~member(X2,X3))).
% 0.18/0.50 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.50 # Begin printing tableau
% 0.18/0.50 # Found 5 steps
% 0.18/0.50 cnf(i_0_31, negated_conjecture, (~subset(intersection(esk4_0,difference(esk7_0,esk5_0)),intersection(esk6_0,difference(esk7_0,esk6_0)))|~subset(esk4_0,esk5_0)), inference(start_rule)).
% 0.18/0.50 cnf(i_0_38, plain, (~subset(esk4_0,esk5_0)), inference(extension_rule, [i_0_2])).
% 0.18/0.50 cnf(i_0_126, plain, (member(esk1_2(esk4_0,esk5_0),esk4_0)), inference(extension_rule, [i_0_17])).
% 0.18/0.50 cnf(i_0_37, plain, (~subset(intersection(esk4_0,difference(esk7_0,esk5_0)),intersection(esk6_0,difference(esk7_0,esk6_0)))), inference(etableau_closure_rule, [i_0_37, ...])).
% 0.18/0.50 cnf(i_0_181, plain, (~member(esk1_2(esk4_0,esk5_0),difference(X5,esk4_0))), inference(etableau_closure_rule, [i_0_181, ...])).
% 0.18/0.50 # End printing tableau
% 0.18/0.50 # SZS output end
% 0.18/0.50 # Branches closed with saturation will be marked with an "s"
% 0.18/0.50 # Child (5517) has found a proof.
% 0.18/0.50
% 0.18/0.50 # Proof search is over...
% 0.18/0.50 # Freeing feature tree
%------------------------------------------------------------------------------