TSTP Solution File: LCL122-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL122-1 : TPTP v8.1.0. Bugfixed 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 : 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:19:46 EDT 2022
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL122-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 4 05:36:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S00
% 0.13/0.37 # and selection function NoSelection.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 3 Number of unprocessed: 3
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.21/0.51 # The folding up rule is enabled...
% 0.21/0.51 # Local unification is enabled...
% 0.21/0.51 # Any saturation attempts will use folding labels...
% 0.21/0.51 # 3 beginning clauses after preprocessing and clausification
% 0.21/0.51 # Creating start rules for all 1 conjectures.
% 0.21/0.51 # There are 1 start rule candidates:
% 0.21/0.51 # Found 2 unit axioms.
% 0.21/0.51 # 1 start rule tableaux created.
% 0.21/0.51 # 1 extension rule candidate clauses
% 0.21/0.51 # 2 unit axiom clauses
% 0.21/0.51
% 0.21/0.51 # Requested 8, 32 cores available to the main process.
% 0.21/0.51 # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.52 # There were 1 total branch saturation attempts.
% 0.21/0.52 # There were 0 of these attempts blocked.
% 0.21/0.52 # There were 0 deferred branch saturation attempts.
% 0.21/0.52 # There were 0 free duplicated saturations.
% 0.21/0.52 # There were 1 total successful branch saturations.
% 0.21/0.52 # There were 0 successful branch saturations in interreduction.
% 0.21/0.52 # There were 0 successful branch saturations on the branch.
% 0.21/0.52 # There were 1 successful branch saturations after the branch.
% 0.21/0.52 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.52 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.52 # Begin clausification derivation
% 0.21/0.52
% 0.21/0.52 # End clausification derivation
% 0.21/0.52 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.52 cnf(i_0_5, plain, (is_a_theorem(equivalent(X1,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))))))).
% 0.21/0.52 cnf(i_0_6, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))))).
% 0.21/0.52 cnf(i_0_4, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X2,X1))|~is_a_theorem(X2))).
% 0.21/0.52 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.52 # Begin printing tableau
% 0.21/0.52 # Found 6 steps
% 0.21/0.52 cnf(i_0_6, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))))))), inference(start_rule)).
% 0.21/0.52 cnf(i_0_7, plain, (~is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))))))), inference(extension_rule, [i_0_4])).
% 0.21/0.52 cnf(i_0_10, plain, (~is_a_theorem(equivalent(X10,equivalent(X10,equivalent(equivalent(X9,X8),equivalent(equivalent(X9,X7),equivalent(X8,X7))))))), inference(closure_rule, [i_0_5])).
% 0.21/0.52 cnf(i_0_9, plain, (~is_a_theorem(equivalent(equivalent(X10,equivalent(X10,equivalent(equivalent(X9,X8),equivalent(equivalent(X9,X7),equivalent(X8,X7))))),equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))))), inference(extension_rule, [i_0_4])).
% 0.21/0.52 cnf(i_0_13, plain, (~is_a_theorem(equivalent(X1,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4))))))), inference(closure_rule, [i_0_5])).
% 0.21/0.52 cnf(i_0_12, plain, (~is_a_theorem(equivalent(equivalent(X1,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4))))),equivalent(equivalent(X10,equivalent(X10,equivalent(equivalent(X9,X8),equivalent(equivalent(X9,X7),equivalent(X8,X7))))),equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))))))))), inference(etableau_closure_rule, [i_0_12, ...])).
% 0.21/0.52 # End printing tableau
% 0.21/0.52 # SZS output end
% 0.21/0.52 # Branches closed with saturation will be marked with an "s"
% 0.21/0.52 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.52 # We now have 1 tableaux to operate on
% 0.21/0.52 # Found closed tableau during pool population.
% 0.21/0.52 # Proof search is over...
% 0.21/0.52 # Freeing feature tree
%------------------------------------------------------------------------------