TSTP Solution File: SEU254+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU254+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 : n026.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:25:14 EDT 2022
% Result : Theorem 1.13s 0.52s
% Output : CNFRefutation 1.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SEU254+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/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.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 00:31:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 40 Number of unprocessed: 40
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 40 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 3 conjectures.
% 0.13/0.38 # There are 3 start rule candidates:
% 0.13/0.38 # Found 20 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 3 start rule tableaux created.
% 0.13/0.38 # 20 extension rule candidate clauses
% 0.13/0.38 # 20 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 3
% 0.13/0.38 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 14 tableaux to operate on
% 0.13/0.39 # Creating equality axioms
% 0.13/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.39 # Creating equality axioms
% 0.13/0.39 # Ran out of tableaux, making start rules for all clauses
% 1.13/0.52 # There were 2 total branch saturation attempts.
% 1.13/0.52 # There were 0 of these attempts blocked.
% 1.13/0.52 # There were 0 deferred branch saturation attempts.
% 1.13/0.52 # There were 0 free duplicated saturations.
% 1.13/0.52 # There were 2 total successful branch saturations.
% 1.13/0.52 # There were 0 successful branch saturations in interreduction.
% 1.13/0.52 # There were 0 successful branch saturations on the branch.
% 1.13/0.52 # There were 2 successful branch saturations after the branch.
% 1.13/0.52 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.13/0.52 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.13/0.52 # Begin clausification derivation
% 1.13/0.52
% 1.13/0.52 # End clausification derivation
% 1.13/0.52 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.13/0.52 cnf(i_0_45, negated_conjecture, (relation(esk11_0))).
% 1.13/0.52 cnf(i_0_44, negated_conjecture, (transitive(esk11_0))).
% 1.13/0.52 cnf(i_0_27, plain, (relation(esk5_0))).
% 1.13/0.52 cnf(i_0_31, plain, (relation(esk7_0))).
% 1.13/0.52 cnf(i_0_19, plain, (empty(empty_set))).
% 1.13/0.52 cnf(i_0_35, plain, (relation(esk9_0))).
% 1.13/0.52 cnf(i_0_28, plain, (empty(esk6_0))).
% 1.13/0.52 cnf(i_0_30, plain, (empty(esk7_0))).
% 1.13/0.52 cnf(i_0_26, plain, (function(esk5_0))).
% 1.13/0.52 cnf(i_0_29, plain, (function(esk7_0))).
% 1.13/0.52 cnf(i_0_34, plain, (function(esk9_0))).
% 1.13/0.52 cnf(i_0_33, plain, (one_to_one(esk9_0))).
% 1.13/0.52 cnf(i_0_46, plain, (set_intersection2(X1,empty_set)=empty_set)).
% 1.13/0.52 cnf(i_0_21, plain, (set_intersection2(X1,X1)=X1)).
% 1.13/0.52 cnf(i_0_18, plain, (element(esk1_1(X1),X1))).
% 1.13/0.52 cnf(i_0_6, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 1.13/0.52 cnf(i_0_7, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 1.13/0.52 cnf(i_0_43, negated_conjecture, (~transitive(relation_restriction(esk11_0,esk10_0)))).
% 1.13/0.52 cnf(i_0_32, plain, (~empty(esk8_0))).
% 1.13/0.52 cnf(i_0_20, plain, (~empty(unordered_pair(singleton(X1),unordered_pair(X1,X2))))).
% 1.13/0.52 cnf(i_0_49, plain, (~empty(X1)|~in(X2,X1))).
% 1.13/0.52 cnf(i_0_48, plain, (X1=empty_set|~empty(X1))).
% 1.13/0.52 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 1.13/0.52 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 1.13/0.52 cnf(i_0_42, plain, (element(X1,X2)|~in(X1,X2))).
% 1.13/0.52 cnf(i_0_3, plain, (one_to_one(X1)|~relation(X1)|~empty(X1))).
% 1.13/0.52 cnf(i_0_13, plain, (relation(relation_restriction(X1,X2))|~relation(X1))).
% 1.13/0.52 cnf(i_0_50, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 1.13/0.52 cnf(i_0_41, plain, (in(X1,X2)|~relation(X2)|~in(X1,relation_restriction(X2,X3)))).
% 1.13/0.52 cnf(i_0_47, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 1.13/0.52 cnf(i_0_37, plain, (in(X1,X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)))).
% 1.13/0.52 cnf(i_0_38, plain, (in(X1,X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4)))).
% 1.13/0.52 cnf(i_0_9, plain, (set_intersection2(X1,cartesian_product2(X2,X2))=relation_restriction(X1,X2)|~relation(X1))).
% 1.13/0.52 cnf(i_0_40, plain, (in(X1,cartesian_product2(X2,X2))|~relation(X3)|~in(X1,relation_restriction(X3,X2)))).
% 1.13/0.52 cnf(i_0_22, plain, (transitive(X1)|~relation(X1)|~in(unordered_pair(singleton(esk2_1(X1)),unordered_pair(esk2_1(X1),esk4_1(X1))),X1))).
% 1.13/0.52 cnf(i_0_39, plain, (in(X1,relation_restriction(X2,X3))|~relation(X2)|~in(X1,cartesian_product2(X3,X3))|~in(X1,X2))).
% 1.13/0.52 cnf(i_0_24, plain, (transitive(X1)|in(unordered_pair(singleton(esk2_1(X1)),unordered_pair(esk2_1(X1),esk3_1(X1))),X1)|~relation(X1))).
% 1.13/0.52 cnf(i_0_36, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 1.13/0.52 cnf(i_0_23, plain, (transitive(X1)|in(unordered_pair(singleton(esk3_1(X1)),unordered_pair(esk3_1(X1),esk4_1(X1))),X1)|~relation(X1))).
% 1.13/0.52 cnf(i_0_25, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X3)|~transitive(X3)|~relation(X3)|~in(unordered_pair(singleton(X4),unordered_pair(X4,X2)),X3)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X4)),X3))).
% 1.13/0.52 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.13/0.52 # Begin printing tableau
% 1.13/0.52 # Found 8 steps
% 1.13/0.52 cnf(i_0_43, negated_conjecture, (~transitive(relation_restriction(esk11_0,esk10_0))), inference(start_rule)).
% 1.13/0.52 cnf(i_0_51, plain, (~transitive(relation_restriction(esk11_0,esk10_0))), inference(extension_rule, [i_0_22])).
% 1.13/0.52 cnf(i_0_88, plain, (~relation(relation_restriction(esk11_0,esk10_0))), inference(extension_rule, [i_0_13])).
% 1.13/0.52 cnf(i_0_4863, plain, (~relation(esk11_0)), inference(closure_rule, [i_0_45])).
% 1.13/0.52 cnf(i_0_89, plain, (~in(unordered_pair(singleton(esk2_1(relation_restriction(esk11_0,esk10_0))),unordered_pair(esk2_1(relation_restriction(esk11_0,esk10_0)),esk4_1(relation_restriction(esk11_0,esk10_0)))),relation_restriction(esk11_0,esk10_0))), inference(extension_rule, [i_0_39])).
% 1.13/0.52 cnf(i_0_4890, plain, (~relation(esk11_0)), inference(closure_rule, [i_0_45])).
% 1.13/0.52 cnf(i_0_4891, plain, (~in(unordered_pair(singleton(esk2_1(relation_restriction(esk11_0,esk10_0))),unordered_pair(esk2_1(relation_restriction(esk11_0,esk10_0)),esk4_1(relation_restriction(esk11_0,esk10_0)))),cartesian_product2(esk10_0,esk10_0))), inference(etableau_closure_rule, [i_0_4891, ...])).
% 1.13/0.52 cnf(i_0_4892, plain, (~in(unordered_pair(singleton(esk2_1(relation_restriction(esk11_0,esk10_0))),unordered_pair(esk2_1(relation_restriction(esk11_0,esk10_0)),esk4_1(relation_restriction(esk11_0,esk10_0)))),esk11_0)), inference(etableau_closure_rule, [i_0_4892, ...])).
% 1.13/0.52 # End printing tableau
% 1.13/0.52 # SZS output end
% 1.13/0.52 # Branches closed with saturation will be marked with an "s"
% 1.13/0.53 # Child (23976) has found a proof.
% 1.13/0.53
% 1.13/0.53 # Proof search is over...
% 1.13/0.53 # Freeing feature tree
%------------------------------------------------------------------------------