TSTP Solution File: LCL071-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL071-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 : n029.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:19 EDT 2022
% Result : Unsatisfiable 2.58s 2.76s
% Output : CNFRefutation 2.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL071-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/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.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jul 2 15:34:25 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 0.14/0.38 # and selection function PSelectComplexExceptRRHorn.
% 0.14/0.38 #
% 0.14/0.38 # Presaturation interreduction done
% 0.14/0.38 # Number of axioms: 5 Number of unprocessed: 5
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.71/0.87 # The folding up rule is enabled...
% 0.71/0.87 # Local unification is enabled...
% 0.71/0.87 # Any saturation attempts will use folding labels...
% 0.71/0.87 # 5 beginning clauses after preprocessing and clausification
% 0.71/0.87 # Creating start rules for all 1 conjectures.
% 0.71/0.87 # There are 1 start rule candidates:
% 0.71/0.87 # Found 4 unit axioms.
% 0.71/0.87 # 1 start rule tableaux created.
% 0.71/0.87 # 1 extension rule candidate clauses
% 0.71/0.87 # 4 unit axiom clauses
% 0.71/0.87
% 0.71/0.87 # Requested 8, 32 cores available to the main process.
% 0.71/0.87 # There are not enough tableaux to fork, creating more from the initial 1
% 1.46/1.66 # Ran out of tableaux, making start rules for all clauses
% 2.58/2.76 # There were 6 total branch saturation attempts.
% 2.58/2.76 # There were 0 of these attempts blocked.
% 2.58/2.76 # There were 0 deferred branch saturation attempts.
% 2.58/2.76 # There were 0 free duplicated saturations.
% 2.58/2.76 # There were 1 total successful branch saturations.
% 2.58/2.76 # There were 0 successful branch saturations in interreduction.
% 2.58/2.76 # There were 0 successful branch saturations on the branch.
% 2.58/2.76 # There were 1 successful branch saturations after the branch.
% 2.58/2.76 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.58/2.76 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.58/2.76 # Begin clausification derivation
% 2.58/2.76
% 2.58/2.76 # End clausification derivation
% 2.58/2.76 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.58/2.76 cnf(i_0_7, plain, (is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))))).
% 2.58/2.76 cnf(i_0_8, plain, (is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))))).
% 2.58/2.76 cnf(i_0_9, plain, (is_a_theorem(implies(implies(X1,implies(not(X2),X3)),implies(X1,implies(implies(X4,X3),implies(implies(X2,X4),X3))))))).
% 2.58/2.76 cnf(i_0_10, negated_conjecture, (~is_a_theorem(implies(implies(not(a),a),a)))).
% 2.58/2.76 cnf(i_0_6, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))).
% 2.58/2.76 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.58/2.76 # Begin printing tableau
% 2.58/2.76 # Found 8 steps
% 2.58/2.76 cnf(i_0_7, plain, (is_a_theorem(implies(implies(implies(X6,implies(not(a),a)),a),implies(implies(not(a),a),a)))), inference(start_rule)).
% 2.58/2.76 cnf(i_0_87505, plain, (is_a_theorem(implies(implies(implies(X6,implies(not(a),a)),a),implies(implies(not(a),a),a)))), inference(extension_rule, [i_0_6])).
% 2.58/2.76 cnf(i_0_87512, plain, (is_a_theorem(implies(implies(not(a),a),a))), inference(closure_rule, [i_0_10])).
% 2.58/2.76 cnf(i_0_87514, plain, (~is_a_theorem(implies(implies(X6,implies(not(a),a)),a))), inference(extension_rule, [i_0_6])).
% 2.58/2.76 cnf(i_0_170102, plain, (~is_a_theorem(implies(implies(implies(X7,implies(X6,implies(not(a),a))),a),implies(implies(X6,implies(not(a),a)),a)))), inference(closure_rule, [i_0_7])).
% 2.58/2.76 cnf(i_0_170103, plain, (~is_a_theorem(implies(implies(X7,implies(X6,implies(not(a),a))),a))), inference(extension_rule, [i_0_6])).
% 2.58/2.76 cnf(i_0_210212, plain, (~is_a_theorem(implies(implies(implies(X1,implies(X7,implies(X6,implies(not(a),a)))),a),implies(implies(X7,implies(X6,implies(not(a),a))),a)))), inference(closure_rule, [i_0_7])).
% 2.58/2.76 cnf(i_0_210213, plain, (~is_a_theorem(implies(implies(X1,implies(X7,implies(X6,implies(not(a),a)))),a))), inference(etableau_closure_rule, [i_0_210213, ...])).
% 2.58/2.76 # End printing tableau
% 2.58/2.76 # SZS output end
% 2.58/2.76 # Branches closed with saturation will be marked with an "s"
% 2.58/2.76 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
% 2.58/2.76 # We now have 5 tableaux to operate on
% 2.58/2.76 # Found closed tableau during pool population.
% 2.58/2.76 # Proof search is over...
% 2.58/2.76 # Freeing feature tree
%------------------------------------------------------------------------------