TSTP Solution File: SYN313-1.001.002 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN313-1.001.002 : TPTP v8.1.0. Released v1.2.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 : n025.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.19s 0.39s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN313-1.001.002 : TPTP v8.1.0. Released v1.2.0.
% 0.03/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.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 05:27:48 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 2 Number of unprocessed: 2
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 2 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 2 conjectures.
% 0.19/0.37 # There are 2 start rule candidates:
% 0.19/0.37 # Found 0 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 2 start rule tableaux created.
% 0.19/0.37 # 2 extension rule candidate clauses
% 0.19/0.37 # 0 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 2
% 0.19/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37 # We now have 9 tableaux to operate on
% 0.19/0.39 # There were 4 total branch saturation attempts.
% 0.19/0.39 # There were 0 of these attempts blocked.
% 0.19/0.39 # There were 0 deferred branch saturation attempts.
% 0.19/0.39 # There were 0 free duplicated saturations.
% 0.19/0.39 # There were 4 total successful branch saturations.
% 0.19/0.39 # There were 0 successful branch saturations in interreduction.
% 0.19/0.39 # There were 0 successful branch saturations on the branch.
% 0.19/0.39 # There were 4 successful branch saturations after the branch.
% 0.19/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.39 # Begin clausification derivation
% 0.19/0.39
% 0.19/0.39 # End clausification derivation
% 0.19/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.39 cnf(i_0_3, negated_conjecture, (~p(X1,f0(X1),X2)|~p(X1,f1(X2),X3))).
% 0.19/0.39 cnf(i_0_4, negated_conjecture, (p(h2(X1),X2,j2(X2))|p(h1(X3),X1,j1(X2))|p(h0,X3,j0(X2)))).
% 0.19/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.39 # Begin printing tableau
% 0.19/0.39 # Found 10 steps
% 0.19/0.39 cnf(i_0_4, negated_conjecture, (p(h2(f0(h1(f0(h0)))),f1(j2(f0(h2(f0(h1(f0(h0))))))),j2(f1(j2(f0(h2(f0(h1(f0(h0)))))))))|p(h1(f0(h0)),f0(h1(f0(h0))),j1(f1(j2(f0(h2(f0(h1(f0(h0)))))))))|p(h0,f0(h0),j0(f1(j2(f0(h2(f0(h1(f0(h0)))))))))), inference(start_rule)).
% 0.19/0.39 cnf(i_0_5, plain, (p(h2(f0(h1(f0(h0)))),f1(j2(f0(h2(f0(h1(f0(h0))))))),j2(f1(j2(f0(h2(f0(h1(f0(h0)))))))))), inference(extension_rule, [i_0_3])).
% 0.19/0.39 cnf(i_0_13, plain, (~p(h2(f0(h1(f0(h0)))),f0(h2(f0(h1(f0(h0))))),j2(f0(h2(f0(h1(f0(h0)))))))), inference(extension_rule, [i_0_4])).
% 0.19/0.39 cnf(i_0_31, plain, (p(h1(f0(h0)),f0(h1(f0(h0))),j1(f0(h2(f0(h1(f0(h0)))))))), inference(extension_rule, [i_0_3])).
% 0.19/0.39 cnf(i_0_32, plain, (p(h0,f0(h0),j0(f0(h2(f0(h1(f0(h0)))))))), inference(extension_rule, [i_0_3])).
% 0.19/0.39 cnf(i_0_6, plain, (p(h1(f0(h0)),f0(h1(f0(h0))),j1(f1(j2(f0(h2(f0(h1(f0(h0)))))))))), inference(extension_rule, [i_0_3])).
% 0.19/0.39 cnf(i_0_7, plain, (p(h0,f0(h0),j0(f1(j2(f0(h2(f0(h1(f0(h0)))))))))), inference(etableau_closure_rule, [i_0_7, ...])).
% 0.19/0.39 cnf(i_0_34, plain, (~p(h1(f0(h0)),f1(j1(f0(h2(f0(h1(f0(h0))))))),X8)), inference(etableau_closure_rule, [i_0_34, ...])).
% 0.19/0.39 cnf(i_0_39, plain, (~p(h0,f1(j0(f0(h2(f0(h1(f0(h0))))))),X6)), inference(etableau_closure_rule, [i_0_39, ...])).
% 0.19/0.39 cnf(i_0_44, plain, (~p(h1(f0(h0)),f1(j1(f1(j2(f0(h2(f0(h1(f0(h0))))))))),X7)), inference(etableau_closure_rule, [i_0_44, ...])).
% 0.19/0.39 # End printing tableau
% 0.19/0.39 # SZS output end
% 0.19/0.39 # Branches closed with saturation will be marked with an "s"
% 0.19/0.39 # Child (29973) has found a proof.
% 0.19/0.39
% 0.19/0.39 # Proof search is over...
% 0.19/0.39 # Freeing feature tree
%------------------------------------------------------------------------------