TSTP Solution File: LCL106-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL106-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 : n026.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:35 EDT 2022
% Result : Unsatisfiable 0.22s 0.39s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : LCL106-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/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 : n026.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 06:39:06 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.39 # No SInE strategy applied
% 0.22/0.39 # Auto-Mode selected heuristic G_E___060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 0.22/0.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.22/0.39 #
% 0.22/0.39 # Number of axioms: 4 Number of unprocessed: 4
% 0.22/0.39 # Tableaux proof search.
% 0.22/0.39 # APR header successfully linked.
% 0.22/0.39 # Hello from C++
% 0.22/0.39 # The folding up rule is enabled...
% 0.22/0.39 # Local unification is enabled...
% 0.22/0.39 # Any saturation attempts will use folding labels...
% 0.22/0.39 # 4 beginning clauses after preprocessing and clausification
% 0.22/0.39 # Creating start rules for all 1 conjectures.
% 0.22/0.39 # There are 1 start rule candidates:
% 0.22/0.39 # Found 3 unit axioms.
% 0.22/0.39 # 1 start rule tableaux created.
% 0.22/0.39 # 1 extension rule candidate clauses
% 0.22/0.39 # 3 unit axiom clauses
% 0.22/0.39
% 0.22/0.39 # Requested 8, 32 cores available to the main process.
% 0.22/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.22/0.39 # There were 1 total branch saturation attempts.
% 0.22/0.39 # There were 0 of these attempts blocked.
% 0.22/0.39 # There were 0 deferred branch saturation attempts.
% 0.22/0.39 # There were 0 free duplicated saturations.
% 0.22/0.39 # There were 1 total successful branch saturations.
% 0.22/0.39 # There were 0 successful branch saturations in interreduction.
% 0.22/0.39 # There were 0 successful branch saturations on the branch.
% 0.22/0.39 # There were 1 successful branch saturations after the branch.
% 0.22/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.39 # Begin clausification derivation
% 0.22/0.39
% 0.22/0.39 # End clausification derivation
% 0.22/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.22/0.39 cnf(i_0_5, plain, (is_a_theorem(X2)|~is_a_theorem(X1)|~is_a_theorem(equivalent(X1,X2)))).
% 0.22/0.39 cnf(i_0_7, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))))).
% 0.22/0.39 cnf(i_0_8, negated_conjecture, (~is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b)))))).
% 0.22/0.39 cnf(i_0_6, plain, (is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X1)))))).
% 0.22/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.22/0.39 # Begin printing tableau
% 0.22/0.39 # Found 6 steps
% 0.22/0.39 cnf(i_0_8, negated_conjecture, (~is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b))))), inference(start_rule)).
% 0.22/0.39 cnf(i_0_9, plain, (~is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b))))), inference(extension_rule, [i_0_5])).
% 0.22/0.39 cnf(i_0_11, plain, (~is_a_theorem(equivalent(equivalent(equivalent(X8,X7),equivalent(X8,X6)),equivalent(X7,X6)))), inference(closure_rule, [i_0_7])).
% 0.22/0.39 cnf(i_0_12, plain, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(X8,X7),equivalent(X8,X6)),equivalent(X7,X6)),equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b)))))), inference(extension_rule, [i_0_5])).
% 0.22/0.39 cnf(i_0_14, plain, (~is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X4)),equivalent(X2,X4)))), inference(closure_rule, [i_0_7])).
% 0.22/0.39 cnf(i_0_15, plain, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X4)),equivalent(X2,X4)),equivalent(equivalent(equivalent(equivalent(X8,X7),equivalent(X8,X6)),equivalent(X7,X6)),equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b))))))), inference(etableau_closure_rule, [i_0_15, ...])).
% 0.22/0.39 # End printing tableau
% 0.22/0.39 # SZS output end
% 0.22/0.39 # Branches closed with saturation will be marked with an "s"
% 0.22/0.39 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.22/0.39 # We now have 1 tableaux to operate on
% 0.22/0.39 # Found closed tableau during pool population.
% 0.22/0.39 # Proof search is over...
% 0.22/0.39 # Freeing feature tree
%------------------------------------------------------------------------------