TSTP Solution File: LCL059-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL059-1 : TPTP v8.1.0. Released v1.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 : n009.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:19:15 EDT 2022
% Result : Unsatisfiable 3.16s 3.32s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL059-1 : TPTP v8.1.0. Released v1.0.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.12/0.33 % Computer : n009.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 04:47:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 0.12/0.36 # and selection function PSelectComplexExceptRRHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 5 Number of unprocessed: 5
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.47/0.66 # The folding up rule is enabled...
% 0.47/0.66 # Local unification is enabled...
% 0.47/0.66 # Any saturation attempts will use folding labels...
% 0.47/0.66 # 5 beginning clauses after preprocessing and clausification
% 0.47/0.66 # Creating start rules for all 1 conjectures.
% 0.47/0.66 # There are 1 start rule candidates:
% 0.47/0.66 # Found 4 unit axioms.
% 0.47/0.66 # 1 start rule tableaux created.
% 0.47/0.66 # 1 extension rule candidate clauses
% 0.47/0.66 # 4 unit axiom clauses
% 0.47/0.66
% 0.47/0.66 # Requested 8, 32 cores available to the main process.
% 0.47/0.66 # There are not enough tableaux to fork, creating more from the initial 1
% 0.92/1.09 # Ran out of tableaux, making start rules for all clauses
% 3.16/3.32 # There were 13 total branch saturation attempts.
% 3.16/3.32 # There were 0 of these attempts blocked.
% 3.16/3.32 # There were 0 deferred branch saturation attempts.
% 3.16/3.32 # There were 0 free duplicated saturations.
% 3.16/3.32 # There were 1 total successful branch saturations.
% 3.16/3.32 # There were 0 successful branch saturations in interreduction.
% 3.16/3.32 # There were 0 successful branch saturations on the branch.
% 3.16/3.32 # There were 1 successful branch saturations after the branch.
% 3.16/3.32 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.16/3.32 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.16/3.32 # Begin clausification derivation
% 3.16/3.32
% 3.16/3.32 # End clausification derivation
% 3.16/3.32 # Begin listing active clauses obtained from FOF to CNF conversion
% 3.16/3.32 cnf(i_0_9, plain, (is_a_theorem(implies(X1,implies(not(X1),X2))))).
% 3.16/3.32 cnf(i_0_8, plain, (is_a_theorem(implies(implies(not(X1),X1),X1)))).
% 3.16/3.32 cnf(i_0_7, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))).
% 3.16/3.32 cnf(i_0_10, negated_conjecture, (~is_a_theorem(implies(implies(not(a),not(b)),implies(b,a))))).
% 3.16/3.32 cnf(i_0_6, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))).
% 3.16/3.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 3.16/3.32 # Begin printing tableau
% 3.16/3.32 # Found 6 steps
% 3.16/3.32 cnf(i_0_7, plain, (is_a_theorem(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))))), inference(start_rule)).
% 3.16/3.32 cnf(i_0_57482, plain, (is_a_theorem(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))))), inference(extension_rule, [i_0_6])).
% 3.16/3.32 cnf(i_0_387825, plain, (is_a_theorem(implies(implies(not(a),not(b)),implies(b,a)))), inference(closure_rule, [i_0_10])).
% 3.16/3.32 cnf(i_0_387826, plain, (~is_a_theorem(implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(implies(not(a),not(b)),implies(b,a))))), inference(extension_rule, [i_0_6])).
% 3.16/3.32 cnf(i_0_387829, plain, (~is_a_theorem(implies(implies(not(implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(implies(not(a),not(b)),implies(b,a)))),implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(implies(not(a),not(b)),implies(b,a)))),implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(implies(not(a),not(b)),implies(b,a)))))), inference(closure_rule, [i_0_8])).
% 3.16/3.32 cnf(i_0_387830, plain, (~is_a_theorem(implies(not(implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(implies(not(a),not(b)),implies(b,a)))),implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(implies(not(a),not(b)),implies(b,a)))))), inference(etableau_closure_rule, [i_0_387830, ...])).
% 3.16/3.32 # End printing tableau
% 3.16/3.32 # SZS output end
% 3.16/3.32 # Branches closed with saturation will be marked with an "s"
% 3.16/3.32 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 3.16/3.32 # We now have 4 tableaux to operate on
% 3.16/3.32 # Found closed tableau during pool population.
% 3.16/3.32 # Proof search is over...
% 3.16/3.32 # Freeing feature tree
%------------------------------------------------------------------------------