TSTP Solution File: SYN037-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN037-2 : TPTP v8.1.0. Released v1.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 : n016.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 06:07:23 EDT 2022
% Result : Unsatisfiable 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN037-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/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.33 % Computer : n016.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 19:35:58 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 22 Number of unprocessed: 22
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.36 # The folding up rule is enabled...
% 0.13/0.36 # Local unification is enabled...
% 0.13/0.36 # Any saturation attempts will use folding labels...
% 0.13/0.36 # 22 beginning clauses after preprocessing and clausification
% 0.13/0.36 # Creating start rules for all 22 conjectures.
% 0.13/0.36 # There are 22 start rule candidates:
% 0.13/0.36 # Found 0 unit axioms.
% 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.36 # 22 start rule tableaux created.
% 0.13/0.36 # 22 extension rule candidate clauses
% 0.13/0.36 # 0 unit axiom clauses
% 0.13/0.36
% 0.13/0.36 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There were 7 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 7 total successful branch saturations.
% 0.13/0.38 # There were 2 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 5 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_44, negated_conjecture, (q(cu)|m1)).
% 0.13/0.38 cnf(i_0_42, negated_conjecture, (m1|~q(cuu))).
% 0.13/0.38 cnf(i_0_41, negated_conjecture, (m2|~p(cvv))).
% 0.13/0.38 cnf(i_0_43, negated_conjecture, (m2|p(cv))).
% 0.13/0.38 cnf(i_0_28, negated_conjecture, (q(cw)|~q(X1)|~m2|~m3)).
% 0.13/0.38 cnf(i_0_36, negated_conjecture, (q(X1)|m2|m3|~q(cw))).
% 0.13/0.38 cnf(i_0_40, negated_conjecture, (p(X1)|~m2|~p(X2))).
% 0.13/0.38 cnf(i_0_23, negated_conjecture, (~p(fy(X1))|~p(X1)|~m3|~m1)).
% 0.13/0.38 cnf(i_0_39, negated_conjecture, (q(X1)|~q(X2)|~m1)).
% 0.13/0.38 cnf(i_0_29, negated_conjecture, (m3|~q(fz5(X1))|~q(X1)|~m2)).
% 0.13/0.38 cnf(i_0_33, negated_conjecture, (m2|~q(fz2(X1))|~q(X1)|~m3)).
% 0.13/0.38 cnf(i_0_31, negated_conjecture, (p(X1)|m1|~p(cx)|~m3)).
% 0.13/0.38 cnf(i_0_32, negated_conjecture, (p(cx)|m1|~p(X1)|~m3)).
% 0.13/0.38 cnf(i_0_26, negated_conjecture, (p(cx)|m3|~p(X1)|~m1)).
% 0.13/0.38 cnf(i_0_37, negated_conjecture, (q(cw)|m2|m3|~q(X1))).
% 0.13/0.38 cnf(i_0_27, negated_conjecture, (q(X1)|~q(cw)|~m2|~m3)).
% 0.13/0.38 cnf(i_0_25, negated_conjecture, (p(X1)|m3|~p(cx)|~m1)).
% 0.13/0.38 cnf(i_0_38, negated_conjecture, (p(fy3(X1))|p(X1)|m3|m1)).
% 0.13/0.38 cnf(i_0_35, negated_conjecture, (m3|m1|~p(fy3(X1))|~p(X1))).
% 0.13/0.38 cnf(i_0_24, negated_conjecture, (p(fy(X1))|p(X1)|~m3|~m1)).
% 0.13/0.38 cnf(i_0_30, negated_conjecture, (q(fz5(X1))|q(X1)|m3|~m2)).
% 0.13/0.38 cnf(i_0_34, negated_conjecture, (q(fz2(X1))|q(X1)|m2|~m3)).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 12 steps
% 0.13/0.38 cnf(i_0_25, negated_conjecture, (p(cvv)|m3|~p(cx)|~m1), inference(start_rule)).
% 0.13/0.38 cnf(i_0_65, plain, (p(cvv)), inference(extension_rule, [i_0_41])).
% 0.13/0.38 cnf(i_0_195, plain, (m2), inference(extension_rule, [i_0_30])).
% 0.13/0.38 cnf(i_0_66, plain, (m3), inference(etableau_closure_rule, [i_0_66, ...])).
% 0.13/0.38 cnf(i_0_67, plain, (~p(cx)), inference(etableau_closure_rule, [i_0_67, ...])).
% 0.13/0.38 cnf(i_0_68, plain, (~m1), inference(etableau_closure_rule, [i_0_68, ...])).
% 0.13/0.38 cnf(i_0_203, plain, (m3), inference(etableau_closure_rule, [i_0_203, ...])).
% 0.13/0.38 cnf(i_0_201, plain, (q(fz5(cuu))), inference(extension_rule, [i_0_39])).
% 0.13/0.38 cnf(i_0_202, plain, (q(cuu)), inference(extension_rule, [i_0_42])).
% 0.13/0.38 cnf(i_0_341, plain, (q(X3)), inference(etableau_closure_rule, [i_0_341, ...])).
% 0.13/0.38 cnf(i_0_343, plain, (~m1), inference(etableau_closure_rule, [i_0_343, ...])).
% 0.13/0.38 cnf(i_0_409, plain, (m1), inference(etableau_closure_rule, [i_0_409, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # There were 7 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 7 total successful branch saturations.
% 0.13/0.38 # There were 2 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 5 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_44, negated_conjecture, (q(cu)|m1)).
% 0.13/0.38 cnf(i_0_42, negated_conjecture, (m1|~q(cuu))).
% 0.13/0.38 cnf(i_0_41, negated_conjecture, (m2|~p(cvv))).
% 0.13/0.38 cnf(i_0_43, negated_conjecture, (m2|p(cv))).
% 0.13/0.38 cnf(i_0_28, negated_conjecture, (q(cw)|~q(X1)|~m2|~m3)).
% 0.13/0.38 cnf(i_0_36, negated_conjecture, (q(X1)|m2|m3|~q(cw))).
% 0.13/0.38 cnf(i_0_40, negated_conjecture, (p(X1)|~m2|~p(X2))).
% 0.13/0.38 cnf(i_0_23, negated_conjecture, (~p(fy(X1))|~p(X1)|~m3|~m1)).
% 0.13/0.38 cnf(i_0_39, negated_conjecture, (q(X1)|~q(X2)|~m1)).
% 0.13/0.38 cnf(i_0_29, negated_conjecture, (m3|~q(fz5(X1))|~q(X1)|~m2)).
% 0.13/0.38 cnf(i_0_33, negated_conjecture, (m2|~q(fz2(X1))|~q(X1)|~m3)).
% 0.13/0.38 cnf(i_0_31, negated_conjecture, (p(X1)|m1|~p(cx)|~m3)).
% 0.13/0.38 cnf(i_0_32, negated_conjecture, (p(cx)|m1|~p(X1)|~m3)).
% 0.13/0.38 cnf(i_0_26, negated_conjecture, (p(cx)|m3|~p(X1)|~m1)).
% 0.13/0.38 cnf(i_0_37, negated_conjecture, (q(cw)|m2|m3|~q(X1))).
% 0.13/0.38 cnf(i_0_27, negated_conjecture, (q(X1)|~q(cw)|~m2|~m3)).
% 0.13/0.38 cnf(i_0_25, negated_conjecture, (p(X1)|m3|~p(cx)|~m1)).
% 0.13/0.38 cnf(i_0_38, negated_conjecture, (p(fy3(X1))|p(X1)|m3|m1)).
% 0.13/0.38 cnf(i_0_35, negated_conjecture, (m3|m1|~p(fy3(X1))|~p(X1))).
% 0.13/0.38 cnf(i_0_24, negated_conjecture, (p(fy(X1))|p(X1)|~m3|~m1)).
% 0.13/0.38 cnf(i_0_30, negated_conjecture, (q(fz5(X1))|q(X1)|m3|~m2)).
% 0.13/0.38 cnf(i_0_34, negated_conjecture, (q(fz2(X1))|q(X1)|m2|~m3)).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 12 steps
% 0.13/0.38 cnf(i_0_27, negated_conjecture, (q(cuu)|~q(cw)|~m2|~m3), inference(start_rule)).
% 0.13/0.38 cnf(i_0_69, plain, (q(cuu)), inference(extension_rule, [i_0_42])).
% 0.13/0.38 cnf(i_0_197, plain, (m1), inference(extension_rule, [i_0_24])).
% 0.13/0.38 cnf(i_0_70, plain, (~q(cw)), inference(etableau_closure_rule, [i_0_70, ...])).
% 0.13/0.38 cnf(i_0_71, plain, (~m2), inference(etableau_closure_rule, [i_0_71, ...])).
% 0.13/0.38 cnf(i_0_72, plain, (~m3), inference(etableau_closure_rule, [i_0_72, ...])).
% 0.13/0.38 cnf(i_0_209, plain, (~m3), inference(etableau_closure_rule, [i_0_209, ...])).
% 0.13/0.38 cnf(i_0_207, plain, (p(fy(cvv))), inference(extension_rule, [i_0_40])).
% 0.13/0.38 cnf(i_0_208, plain, (p(cvv)), inference(extension_rule, [i_0_41])).
% 0.13/0.38 cnf(i_0_357, plain, (p(X3)), inference(etableau_closure_rule, [i_0_357, ...])).
% 0.13/0.38 cnf(i_0_358, plain, (~m2), inference(etableau_closure_rule, [i_0_358, ...])).
% 0.13/0.38 cnf(i_0_425, plain, (m2), inference(etableau_closure_rule, [i_0_425, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # Child (2932) has found a proof.
% 0.13/0.38
% 0.13/0.38 # Proof search is over...
% 0.13/0.38 # Freeing feature tree
%------------------------------------------------------------------------------