TSTP Solution File: SYN312-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN312-1 : TPTP v8.1.0. Bugfixed 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 : n015.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:09:45 EDT 2022
% Result : Unsatisfiable 0.20s 0.36s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN312-1 : TPTP v8.1.0. Bugfixed 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.13/0.33 % Computer : n015.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 13:19:54 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.36 # No SInE strategy applied
% 0.20/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.36 #
% 0.20/0.36 # Presaturation interreduction done
% 0.20/0.36 # Number of axioms: 8 Number of unprocessed: 8
% 0.20/0.36 # Tableaux proof search.
% 0.20/0.36 # APR header successfully linked.
% 0.20/0.36 # Hello from C++
% 0.20/0.36 # The folding up rule is enabled...
% 0.20/0.36 # Local unification is enabled...
% 0.20/0.36 # Any saturation attempts will use folding labels...
% 0.20/0.36 # 8 beginning clauses after preprocessing and clausification
% 0.20/0.36 # Creating start rules for all 8 conjectures.
% 0.20/0.36 # There are 8 start rule candidates:
% 0.20/0.36 # Found 3 unit axioms.
% 0.20/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.36 # 8 start rule tableaux created.
% 0.20/0.36 # 5 extension rule candidate clauses
% 0.20/0.36 # 3 unit axiom clauses
% 0.20/0.36
% 0.20/0.36 # Requested 8, 32 cores available to the main process.
% 0.20/0.36 # There were 1 total branch saturation attempts.
% 0.20/0.36 # There were 0 of these attempts blocked.
% 0.20/0.36 # There were 0 deferred branch saturation attempts.
% 0.20/0.36 # There were 0 free duplicated saturations.
% 0.20/0.36 # There were 1 total successful branch saturations.
% 0.20/0.36 # There were 0 successful branch saturations in interreduction.
% 0.20/0.36 # There were 0 successful branch saturations on the branch.
% 0.20/0.36 # There were 1 successful branch saturations after the branch.
% 0.20/0.36 # There were 1 total branch saturation attempts.
% 0.20/0.36 # There were 0 of these attempts blocked.
% 0.20/0.36 # There were 0 deferred branch saturation attempts.
% 0.20/0.36 # There were 0 free duplicated saturations.
% 0.20/0.36 # There were 1 total successful branch saturations.
% 0.20/0.36 # There were 0 successful branch saturations in interreduction.
% 0.20/0.36 # There were 0 successful branch saturations on the branch.
% 0.20/0.36 # There were 1 successful branch saturations after the branch.
% 0.20/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.36 # Begin clausification derivation
% 0.20/0.36
% 0.20/0.36 # End clausification derivation
% 0.20/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.36 cnf(i_0_14, negated_conjecture, (p(a,f(b),c))).
% 0.20/0.36 cnf(i_0_15, negated_conjecture, (p(f(b),d,c))).
% 0.20/0.36 cnf(i_0_16, negated_conjecture, (~p(f(g(a)),f(g(d)),f(g(c))))).
% 0.20/0.36 cnf(i_0_12, negated_conjecture, (p(X1,X2,f(X3))|~p(X1,X2,X3))).
% 0.20/0.36 cnf(i_0_13, negated_conjecture, (p(g(X1),X2,X3)|~p(X1,X2,X3))).
% 0.20/0.36 cnf(i_0_10, negated_conjecture, (p(X1,X2,X3)|~p(X3,X2,X1))).
% 0.20/0.36 cnf(i_0_11, negated_conjecture, (p(X1,X2,X3)|~p(X2,X1,X3))).
% 0.20/0.36 cnf(i_0_9, negated_conjecture, (p(X1,X2,X3)|~p(X4,X2,X3)|~p(X1,X4,X3))).
% 0.20/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.36 # Begin printing tableau
% 0.20/0.36 # Found 5 steps
% 0.20/0.36 cnf(i_0_15, negated_conjecture, (p(f(b),d,c)), inference(start_rule)).
% 0.20/0.36 cnf(i_0_29, plain, (p(f(b),d,c)), inference(extension_rule, [i_0_9])).
% 0.20/0.36 cnf(i_0_33, plain, (~p(a,f(b),c)), inference(closure_rule, [i_0_14])).
% 0.20/0.36 cnf(i_0_31, plain, (p(a,d,c)), inference(extension_rule, [i_0_11])).
% 0.20/0.36 cnf(i_0_34, plain, (p(d,a,c)), inference(etableau_closure_rule, [i_0_34, ...])).
% 0.20/0.36 # End printing tableau
% 0.20/0.36 # SZS output end
% 0.20/0.36 # Branches closed with saturation will be marked with an "s"
% 0.20/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.36 # Begin clausification derivation
% 0.20/0.36
% 0.20/0.36 # End clausification derivation
% 0.20/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.36 cnf(i_0_14, negated_conjecture, (p(a,f(b),c))).
% 0.20/0.36 cnf(i_0_15, negated_conjecture, (p(f(b),d,c))).
% 0.20/0.36 cnf(i_0_16, negated_conjecture, (~p(f(g(a)),f(g(d)),f(g(c))))).
% 0.20/0.36 cnf(i_0_12, negated_conjecture, (p(X1,X2,f(X3))|~p(X1,X2,X3))).
% 0.20/0.36 cnf(i_0_13, negated_conjecture, (p(g(X1),X2,X3)|~p(X1,X2,X3))).
% 0.20/0.36 cnf(i_0_10, negated_conjecture, (p(X1,X2,X3)|~p(X3,X2,X1))).
% 0.20/0.36 cnf(i_0_11, negated_conjecture, (p(X1,X2,X3)|~p(X2,X1,X3))).
% 0.20/0.36 cnf(i_0_9, negated_conjecture, (p(X1,X2,X3)|~p(X4,X2,X3)|~p(X1,X4,X3))).
% 0.20/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.36 # Begin printing tableau
% 0.20/0.36 # Found 5 steps
% 0.20/0.36 cnf(i_0_12, negated_conjecture, (p(f(g(a)),f(g(d)),f(g(c)))|~p(f(g(a)),f(g(d)),g(c))), inference(start_rule)).
% 0.20/0.36 cnf(i_0_26, plain, (p(f(g(a)),f(g(d)),f(g(c)))), inference(closure_rule, [i_0_16])).
% 0.20/0.36 cnf(i_0_27, plain, (~p(f(g(a)),f(g(d)),g(c))), inference(extension_rule, [i_0_10])).
% 0.20/0.36 cnf(i_0_138, plain, (~p(g(c),f(g(d)),f(g(a)))), inference(extension_rule, [i_0_11])).
% 0.20/0.36 cnf(i_0_181, plain, (~p(f(g(d)),g(c),f(g(a)))), inference(etableau_closure_rule, [i_0_181, ...])).
% 0.20/0.36 # End printing tableau
% 0.20/0.36 # SZS output end
% 0.20/0.36 # Branches closed with saturation will be marked with an "s"
% 0.20/0.36 # There were 1 total branch saturation attempts.
% 0.20/0.36 # There were 0 of these attempts blocked.
% 0.20/0.36 # There were 0 deferred branch saturation attempts.
% 0.20/0.36 # There were 0 free duplicated saturations.
% 0.20/0.36 # There were 1 total successful branch saturations.
% 0.20/0.36 # There were 0 successful branch saturations in interreduction.
% 0.20/0.36 # There were 0 successful branch saturations on the branch.
% 0.20/0.36 # There were 1 successful branch saturations after the branch.
% 0.20/0.36 # Child (13913) has found a proof.
% 0.20/0.36
% 0.20/0.36 # Proof search is over...
% 0.20/0.36 # Freeing feature tree
%------------------------------------------------------------------------------