TSTP Solution File: SEU263+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU263+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 : n007.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:19 EDT 2022
% Result : Theorem 0.20s 0.41s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU263+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.36 % Computer : n007.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 600
% 0.13/0.36 % DateTime : Sun Jun 19 20:21:44 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.20/0.39 # No SInE strategy applied
% 0.20/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.39 #
% 0.20/0.39 # Presaturation interreduction done
% 0.20/0.39 # Number of axioms: 20 Number of unprocessed: 20
% 0.20/0.39 # Tableaux proof search.
% 0.20/0.39 # APR header successfully linked.
% 0.20/0.39 # Hello from C++
% 0.20/0.39 # The folding up rule is enabled...
% 0.20/0.39 # Local unification is enabled...
% 0.20/0.39 # Any saturation attempts will use folding labels...
% 0.20/0.39 # 20 beginning clauses after preprocessing and clausification
% 0.20/0.39 # Creating start rules for all 3 conjectures.
% 0.20/0.39 # There are 3 start rule candidates:
% 0.20/0.39 # Found 7 unit axioms.
% 0.20/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.39 # 3 start rule tableaux created.
% 0.20/0.39 # 13 extension rule candidate clauses
% 0.20/0.39 # 7 unit axiom clauses
% 0.20/0.39
% 0.20/0.39 # Requested 8, 32 cores available to the main process.
% 0.20/0.39 # There are not enough tableaux to fork, creating more from the initial 3
% 0.20/0.39 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.39 # We now have 10 tableaux to operate on
% 0.20/0.41 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.41 # There were 1 total branch saturation attempts.
% 0.20/0.41 # There were 0 of these attempts blocked.
% 0.20/0.41 # There were 0 deferred branch saturation attempts.
% 0.20/0.41 # There were 0 free duplicated saturations.
% 0.20/0.41 # There were 1 total successful branch saturations.
% 0.20/0.41 # There were 0 successful branch saturations in interreduction.
% 0.20/0.41 # There were 0 successful branch saturations on the branch.
% 0.20/0.41 # There were 1 successful branch saturations after the branch.
% 0.20/0.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.41 # Begin clausification derivation
% 0.20/0.41
% 0.20/0.41 # End clausification derivation
% 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.41 cnf(i_0_21, negated_conjecture, (subset(relation_rng(esk7_0),esk5_0))).
% 0.20/0.41 cnf(i_0_22, negated_conjecture, (relation_of2_as_subset(esk7_0,esk6_0,esk4_0))).
% 0.20/0.41 cnf(i_0_16, plain, (subset(X1,X1))).
% 0.20/0.41 cnf(i_0_12, plain, (element(esk2_1(X1),X1))).
% 0.20/0.41 cnf(i_0_13, plain, (relation_of2_as_subset(esk3_2(X1,X2),X1,X2))).
% 0.20/0.41 cnf(i_0_11, plain, (relation_of2(esk1_2(X1,X2),X1,X2))).
% 0.20/0.41 cnf(i_0_20, negated_conjecture, (~relation_of2_as_subset(esk7_0,esk6_0,esk5_0))).
% 0.20/0.41 cnf(i_0_25, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.20/0.41 cnf(i_0_26, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.20/0.41 cnf(i_0_14, plain, (relation_of2_as_subset(X1,X2,X3)|~relation_of2(X1,X2,X3))).
% 0.20/0.41 cnf(i_0_1, plain, (relation(X1)|~element(X1,powerset(cartesian_product2(X2,X3))))).
% 0.20/0.41 cnf(i_0_15, plain, (relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3))).
% 0.20/0.41 cnf(i_0_18, plain, (subset(relation_rng(X1),X2)|~relation_of2_as_subset(X1,X3,X2))).
% 0.20/0.41 cnf(i_0_23, plain, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))).
% 0.20/0.41 cnf(i_0_19, plain, (subset(relation_dom(X1),X2)|~relation_of2_as_subset(X1,X2,X3))).
% 0.20/0.41 cnf(i_0_3, plain, (subset(X1,cartesian_product2(X2,X3))|~relation_of2(X1,X2,X3))).
% 0.20/0.41 cnf(i_0_24, plain, (subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1)))|~relation(X1))).
% 0.20/0.41 cnf(i_0_2, plain, (relation_of2(X1,X2,X3)|~subset(X1,cartesian_product2(X2,X3)))).
% 0.20/0.41 cnf(i_0_10, plain, (element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3))).
% 0.20/0.41 cnf(i_0_17, plain, (subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|~subset(X2,X4)|~subset(X1,X3))).
% 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.41 # Begin printing tableau
% 0.20/0.41 # Found 6 steps
% 0.20/0.41 cnf(i_0_17, plain, (subset(cartesian_product2(relation_rng(esk7_0),relation_rng(esk7_0)),cartesian_product2(esk5_0,esk5_0))|~subset(relation_rng(esk7_0),esk5_0)|~subset(relation_rng(esk7_0),esk5_0)), inference(start_rule)).
% 0.20/0.41 cnf(i_0_175, plain, (~subset(relation_rng(esk7_0),esk5_0)), inference(closure_rule, [i_0_21])).
% 0.20/0.41 cnf(i_0_176, plain, (~subset(relation_rng(esk7_0),esk5_0)), inference(closure_rule, [i_0_21])).
% 0.20/0.41 cnf(i_0_174, plain, (subset(cartesian_product2(relation_rng(esk7_0),relation_rng(esk7_0)),cartesian_product2(esk5_0,esk5_0))), inference(extension_rule, [i_0_25])).
% 0.20/0.41 cnf(i_0_177, plain, (element(cartesian_product2(relation_rng(esk7_0),relation_rng(esk7_0)),powerset(cartesian_product2(esk5_0,esk5_0)))), inference(extension_rule, [i_0_1])).
% 0.20/0.41 cnf(i_0_183, plain, (relation(cartesian_product2(relation_rng(esk7_0),relation_rng(esk7_0)))), inference(etableau_closure_rule, [i_0_183, ...])).
% 0.20/0.41 # End printing tableau
% 0.20/0.41 # SZS output end
% 0.20/0.41 # Branches closed with saturation will be marked with an "s"
% 0.20/0.42 # Child (23040) has found a proof.
% 0.20/0.42
% 0.20/0.42 # Proof search is over...
% 0.20/0.42 # Freeing feature tree
%------------------------------------------------------------------------------