TSTP Solution File: SYN414+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN414+1 : TPTP v8.1.0. Released v2.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 : n018.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:10:47 EDT 2022
% Result : CounterSatisfiable 0.18s 0.38s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN414+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/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 : n018.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 : Tue Jul 12 00:12:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 13 Number of unprocessed: 13
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.36 # The folding up rule is enabled...
% 0.18/0.36 # Local unification is enabled...
% 0.18/0.36 # Any saturation attempts will use folding labels...
% 0.18/0.36 # 13 beginning clauses after preprocessing and clausification
% 0.18/0.36 # Creating start rules for all 13 conjectures.
% 0.18/0.36 # There are 13 start rule candidates:
% 0.18/0.36 # Found 0 unit axioms.
% 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.36 # 13 start rule tableaux created.
% 0.18/0.36 # 13 extension rule candidate clauses
% 0.18/0.36 # 0 unit axiom clauses
% 0.18/0.36
% 0.18/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.38 # 24989 Satisfiable branch
% 0.18/0.38 # Satisfiable branch found.
% 0.18/0.38 # There were 1 total branch saturation attempts.
% 0.18/0.38 # There were 0 of these attempts blocked.
% 0.18/0.38 # There were 0 deferred branch saturation attempts.
% 0.18/0.38 # There were 0 free duplicated saturations.
% 0.18/0.38 # There were 0 total successful branch saturations.
% 0.18/0.38 # There were 0 successful branch saturations in interreduction.
% 0.18/0.38 # There were 0 successful branch saturations on the branch.
% 0.18/0.38 # There were 0 successful branch saturations after the branch.
% 0.18/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.38 # Begin clausification derivation
% 0.18/0.38
% 0.18/0.38 # End clausification derivation
% 0.18/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.38 cnf(i_0_9, negated_conjecture, (f(esk4_0)|f(esk2_0))).
% 0.18/0.38 cnf(i_0_10, negated_conjecture, (f(esk2_0)|h(esk3_0,esk4_0))).
% 0.18/0.38 cnf(i_0_12, negated_conjecture, (f(esk4_0)|h(esk1_0,esk2_0))).
% 0.18/0.38 cnf(i_0_8, negated_conjecture, (f(esk2_0)|~g(esk5_0)|~h(esk3_0,esk5_0))).
% 0.18/0.38 cnf(i_0_11, negated_conjecture, (h(esk1_0,esk2_0)|~g(esk5_0)|~h(esk3_0,esk5_0))).
% 0.18/0.38 cnf(i_0_13, negated_conjecture, (h(esk3_0,esk4_0)|h(esk1_0,esk2_0))).
% 0.18/0.38 cnf(i_0_6, negated_conjecture, (f(esk4_0)|~g(X1)|~h(esk1_0,X1))).
% 0.18/0.38 cnf(i_0_7, negated_conjecture, (h(esk3_0,esk4_0)|~g(X1)|~h(esk1_0,X1))).
% 0.18/0.38 cnf(i_0_5, negated_conjecture, (~g(esk5_0)|~g(X1)|~h(esk3_0,esk5_0)|~h(esk1_0,X1))).
% 0.18/0.38 cnf(i_0_1, negated_conjecture, (g(esk6_1(X1))|g(X2)|~f(X3)|~f(X4)|~h(X1,X3)|~h(X5,X4))).
% 0.18/0.38 cnf(i_0_3, negated_conjecture, (g(X1)|h(X2,esk6_1(X2))|~f(X3)|~f(X4)|~h(X2,X3)|~h(X5,X4))).
% 0.18/0.38 cnf(i_0_2, negated_conjecture, (g(esk6_1(X1))|h(X2,X3)|~f(X4)|~f(X5)|~h(X1,X4)|~h(X2,X5))).
% 0.18/0.38 cnf(i_0_4, negated_conjecture, (h(X1,esk6_1(X1))|h(X2,X3)|~f(X4)|~f(X5)|~h(X1,X4)|~h(X2,X5))).
% 0.18/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.38 # Begin printing tableau
% 0.18/0.38 # Found 5 steps
% 0.18/0.38 cnf(i_0_13, negated_conjecture, (h(esk3_0,esk4_0)|h(esk1_0,esk2_0)), inference(start_rule)).
% 0.18/0.38 cnf(i_0_48, plain, (h(esk3_0,esk4_0)), inference(extension_rule, [i_0_4])).
% 0.18/0.38 cnf(i_0_67, plain, (~h(esk3_0,esk4_0)), inference(closure_rule, [i_0_48])).
% 0.18/0.38 cnf(i_0_62, plain, (h(esk3_0,esk6_1(esk3_0))), inference(extension_rule, [i_0_2])).
% 0.18/0.38 cnf(i_0_73, plain, (~h(esk3_0,esk6_1(esk3_0))), inference(closure_rule, [i_0_62])).
% 0.18/0.38 # End printing tableau
% 0.18/0.38 # SZS output end
% 0.18/0.38 # Branches closed with saturation will be marked with an "s"
% 0.18/0.38 # Child (24989) has found a proof.
% 0.18/0.38
% 0.18/0.38 # Proof search is over...
% 0.18/0.38 # Freeing feature tree
%------------------------------------------------------------------------------