TSTP Solution File: SYO691-1.000 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYO691-1.000 : TPTP v8.1.0. Released v7.3.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 : n010.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:06:13 EDT 2022
% Result : Unsatisfiable 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO691-1.000 : TPTP v8.1.0. Released v7.3.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.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Fri Jul 8 18:49:01 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 0.14/0.37 # and selection function PSelectComplexExceptRRHorn.
% 0.14/0.37 #
% 0.14/0.37 # Presaturation interreduction done
% 0.14/0.37 # Number of axioms: 7 Number of unprocessed: 7
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.14/0.37 # The folding up rule is enabled...
% 0.14/0.37 # Local unification is enabled...
% 0.14/0.37 # Any saturation attempts will use folding labels...
% 0.14/0.37 # 7 beginning clauses after preprocessing and clausification
% 0.14/0.37 # Creating start rules for all 1 conjectures.
% 0.14/0.37 # There are 1 start rule candidates:
% 0.14/0.37 # Found 3 unit axioms.
% 0.14/0.37 # 1 start rule tableaux created.
% 0.14/0.37 # 4 extension rule candidate clauses
% 0.14/0.37 # 3 unit axiom clauses
% 0.14/0.37
% 0.14/0.37 # Requested 8, 32 cores available to the main process.
% 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.37 # We now have 8 tableaux to operate on
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 1 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 1 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_13, plain, (seq(zero,X1,X1))).
% 0.14/0.38 cnf(i_0_8, plain, (top(f(f(X1,X2),f(X3,a)),f(f(X3,f(X2,a)),X1)))).
% 0.14/0.38 cnf(i_0_9, negated_conjecture, (~seq(succ(succ(succ(zero))),X1,X1))).
% 0.14/0.38 cnf(i_0_10, plain, (step(X1,X2)|~top(X1,X2))).
% 0.14/0.38 cnf(i_0_12, plain, (step(f(X1,X2),f(X1,X3))|~step(X2,X3))).
% 0.14/0.38 cnf(i_0_11, plain, (step(f(X1,X2),f(X3,X2))|~step(X1,X3))).
% 0.14/0.38 cnf(i_0_14, plain, (seq(succ(X1),X2,X3)|~step(X4,X3)|~seq(X1,X2,X4))).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 9 steps
% 0.14/0.38 cnf(i_0_9, negated_conjecture, (~seq(succ(succ(succ(zero))),f(f(f(X2,f(X3,a)),X1),X5),f(f(f(X2,f(X3,a)),X1),X5))), inference(start_rule)).
% 0.14/0.38 cnf(i_0_15, plain, (~seq(succ(succ(succ(zero))),f(f(f(X2,f(X3,a)),X1),X5),f(f(f(X2,f(X3,a)),X1),X5))), inference(extension_rule, [i_0_14])).
% 0.14/0.38 cnf(i_0_23, plain, (~step(f(f(f(X1,X3),f(X2,a)),X5),f(f(f(X2,f(X3,a)),X1),X5))), inference(extension_rule, [i_0_11])).
% 0.14/0.38 cnf(i_0_24, plain, (~seq(succ(succ(zero)),f(f(f(X2,f(X3,a)),X1),X5),f(f(f(X1,X3),f(X2,a)),X5))), inference(extension_rule, [i_0_14])).
% 0.14/0.38 cnf(i_0_95, plain, (~step(f(f(X5,X2),f(f(X1,X3),a)),f(f(f(X1,X3),f(X2,a)),X5))), inference(extension_rule, [i_0_10])).
% 0.14/0.38 cnf(i_0_116, plain, (~top(f(f(X5,X2),f(f(X1,X3),a)),f(f(f(X1,X3),f(X2,a)),X5))), inference(closure_rule, [i_0_8])).
% 0.14/0.38 cnf(i_0_30, plain, (~step(f(f(X1,X3),f(X2,a)),f(f(X2,f(X3,a)),X1))), inference(extension_rule, [i_0_10])).
% 0.14/0.38 cnf(i_0_125, plain, (~top(f(f(X1,X3),f(X2,a)),f(f(X2,f(X3,a)),X1))), inference(closure_rule, [i_0_8])).
% 0.14/0.38 cnf(i_0_96, plain, (~seq(succ(zero),f(f(f(X2,f(X3,a)),X1),X5),f(f(X5,X2),f(f(X1,X3),a)))), inference(etableau_closure_rule, [i_0_96, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 1 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 1 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_13, plain, (seq(zero,X1,X1))).
% 0.14/0.38 cnf(i_0_8, plain, (top(f(f(X1,X2),f(X3,a)),f(f(X3,f(X2,a)),X1)))).
% 0.14/0.38 cnf(i_0_9, negated_conjecture, (~seq(succ(succ(succ(zero))),X1,X1))).
% 0.14/0.38 cnf(i_0_10, plain, (step(X1,X2)|~top(X1,X2))).
% 0.14/0.38 cnf(i_0_12, plain, (step(f(X1,X2),f(X1,X3))|~step(X2,X3))).
% 0.14/0.38 cnf(i_0_11, plain, (step(f(X1,X2),f(X3,X2))|~step(X1,X3))).
% 0.14/0.38 cnf(i_0_14, plain, (seq(succ(X1),X2,X3)|~step(X4,X3)|~seq(X1,X2,X4))).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 9 steps
% 0.14/0.38 cnf(i_0_9, negated_conjecture, (~seq(succ(succ(succ(zero))),f(f(f(X4,f(X2,a)),X1),X5),f(f(f(X4,f(X2,a)),X1),X5))), inference(start_rule)).
% 0.14/0.38 cnf(i_0_15, plain, (~seq(succ(succ(succ(zero))),f(f(f(X4,f(X2,a)),X1),X5),f(f(f(X4,f(X2,a)),X1),X5))), inference(extension_rule, [i_0_14])).
% 0.14/0.38 cnf(i_0_23, plain, (~step(f(f(f(X1,X2),f(X4,a)),X5),f(f(f(X4,f(X2,a)),X1),X5))), inference(extension_rule, [i_0_11])).
% 0.14/0.38 cnf(i_0_24, plain, (~seq(succ(succ(zero)),f(f(f(X4,f(X2,a)),X1),X5),f(f(f(X1,X2),f(X4,a)),X5))), inference(extension_rule, [i_0_14])).
% 0.14/0.38 cnf(i_0_30, plain, (~step(f(f(X1,X2),f(X4,a)),f(f(X4,f(X2,a)),X1))), inference(extension_rule, [i_0_10])).
% 0.14/0.38 cnf(i_0_107, plain, (~top(f(f(X1,X2),f(X4,a)),f(f(X4,f(X2,a)),X1))), inference(closure_rule, [i_0_8])).
% 0.14/0.38 cnf(i_0_95, plain, (~step(f(f(X5,X4),f(f(X1,X2),a)),f(f(f(X1,X2),f(X4,a)),X5))), inference(extension_rule, [i_0_10])).
% 0.14/0.38 cnf(i_0_125, plain, (~top(f(f(X5,X4),f(f(X1,X2),a)),f(f(f(X1,X2),f(X4,a)),X5))), inference(closure_rule, [i_0_8])).
% 0.14/0.38 cnf(i_0_96, plain, (~seq(succ(zero),f(f(f(X4,f(X2,a)),X1),X5),f(f(X5,X4),f(f(X1,X2),a)))), inference(etableau_closure_rule, [i_0_96, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # Child (26999) has found a proof.
% 0.14/0.38
% 0.14/0.38 # Proof search is over...
% 0.14/0.38 # Freeing feature tree
%------------------------------------------------------------------------------