TSTP Solution File: SEU140+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU140+1 : TPTP v8.1.0. Released v3.3.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 : n032.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:06 EDT 2022
% Result : Theorem 0.14s 0.33s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SEU140+1 : TPTP v8.1.0. Released v3.3.0.
% 0.02/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Sun Jun 19 04:59:32 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.14/0.33 # No SInE strategy applied
% 0.14/0.33 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.33 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.33 #
% 0.14/0.33 # Presaturation interreduction done
% 0.14/0.33 # Number of axioms: 19 Number of unprocessed: 19
% 0.14/0.33 # Tableaux proof search.
% 0.14/0.33 # APR header successfully linked.
% 0.14/0.33 # Hello from C++
% 0.14/0.33 # The folding up rule is enabled...
% 0.14/0.33 # Local unification is enabled...
% 0.14/0.33 # Any saturation attempts will use folding labels...
% 0.14/0.33 # 19 beginning clauses after preprocessing and clausification
% 0.14/0.33 # Creating start rules for all 3 conjectures.
% 0.14/0.33 # There are 3 start rule candidates:
% 0.14/0.33 # Found 10 unit axioms.
% 0.14/0.33 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.33 # 3 start rule tableaux created.
% 0.14/0.33 # 9 extension rule candidate clauses
% 0.14/0.33 # 10 unit axiom clauses
% 0.14/0.33
% 0.14/0.33 # Requested 8, 32 cores available to the main process.
% 0.14/0.33 # There are not enough tableaux to fork, creating more from the initial 3
% 0.14/0.33 # There were 1 total branch saturation attempts.
% 0.14/0.33 # There were 0 of these attempts blocked.
% 0.14/0.33 # There were 0 deferred branch saturation attempts.
% 0.14/0.33 # There were 0 free duplicated saturations.
% 0.14/0.33 # There were 1 total successful branch saturations.
% 0.14/0.33 # There were 0 successful branch saturations in interreduction.
% 0.14/0.33 # There were 0 successful branch saturations on the branch.
% 0.14/0.33 # There were 1 successful branch saturations after the branch.
% 0.14/0.33 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.33 # Begin clausification derivation
% 0.14/0.33
% 0.14/0.33 # End clausification derivation
% 0.14/0.33 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.33 cnf(i_0_17, negated_conjecture, (disjoint(esk4_0,esk5_0))).
% 0.14/0.33 cnf(i_0_18, negated_conjecture, (subset(esk3_0,esk4_0))).
% 0.14/0.33 cnf(i_0_7, plain, (empty(empty_set))).
% 0.14/0.33 cnf(i_0_9, plain, (empty(esk1_0))).
% 0.14/0.33 cnf(i_0_11, plain, (subset(X1,X1))).
% 0.14/0.33 cnf(i_0_14, plain, (set_intersection2(X1,empty_set)=empty_set)).
% 0.14/0.33 cnf(i_0_8, plain, (set_intersection2(X1,X1)=X1)).
% 0.14/0.33 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.14/0.33 cnf(i_0_16, negated_conjecture, (~disjoint(esk3_0,esk5_0))).
% 0.14/0.33 cnf(i_0_10, plain, (~empty(esk2_0))).
% 0.14/0.33 cnf(i_0_20, plain, (~empty(X1)|~in(X2,X1))).
% 0.14/0.33 cnf(i_0_19, plain, (X1=empty_set|~empty(X1))).
% 0.14/0.33 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.14/0.33 cnf(i_0_15, plain, (X1=empty_set|~subset(X1,empty_set))).
% 0.14/0.33 cnf(i_0_12, plain, (disjoint(X1,X2)|~disjoint(X2,X1))).
% 0.14/0.33 cnf(i_0_3, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)).
% 0.14/0.33 cnf(i_0_4, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))).
% 0.14/0.33 cnf(i_0_21, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.14/0.33 cnf(i_0_13, plain, (subset(set_intersection2(X1,X2),set_intersection2(X3,X2))|~subset(X1,X3))).
% 0.14/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.33 # Begin printing tableau
% 0.14/0.33 # Found 4 steps
% 0.14/0.33 cnf(i_0_17, negated_conjecture, (disjoint(esk4_0,esk5_0)), inference(start_rule)).
% 0.14/0.33 cnf(i_0_24, plain, (disjoint(esk4_0,esk5_0)), inference(extension_rule, [i_0_12])).
% 0.14/0.33 cnf(i_0_71, plain, (disjoint(esk5_0,esk4_0)), inference(extension_rule, [i_0_4])).
% 0.14/0.33 cnf(i_0_113, plain, (set_intersection2(esk5_0,esk4_0)=empty_set), inference(etableau_closure_rule, [i_0_113, ...])).
% 0.14/0.33 # End printing tableau
% 0.14/0.33 # SZS output end
% 0.14/0.33 # Branches closed with saturation will be marked with an "s"
% 0.14/0.33 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.33 # We now have 4 tableaux to operate on
% 0.14/0.33 # Found closed tableau during pool population.
% 0.14/0.33 # Proof search is over...
% 0.14/0.33 # Freeing feature tree
%------------------------------------------------------------------------------