TSTP Solution File: SYO607+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYO607+1 : TPTP v8.1.0. Released v7.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 : 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 : Thu Jul 21 16:05:43 EDT 2022
% Result : Theorem 0.21s 0.44s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYO607+1 : TPTP v8.1.0. Released v7.0.0.
% 0.08/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Fri Jul 8 19:41:15 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.14/0.39 # No SInE strategy applied
% 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.39 #
% 0.14/0.39 # Presaturation interreduction done
% 0.14/0.39 # Number of axioms: 16 Number of unprocessed: 16
% 0.14/0.39 # Tableaux proof search.
% 0.14/0.39 # APR header successfully linked.
% 0.14/0.39 # Hello from C++
% 0.14/0.40 # The folding up rule is enabled...
% 0.14/0.40 # Local unification is enabled...
% 0.14/0.40 # Any saturation attempts will use folding labels...
% 0.14/0.40 # 16 beginning clauses after preprocessing and clausification
% 0.14/0.40 # Creating start rules for all 6 conjectures.
% 0.14/0.40 # There are 6 start rule candidates:
% 0.14/0.40 # Found 1 unit axioms.
% 0.14/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.40 # 6 start rule tableaux created.
% 0.14/0.40 # 15 extension rule candidate clauses
% 0.14/0.40 # 1 unit axiom clauses
% 0.14/0.40
% 0.14/0.40 # Requested 8, 32 cores available to the main process.
% 0.14/0.40 # There are not enough tableaux to fork, creating more from the initial 6
% 0.14/0.40 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.40 # We now have 15 tableaux to operate on
% 0.21/0.44 # There were 2 total branch saturation attempts.
% 0.21/0.44 # There were 0 of these attempts blocked.
% 0.21/0.44 # There were 0 deferred branch saturation attempts.
% 0.21/0.44 # There were 0 free duplicated saturations.
% 0.21/0.44 # There were 2 total successful branch saturations.
% 0.21/0.44 # There were 0 successful branch saturations in interreduction.
% 0.21/0.44 # There were 0 successful branch saturations on the branch.
% 0.21/0.44 # There were 2 successful branch saturations after the branch.
% 0.21/0.44 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.44 # Begin clausification derivation
% 0.21/0.44
% 0.21/0.44 # End clausification derivation
% 0.21/0.44 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.44 cnf(i_0_5, negated_conjecture, (~g_true_only(X1,esk1_1(X1)))).
% 0.21/0.44 cnf(i_0_6, negated_conjecture, (~g_false_only(a,X1)|~g_false_only(X1,X2))).
% 0.21/0.44 cnf(i_0_14, plain, (~g_true(X1,X2)|~g_false_only(X1,X2))).
% 0.21/0.44 cnf(i_0_8, plain, (~g_false(X1,X2)|~g_true_only(X1,X2))).
% 0.21/0.44 cnf(i_0_9, plain, (g_true(X1,X2)|~g_true_only(X1,X2))).
% 0.21/0.44 cnf(i_0_12, plain, (g_true(X1,X2)|~g_both(X1,X2))).
% 0.21/0.44 cnf(i_0_15, plain, (g_false(X1,X2)|~g_false_only(X1,X2))).
% 0.21/0.44 cnf(i_0_11, plain, (g_false(X1,X2)|~g_both(X1,X2))).
% 0.21/0.44 cnf(i_0_10, plain, (g_both(X1,X2)|~g_false(X1,X2)|~g_true(X1,X2))).
% 0.21/0.44 cnf(i_0_13, plain, (g_true(X1,X2)|g_false_only(X1,X2)|~g_false(X1,X2))).
% 0.21/0.44 cnf(i_0_7, plain, (g_false(X1,X2)|g_true_only(X1,X2)|~g_true(X1,X2))).
% 0.21/0.44 cnf(i_0_16, plain, (g_both(X1,X2)|g_true_only(X1,X2)|g_false_only(X1,X2))).
% 0.21/0.44 cnf(i_0_4, negated_conjecture, (g_true_only(esk6_0,X1)|g_true_only(a,X2)|g_true_only(X2,X3)|g_false_only(a,esk3_0)|g_false_only(X4,esk5_1(X4))|~g_both(a,X2)|~g_both(X4,X5))).
% 0.21/0.44 cnf(i_0_3, negated_conjecture, (g_true_only(esk6_0,X1)|g_true_only(a,X2)|g_true_only(X2,X3)|g_false_only(esk3_0,esk4_0)|g_false_only(X4,esk5_1(X4))|~g_both(a,X2)|~g_both(X4,X5))).
% 0.21/0.44 cnf(i_0_2, negated_conjecture, (g_true_only(esk6_0,X1)|g_true_only(a,X2)|g_true_only(X2,X3)|g_false_only(a,esk3_0)|g_false_only(X2,esk2_1(X2))|g_false_only(X4,esk5_1(X4))|~g_both(X4,X5)|~g_both(X2,X6))).
% 0.21/0.44 cnf(i_0_1, negated_conjecture, (g_true_only(esk6_0,X1)|g_true_only(a,X2)|g_true_only(X2,X3)|g_false_only(esk3_0,esk4_0)|g_false_only(X2,esk2_1(X2))|g_false_only(X4,esk5_1(X4))|~g_both(X4,X5)|~g_both(X2,X6))).
% 0.21/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.44 # Begin printing tableau
% 0.21/0.44 # Found 7 steps
% 0.21/0.44 cnf(i_0_5, negated_conjecture, (~g_true_only(a,esk1_1(a))), inference(start_rule)).
% 0.21/0.44 cnf(i_0_49, plain, (~g_true_only(a,esk1_1(a))), inference(extension_rule, [i_0_16])).
% 0.21/0.44 cnf(i_0_313, plain, (g_both(a,esk1_1(a))), inference(extension_rule, [i_0_12])).
% 0.21/0.44 cnf(i_0_322, plain, (g_true(a,esk1_1(a))), inference(extension_rule, [i_0_14])).
% 0.21/0.44 cnf(i_0_315, plain, (g_false_only(a,esk1_1(a))), inference(extension_rule, [i_0_6])).
% 0.21/0.44 cnf(i_0_325, plain, (~g_false_only(a,esk1_1(a))), inference(etableau_closure_rule, [i_0_325, ...])).
% 0.21/0.44 cnf(i_0_437, plain, (~g_false_only(esk1_1(a),X5)), inference(etableau_closure_rule, [i_0_437, ...])).
% 0.21/0.44 # End printing tableau
% 0.21/0.44 # SZS output end
% 0.21/0.44 # Branches closed with saturation will be marked with an "s"
% 0.21/0.44 # Child (32337) has found a proof.
% 0.21/0.44
% 0.21/0.44 # Proof search is over...
% 0.21/0.44 # Freeing feature tree
%------------------------------------------------------------------------------