TSTP Solution File: SEU164+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU164+3 : TPTP v8.1.0. Bugfixed v4.0.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 : n012.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 09:24:23 EDT 2022
% Result : Theorem 1.24s 1.44s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU164+3 : TPTP v8.1.0. Bugfixed v4.0.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.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 03:16:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic C07_19_nc_SAT001_MinMin_rr
% 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: 26 Number of unprocessed: 26
% 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 # 26 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 1 conjectures.
% 0.12/0.37 # There are 1 start rule candidates:
% 0.12/0.37 # Found 5 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 21 extension rule candidate clauses
% 0.12/0.37 # 5 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 1
% 1.24/1.44 # There were 4 total branch saturation attempts.
% 1.24/1.44 # There were 0 of these attempts blocked.
% 1.24/1.44 # There were 0 deferred branch saturation attempts.
% 1.24/1.44 # There were 2 free duplicated saturations.
% 1.24/1.44 # There were 4 total successful branch saturations.
% 1.24/1.44 # There were 0 successful branch saturations in interreduction.
% 1.24/1.44 # There were 0 successful branch saturations on the branch.
% 1.24/1.44 # There were 2 successful branch saturations after the branch.
% 1.24/1.44 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.24/1.44 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.24/1.44 # Begin clausification derivation
% 1.24/1.44
% 1.24/1.44 # End clausification derivation
% 1.24/1.44 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.24/1.44 cnf(i_0_21, plain, (empty(esk7_0))).
% 1.24/1.44 cnf(i_0_23, plain, (subset(X1,X1))).
% 1.24/1.44 cnf(i_0_4, plain, (in(X1,singleton(X1)))).
% 1.24/1.44 cnf(i_0_26, negated_conjecture, (union(powerset(esk10_0))!=esk10_0)).
% 1.24/1.44 cnf(i_0_22, plain, (~empty(esk8_0))).
% 1.24/1.44 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 1.24/1.44 cnf(i_0_20, plain, (in(X1,X2)|~subset(singleton(X1),X2))).
% 1.24/1.44 cnf(i_0_10, plain, (subset(X1,X2)|~in(esk3_2(X1,X2),X2))).
% 1.24/1.44 cnf(i_0_19, plain, (subset(singleton(X1),X2)|~in(X1,X2))).
% 1.24/1.44 cnf(i_0_5, plain, (X1=X2|~in(X1,singleton(X2)))).
% 1.24/1.44 cnf(i_0_3, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))).
% 1.24/1.44 cnf(i_0_8, plain, (in(X1,powerset(X2))|~subset(X1,X2))).
% 1.24/1.44 cnf(i_0_9, plain, (subset(X1,X2)|~in(X1,powerset(X2)))).
% 1.24/1.44 cnf(i_0_11, plain, (subset(X1,X2)|in(esk3_2(X1,X2),X1))).
% 1.24/1.44 cnf(i_0_12, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))).
% 1.24/1.44 cnf(i_0_25, plain, (X1=X2|~in(esk9_2(X1,X2),X2)|~in(esk9_2(X1,X2),X1))).
% 1.24/1.44 cnf(i_0_7, plain, (X1=powerset(X2)|~subset(esk2_2(X2,X1),X2)|~in(esk2_2(X2,X1),X1))).
% 1.24/1.44 cnf(i_0_2, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))).
% 1.24/1.44 cnf(i_0_16, plain, (in(X1,union(X2))|~in(X3,X2)|~in(X1,X3))).
% 1.24/1.44 cnf(i_0_18, plain, (in(X1,esk4_3(X2,union(X2),X1))|~in(X1,union(X2)))).
% 1.24/1.44 cnf(i_0_17, plain, (in(esk4_3(X1,union(X1),X2),X1)|~in(X2,union(X1)))).
% 1.24/1.44 cnf(i_0_24, plain, (X1=X2|in(esk9_2(X1,X2),X1)|in(esk9_2(X1,X2),X2))).
% 1.24/1.44 cnf(i_0_15, plain, (X1=union(X2)|~in(esk5_2(X2,X1),X3)|~in(esk5_2(X2,X1),X1)|~in(X3,X2))).
% 1.24/1.44 cnf(i_0_6, plain, (X1=powerset(X2)|subset(esk2_2(X2,X1),X2)|in(esk2_2(X2,X1),X1))).
% 1.24/1.44 cnf(i_0_13, plain, (X1=union(X2)|in(esk6_2(X2,X1),X2)|in(esk5_2(X2,X1),X1))).
% 1.24/1.44 cnf(i_0_14, plain, (X1=union(X2)|in(esk5_2(X2,X1),esk6_2(X2,X1))|in(esk5_2(X2,X1),X1))).
% 1.24/1.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.24/1.44 # Begin printing tableau
% 1.24/1.44 # Found 5 steps
% 1.24/1.44 cnf(i_0_26, negated_conjecture, (union(powerset(esk10_0))!=esk10_0), inference(start_rule)).
% 1.24/1.44 cnf(i_0_35, plain, (union(powerset(esk10_0))!=esk10_0), inference(extension_rule, [i_0_14])).
% 1.24/1.44 cnf(i_0_88, plain, (in(esk5_2(powerset(esk10_0),esk10_0),esk6_2(powerset(esk10_0),esk10_0))), inference(extension_rule, [i_0_1])).
% 1.24/1.44 cnf(i_0_89, plain, (in(esk5_2(powerset(esk10_0),esk10_0),esk10_0)), inference(etableau_closure_rule, [i_0_89, ...])).
% 1.24/1.44 cnf(i_0_90, plain, (~in(esk6_2(powerset(esk10_0),esk10_0),esk5_2(powerset(esk10_0),esk10_0))), inference(etableau_closure_rule, [i_0_90, ...])).
% 1.24/1.44 # End printing tableau
% 1.24/1.44 # SZS output end
% 1.24/1.44 # Branches closed with saturation will be marked with an "s"
% 1.24/1.44 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 1.24/1.44 # We now have 7 tableaux to operate on
% 1.24/1.44 # Found closed tableau during pool population.
% 1.24/1.44 # Proof search is over...
% 1.24/1.44 # Freeing feature tree
%------------------------------------------------------------------------------