TSTP Solution File: LCL648+1.001 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL648+1.001 : TPTP v8.1.0. Released v4.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 : n018.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:23:43 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL648+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.06/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.32 % Computer : n018.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun Jul 3 23:53:05 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.35 # No SInE strategy applied
% 0.12/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.35 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.35 #
% 0.12/0.35 # Presaturation interreduction done
% 0.12/0.35 # Number of axioms: 4 Number of unprocessed: 4
% 0.12/0.35 # Tableaux proof search.
% 0.12/0.35 # APR header successfully linked.
% 0.12/0.35 # Hello from C++
% 0.12/0.35 # The folding up rule is enabled...
% 0.12/0.35 # Local unification is enabled...
% 0.12/0.35 # Any saturation attempts will use folding labels...
% 0.12/0.35 # 4 beginning clauses after preprocessing and clausification
% 0.12/0.35 # Creating start rules for all 4 conjectures.
% 0.12/0.35 # There are 4 start rule candidates:
% 0.12/0.35 # Found 3 unit axioms.
% 0.12/0.35 # Closed tableau found in foldup close cycle with 0 folds and 3 closures done.
% 0.12/0.35 # Found closed tableau while making start rule
% 0.12/0.35 # There were 0 total branch saturation attempts.
% 0.12/0.35 # There were 0 of these attempts blocked.
% 0.12/0.35 # There were 0 deferred branch saturation attempts.
% 0.12/0.35 # There were 0 free duplicated saturations.
% 0.12/0.35 # There were 0 total successful branch saturations.
% 0.12/0.35 # There were 0 successful branch saturations in interreduction.
% 0.12/0.35 # There were 0 successful branch saturations on the branch.
% 0.12/0.35 # There were 0 successful branch saturations after the branch.
% 0.12/0.35 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.35 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.35 # Begin clausification derivation
% 0.12/0.35
% 0.12/0.35 # End clausification derivation
% 0.12/0.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.35 cnf(i_0_2, negated_conjecture, (p201(esk2_0))).
% 0.12/0.35 cnf(i_0_1, negated_conjecture, (p101(esk2_0))).
% 0.12/0.35 cnf(i_0_3, negated_conjecture, (r1(esk1_0,esk2_0))).
% 0.12/0.35 cnf(i_0_4, negated_conjecture, (~p101(X1)|~p201(X1)|~r1(esk1_0,X1))).
% 0.12/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.35 # Begin printing tableau
% 0.12/0.35 # Found 4 steps
% 0.12/0.35 cnf(i_0_4, negated_conjecture, (~p101(esk2_0)|~p201(esk2_0)|~r1(esk1_0,esk2_0)), inference(start_rule)).
% 0.12/0.35 cnf(i_0_5, plain, (~p101(esk2_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.35 cnf(i_0_6, plain, (~p201(esk2_0)), inference(closure_rule, [i_0_2])).
% 0.12/0.35 cnf(i_0_7, plain, (~r1(esk1_0,esk2_0)), inference(closure_rule, [i_0_3])).
% 0.12/0.35 # End printing tableau
% 0.12/0.35 # SZS output end
% 0.12/0.35 # Branches closed with saturation will be marked with an "s"
% 0.12/0.35 # NOT attempting initial tableau saturation
% 0.12/0.35 # 1 start rule tableaux created.
% 0.12/0.35 # 1 extension rule candidate clauses
% 0.12/0.35 # 3 unit axiom clauses
% 0.12/0.35
% 0.12/0.35 # Proof search is over...
% 0.12/0.35 # Freeing feature tree
%------------------------------------------------------------------------------