TSTP Solution File: LCL006-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL006-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 : n004.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:18:53 EDT 2022
% Result : Unsatisfiable 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL006-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.13/0.36 % Computer : n004.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 600
% 0.13/0.36 % DateTime : Sun Jul 3 22:08:38 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.21/0.38 # No SInE strategy applied
% 0.21/0.38 # Auto-Mode selected heuristic G_E___060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 0.21/0.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.21/0.38 #
% 0.21/0.38 # Number of axioms: 4 Number of unprocessed: 4
% 0.21/0.38 # Tableaux proof search.
% 0.21/0.38 # APR header successfully linked.
% 0.21/0.38 # Hello from C++
% 0.21/0.47 # The folding up rule is enabled...
% 0.21/0.47 # Local unification is enabled...
% 0.21/0.47 # Any saturation attempts will use folding labels...
% 0.21/0.47 # 4 beginning clauses after preprocessing and clausification
% 0.21/0.47 # Creating start rules for all 1 conjectures.
% 0.21/0.47 # There are 1 start rule candidates:
% 0.21/0.47 # Found 3 unit axioms.
% 0.21/0.47 # 1 start rule tableaux created.
% 0.21/0.47 # 1 extension rule candidate clauses
% 0.21/0.47 # 3 unit axiom clauses
% 0.21/0.47
% 0.21/0.47 # Requested 8, 32 cores available to the main process.
% 0.21/0.47 # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.48 # There were 1 total branch saturation attempts.
% 0.21/0.48 # There were 0 of these attempts blocked.
% 0.21/0.48 # There were 0 deferred branch saturation attempts.
% 0.21/0.48 # There were 0 free duplicated saturations.
% 0.21/0.48 # There were 1 total successful branch saturations.
% 0.21/0.48 # There were 0 successful branch saturations in interreduction.
% 0.21/0.48 # There were 0 successful branch saturations on the branch.
% 0.21/0.48 # There were 1 successful branch saturations after the branch.
% 0.21/0.48 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48 # Begin clausification derivation
% 0.21/0.48
% 0.21/0.48 # End clausification derivation
% 0.21/0.48 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.48 cnf(i_0_5, plain, (is_a_theorem(X2)|~is_a_theorem(X1)|~is_a_theorem(equivalent(X1,X2)))).
% 0.21/0.48 cnf(i_0_6, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1))))).
% 0.21/0.48 cnf(i_0_7, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X1,equivalent(X2,X3)))))).
% 0.21/0.48 cnf(i_0_8, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))))).
% 0.21/0.48 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.48 # Begin printing tableau
% 0.21/0.48 # Found 6 steps
% 0.21/0.48 cnf(i_0_8, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c)))), inference(start_rule)).
% 0.21/0.48 cnf(i_0_9, plain, (~is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c)))), inference(extension_rule, [i_0_5])).
% 0.21/0.48 cnf(i_0_11, plain, (~is_a_theorem(equivalent(equivalent(X6,X5),equivalent(X5,X6)))), inference(closure_rule, [i_0_6])).
% 0.21/0.48 cnf(i_0_12, plain, (~is_a_theorem(equivalent(equivalent(equivalent(X6,X5),equivalent(X5,X6)),equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))))), inference(extension_rule, [i_0_5])).
% 0.21/0.48 cnf(i_0_14, plain, (~is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1)))), inference(closure_rule, [i_0_6])).
% 0.21/0.48 cnf(i_0_15, plain, (~is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X2,X1)),equivalent(equivalent(equivalent(X6,X5),equivalent(X5,X6)),equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c)))))), inference(etableau_closure_rule, [i_0_15, ...])).
% 0.21/0.48 # End printing tableau
% 0.21/0.48 # SZS output end
% 0.21/0.48 # Branches closed with saturation will be marked with an "s"
% 0.21/0.48 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.48 # We now have 1 tableaux to operate on
% 0.21/0.48 # Found closed tableau during pool population.
% 0.21/0.48 # Proof search is over...
% 0.21/0.48 # Freeing feature tree
%------------------------------------------------------------------------------