TSTP Solution File: SET155+4 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET155+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 : n025.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:58:24 EDT 2022
% Result : Theorem 12.30s 1.94s
% Output : CNFRefutation 12.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET155+4 : TPTP v8.1.0. Released v2.2.0.
% 0.11/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 : n025.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 04:45:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 32 Number of unprocessed: 32
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 32 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 3 conjectures.
% 0.13/0.37 # There are 3 start rule candidates:
% 0.13/0.37 # Found 7 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 3 start rule tableaux created.
% 0.13/0.37 # 25 extension rule candidate clauses
% 0.13/0.37 # 7 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.13/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 9 tableaux to operate on
% 12.30/1.94 # There were 3 total branch saturation attempts.
% 12.30/1.94 # There were 0 of these attempts blocked.
% 12.30/1.94 # There were 0 deferred branch saturation attempts.
% 12.30/1.94 # There were 0 free duplicated saturations.
% 12.30/1.94 # There were 2 total successful branch saturations.
% 12.30/1.94 # There were 0 successful branch saturations in interreduction.
% 12.30/1.94 # There were 0 successful branch saturations on the branch.
% 12.30/1.94 # There were 2 successful branch saturations after the branch.
% 12.30/1.94 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.30/1.94 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.30/1.94 # Begin clausification derivation
% 12.30/1.94
% 12.30/1.94 # End clausification derivation
% 12.30/1.94 # Begin listing active clauses obtained from FOF to CNF conversion
% 12.30/1.94 cnf(i_0_32, negated_conjecture, (subset(esk4_0,esk6_0))).
% 12.30/1.94 cnf(i_0_31, negated_conjecture, (subset(esk5_0,esk6_0))).
% 12.30/1.94 cnf(i_0_19, plain, (member(X1,singleton(X1)))).
% 12.30/1.94 cnf(i_0_21, plain, (member(X1,unordered_pair(X2,X1)))).
% 12.30/1.94 cnf(i_0_22, plain, (member(X1,unordered_pair(X1,X2)))).
% 12.30/1.94 cnf(i_0_30, negated_conjecture, (~equal_set(difference(esk6_0,union(esk4_0,esk5_0)),intersection(difference(esk6_0,esk4_0),difference(esk6_0,esk5_0))))).
% 12.30/1.94 cnf(i_0_15, plain, (~member(X1,empty_set))).
% 12.30/1.94 cnf(i_0_5, plain, (subset(X1,X2)|~equal_set(X2,X1))).
% 12.30/1.94 cnf(i_0_6, plain, (subset(X1,X2)|~equal_set(X1,X2))).
% 12.30/1.94 cnf(i_0_17, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))).
% 12.30/1.94 cnf(i_0_20, plain, (X1=X2|~member(X1,singleton(X2)))).
% 12.30/1.94 cnf(i_0_7, plain, (member(X1,power_set(X2))|~subset(X1,X2))).
% 12.30/1.94 cnf(i_0_8, plain, (subset(X1,X2)|~member(X1,power_set(X2)))).
% 12.30/1.94 cnf(i_0_4, plain, (equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2))).
% 12.30/1.94 cnf(i_0_1, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))).
% 12.30/1.94 cnf(i_0_10, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))).
% 12.30/1.94 cnf(i_0_11, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))).
% 12.30/1.94 cnf(i_0_3, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))).
% 12.30/1.94 cnf(i_0_18, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))).
% 12.30/1.94 cnf(i_0_27, plain, (member(X1,product(X2))|~member(X1,esk3_2(X1,X2)))).
% 12.30/1.94 cnf(i_0_23, plain, (X1=X2|X1=X3|~member(X1,unordered_pair(X2,X3)))).
% 12.30/1.94 cnf(i_0_2, plain, (member(esk1_2(X1,X2),X1)|subset(X1,X2))).
% 12.30/1.94 cnf(i_0_12, plain, (member(X1,union(X2,X3))|~member(X1,X3))).
% 12.30/1.94 cnf(i_0_13, plain, (member(X1,union(X2,X3))|~member(X1,X2))).
% 12.30/1.94 cnf(i_0_28, plain, (member(esk3_2(X1,X2),X2)|member(X1,product(X2)))).
% 12.30/1.94 cnf(i_0_25, plain, (member(X1,esk2_2(X1,X2))|~member(X1,sum(X2)))).
% 12.30/1.94 cnf(i_0_26, plain, (member(esk2_2(X1,X2),X2)|~member(X1,sum(X2)))).
% 12.30/1.94 cnf(i_0_14, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3)))).
% 12.30/1.94 cnf(i_0_29, plain, (member(X1,X2)|~member(X1,product(X3))|~member(X2,X3))).
% 12.30/1.94 cnf(i_0_9, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))).
% 12.30/1.94 cnf(i_0_16, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))).
% 12.30/1.94 cnf(i_0_24, plain, (member(X1,sum(X2))|~member(X1,X3)|~member(X3,X2))).
% 12.30/1.94 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 12.30/1.94 # Begin printing tableau
% 12.30/1.94 # Found 5 steps
% 12.30/1.94 cnf(i_0_30, negated_conjecture, (~equal_set(difference(esk6_0,union(esk4_0,esk5_0)),intersection(difference(esk6_0,esk4_0),difference(esk6_0,esk5_0)))), inference(start_rule)).
% 12.30/1.94 cnf(i_0_36, plain, (~equal_set(difference(esk6_0,union(esk4_0,esk5_0)),intersection(difference(esk6_0,esk4_0),difference(esk6_0,esk5_0)))), inference(extension_rule, [i_0_4])).
% 12.30/1.94 cnf(i_0_52, plain, (~subset(intersection(difference(esk6_0,esk4_0),difference(esk6_0,esk5_0)),difference(esk6_0,union(esk4_0,esk5_0)))), inference(extension_rule, [i_0_6])).
% 12.30/1.94 cnf(i_0_53, plain, (~subset(difference(esk6_0,union(esk4_0,esk5_0)),intersection(difference(esk6_0,esk4_0),difference(esk6_0,esk5_0)))), inference(etableau_closure_rule, [i_0_53, ...])).
% 12.30/1.94 cnf(i_0_126259, plain, (~equal_set(intersection(difference(esk6_0,esk4_0),difference(esk6_0,esk5_0)),difference(esk6_0,union(esk4_0,esk5_0)))), inference(etableau_closure_rule, [i_0_126259, ...])).
% 12.30/1.94 # End printing tableau
% 12.30/1.94 # SZS output end
% 12.30/1.94 # Branches closed with saturation will be marked with an "s"
% 12.30/1.95 # Child (31416) has found a proof.
% 12.30/1.95
% 12.30/1.95 # Proof search is over...
% 12.30/1.95 # Freeing feature tree
%------------------------------------------------------------------------------