TSTP Solution File: LCL367-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL367-1 : TPTP v8.1.0. Released v2.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 : n011.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 : Sun Jul 17 10:21:44 EDT 2022
% Result : Unsatisfiable 1.01s 1.19s
% Output : CNFRefutation 1.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.14 % Problem : LCL367-1 : TPTP v8.1.0. Released v2.3.0.
% 0.05/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n011.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 4 20:04:51 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.39 # No SInE strategy applied
% 0.21/0.39 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 0.21/0.39 # and selection function PSelectComplexExceptRRHorn.
% 0.21/0.39 #
% 0.21/0.39 # Presaturation interreduction done
% 0.21/0.39 # Number of axioms: 5 Number of unprocessed: 5
% 0.21/0.39 # Tableaux proof search.
% 0.21/0.39 # APR header successfully linked.
% 0.21/0.39 # Hello from C++
% 0.52/0.69 # The folding up rule is enabled...
% 0.52/0.69 # Local unification is enabled...
% 0.52/0.69 # Any saturation attempts will use folding labels...
% 0.52/0.69 # 5 beginning clauses after preprocessing and clausification
% 0.52/0.69 # Creating start rules for all 1 conjectures.
% 0.52/0.69 # There are 1 start rule candidates:
% 0.52/0.69 # Found 4 unit axioms.
% 0.52/0.69 # 1 start rule tableaux created.
% 0.52/0.69 # 1 extension rule candidate clauses
% 0.52/0.69 # 4 unit axiom clauses
% 0.52/0.69
% 0.52/0.69 # Requested 8, 32 cores available to the main process.
% 0.52/0.69 # There are not enough tableaux to fork, creating more from the initial 1
% 0.97/1.16 # Ran out of tableaux, making start rules for all clauses
% 1.01/1.19 # There were 3 total branch saturation attempts.
% 1.01/1.19 # There were 0 of these attempts blocked.
% 1.01/1.19 # There were 0 deferred branch saturation attempts.
% 1.01/1.19 # There were 0 free duplicated saturations.
% 1.01/1.19 # There were 1 total successful branch saturations.
% 1.01/1.19 # There were 0 successful branch saturations in interreduction.
% 1.01/1.19 # There were 0 successful branch saturations on the branch.
% 1.01/1.19 # There were 1 successful branch saturations after the branch.
% 1.01/1.19 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.01/1.19 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.01/1.19 # Begin clausification derivation
% 1.01/1.19
% 1.01/1.19 # End clausification derivation
% 1.01/1.19 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.01/1.19 cnf(i_0_9, plain, (is_a_theorem(implies(X1,implies(not(X1),X2))))).
% 1.01/1.19 cnf(i_0_8, plain, (is_a_theorem(implies(implies(not(X1),X1),X1)))).
% 1.01/1.19 cnf(i_0_7, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))).
% 1.01/1.19 cnf(i_0_10, negated_conjecture, (~is_a_theorem(implies(x,implies(implies(y,x),x))))).
% 1.01/1.19 cnf(i_0_6, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))).
% 1.01/1.19 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.01/1.19 # Begin printing tableau
% 1.01/1.19 # Found 6 steps
% 1.01/1.19 cnf(i_0_9, plain, (is_a_theorem(implies(X6,implies(not(X6),X5)))), inference(start_rule)).
% 1.01/1.19 cnf(i_0_57927, plain, (is_a_theorem(implies(X6,implies(not(X6),X5)))), inference(extension_rule, [i_0_6])).
% 1.01/1.19 cnf(i_0_57934, plain, (is_a_theorem(implies(x,implies(implies(y,x),x)))), inference(closure_rule, [i_0_10])).
% 1.01/1.19 cnf(i_0_57935, plain, (~is_a_theorem(implies(implies(X6,implies(not(X6),X5)),implies(x,implies(implies(y,x),x))))), inference(extension_rule, [i_0_6])).
% 1.01/1.19 cnf(i_0_57938, plain, (~is_a_theorem(implies(implies(not(implies(implies(X6,implies(not(X6),X5)),implies(x,implies(implies(y,x),x)))),implies(implies(X6,implies(not(X6),X5)),implies(x,implies(implies(y,x),x)))),implies(implies(X6,implies(not(X6),X5)),implies(x,implies(implies(y,x),x)))))), inference(closure_rule, [i_0_8])).
% 1.01/1.19 cnf(i_0_57939, plain, (~is_a_theorem(implies(not(implies(implies(X6,implies(not(X6),X5)),implies(x,implies(implies(y,x),x)))),implies(implies(X6,implies(not(X6),X5)),implies(x,implies(implies(y,x),x)))))), inference(etableau_closure_rule, [i_0_57939, ...])).
% 1.01/1.19 # End printing tableau
% 1.01/1.19 # SZS output end
% 1.01/1.19 # Branches closed with saturation will be marked with an "s"
% 1.01/1.19 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux.
% 1.01/1.19 # We now have 6 tableaux to operate on
% 1.01/1.19 # Found closed tableau during pool population.
% 1.01/1.19 # Proof search is over...
% 1.01/1.19 # Freeing feature tree
%------------------------------------------------------------------------------