TSTP Solution File: SEU189+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU189+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 : n006.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:37 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.12 % Problem : SEU189+1 : TPTP v8.1.0. Released v3.3.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 : n006.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 : Mon Jun 20 11:17:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 30 Number of unprocessed: 29
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # 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 # 29 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 3 conjectures.
% 0.12/0.37 # There are 3 start rule candidates:
% 0.12/0.37 # Found 12 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 3 start rule tableaux created.
% 0.12/0.37 # 17 extension rule candidate clauses
% 0.12/0.37 # 12 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 3
% 0.12/0.37 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 11 tableaux to operate on
% 0.12/0.37 # There were 2 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 2 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 2 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/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_32, plain, (relation_dom(empty_set)=empty_set)).
% 0.12/0.37 cnf(i_0_31, plain, (relation_rng(empty_set)=empty_set)).
% 0.12/0.37 cnf(i_0_24, plain, (relation(empty_set))).
% 0.12/0.37 cnf(i_0_30, negated_conjecture, (relation(esk6_0))).
% 0.12/0.37 cnf(i_0_25, plain, (empty(empty_set))).
% 0.12/0.37 cnf(i_0_7, plain, (empty(esk2_0))).
% 0.12/0.37 cnf(i_0_6, plain, (relation(esk2_0))).
% 0.12/0.37 cnf(i_0_9, plain, (relation(esk3_0))).
% 0.12/0.37 cnf(i_0_17, plain, (empty(esk4_0))).
% 0.12/0.37 cnf(i_0_1, plain, (element(esk1_1(X1),X1))).
% 0.12/0.37 cnf(i_0_10, plain, (~empty(esk3_0))).
% 0.12/0.37 cnf(i_0_18, plain, (~empty(esk5_0))).
% 0.12/0.37 cnf(i_0_29, negated_conjecture, (relation_dom(esk6_0)!=empty_set|relation_rng(esk6_0)!=empty_set)).
% 0.12/0.37 cnf(i_0_19, plain, (~in(X1,X2)|~empty(X2))).
% 0.12/0.37 cnf(i_0_28, negated_conjecture, (relation_rng(esk6_0)=empty_set|relation_dom(esk6_0)=empty_set)).
% 0.12/0.37 cnf(i_0_34, plain, (X1=empty_set|relation_dom(X1)!=empty_set|~relation(X1))).
% 0.12/0.37 cnf(i_0_33, plain, (X1=empty_set|relation_rng(X1)!=empty_set|~relation(X1))).
% 0.12/0.37 cnf(i_0_27, plain, (X1=empty_set|~empty(X1))).
% 0.12/0.37 cnf(i_0_8, plain, (relation(X1)|~empty(X1))).
% 0.12/0.37 cnf(i_0_4, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.12/0.37 cnf(i_0_11, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))).
% 0.12/0.37 cnf(i_0_12, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))).
% 0.12/0.37 cnf(i_0_13, plain, (relation(relation_dom(X1))|~empty(X1))).
% 0.12/0.37 cnf(i_0_15, plain, (relation(relation_rng(X1))|~empty(X1))).
% 0.12/0.37 cnf(i_0_14, plain, (empty(relation_dom(X1))|~empty(X1))).
% 0.12/0.37 cnf(i_0_16, plain, (empty(relation_rng(X1))|~empty(X1))).
% 0.12/0.37 cnf(i_0_20, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.12/0.37 cnf(i_0_5, plain, (element(X1,X2)|~in(X1,X2))).
% 0.12/0.37 cnf(i_0_3, plain, (in(X1,X2)|empty(X2)|~element(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 5 steps
% 0.12/0.37 cnf(i_0_30, negated_conjecture, (relation(esk6_0)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_39, plain, (relation(esk6_0)), inference(extension_rule, [i_0_11])).
% 0.12/0.37 cnf(i_0_298, plain, (empty(esk6_0)), inference(extension_rule, [i_0_19])).
% 0.12/0.37 cnf(i_0_300, plain, (~empty(relation_dom(esk6_0))), inference(etableau_closure_rule, [i_0_300, ...])).
% 0.12/0.37 cnf(i_0_301, plain, (~in(X3,esk6_0)), inference(etableau_closure_rule, [i_0_301, ...])).
% 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 # Child (4534) has found a proof.
% 0.12/0.37
% 0.12/0.38 # Proof search is over...
% 0.12/0.38 # Freeing feature tree
%------------------------------------------------------------------------------