TSTP Solution File: LCL638+1.001 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL638+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 : 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:23:24 EDT 2022
% Result : Theorem 0.21s 0.41s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL638+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/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 : n004.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 : Sun Jul 3 09:38:53 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.39 # No SInE strategy applied
% 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.39 #
% 0.14/0.39 # Presaturation interreduction done
% 0.14/0.39 # Number of axioms: 14 Number of unprocessed: 14
% 0.14/0.39 # Tableaux proof search.
% 0.14/0.39 # APR header successfully linked.
% 0.14/0.39 # Hello from C++
% 0.14/0.39 # The folding up rule is enabled...
% 0.14/0.39 # Local unification is enabled...
% 0.14/0.39 # Any saturation attempts will use folding labels...
% 0.14/0.39 # 14 beginning clauses after preprocessing and clausification
% 0.14/0.39 # Creating start rules for all 14 conjectures.
% 0.14/0.39 # There are 14 start rule candidates:
% 0.14/0.39 # Found 2 unit axioms.
% 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.39 # 14 start rule tableaux created.
% 0.14/0.39 # 12 extension rule candidate clauses
% 0.14/0.39 # 2 unit axiom clauses
% 0.14/0.39
% 0.14/0.39 # Requested 8, 32 cores available to the main process.
% 0.21/0.41 # Ran out of tableaux, making start rules for all clauses
% 0.21/0.41 # There were 7 total branch saturation attempts.
% 0.21/0.41 # There were 0 of these attempts blocked.
% 0.21/0.41 # There were 0 deferred branch saturation attempts.
% 0.21/0.41 # There were 0 free duplicated saturations.
% 0.21/0.41 # There were 7 total successful branch saturations.
% 0.21/0.41 # There were 0 successful branch saturations in interreduction.
% 0.21/0.41 # There were 0 successful branch saturations on the branch.
% 0.21/0.41 # There were 7 successful branch saturations after the branch.
% 0.21/0.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.41 # Begin clausification derivation
% 0.21/0.41
% 0.21/0.41 # End clausification derivation
% 0.21/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.41 cnf(i_0_3, negated_conjecture, (r1(esk1_0,esk8_0))).
% 0.21/0.41 cnf(i_0_2, negated_conjecture, (~p1(esk8_0))).
% 0.21/0.41 cnf(i_0_1, negated_conjecture, (p1(X1)|~r1(esk8_0,X1))).
% 0.21/0.41 cnf(i_0_4, negated_conjecture, (r1(X1,esk7_1(X1))|~r1(esk1_0,X1))).
% 0.21/0.41 cnf(i_0_13, negated_conjecture, (p1(X1)|~p1(esk2_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.21/0.41 cnf(i_0_11, negated_conjecture, (p1(esk3_2(X1,X2))|~p1(X1)|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.21/0.41 cnf(i_0_14, negated_conjecture, (p1(X1)|r1(X2,esk2_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.21/0.41 cnf(i_0_5, negated_conjecture, (p1(X1)|~p1(esk6_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.21/0.41 cnf(i_0_12, negated_conjecture, (r1(X1,esk3_2(X2,X1))|~p1(X2)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.21/0.41 cnf(i_0_6, negated_conjecture, (p1(X1)|r1(X2,esk6_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.21/0.41 cnf(i_0_7, negated_conjecture, (p1(esk4_3(X1,X2,X3))|~p1(X4)|~r1(esk5_1(X1),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 0.21/0.41 cnf(i_0_8, negated_conjecture, (p1(esk4_3(X1,X2,X3))|r1(X1,esk5_1(X1))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 0.21/0.41 cnf(i_0_9, negated_conjecture, (r1(X1,esk4_3(X2,X3,X1))|~p1(X4)|~r1(esk5_1(X2),X4)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.21/0.41 cnf(i_0_10, negated_conjecture, (r1(X1,esk4_3(X2,X3,X1))|r1(X2,esk5_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.21/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.41 # Begin printing tableau
% 0.21/0.41 # Found 19 steps
% 0.21/0.41 cnf(i_0_6, negated_conjecture, (p1(esk8_0)|r1(esk8_0,esk6_1(esk8_0))|~r1(esk1_0,esk8_0)|~r1(esk1_0,esk8_0)|~r1(esk8_0,esk1_0)), inference(start_rule)).
% 0.21/0.41 cnf(i_0_37, plain, (p1(esk8_0)), inference(closure_rule, [i_0_2])).
% 0.21/0.41 cnf(i_0_39, plain, (~r1(esk1_0,esk8_0)), inference(closure_rule, [i_0_3])).
% 0.21/0.41 cnf(i_0_40, plain, (~r1(esk1_0,esk8_0)), inference(closure_rule, [i_0_3])).
% 0.21/0.41 cnf(i_0_38, plain, (r1(esk8_0,esk6_1(esk8_0))), inference(extension_rule, [i_0_10])).
% 0.21/0.41 cnf(i_0_71, plain, (~r1(esk1_0,esk8_0)), inference(closure_rule, [i_0_3])).
% 0.21/0.41 cnf(i_0_69, plain, (r1(esk6_1(esk8_0),esk4_3(esk8_0,esk8_0,esk6_1(esk8_0)))), inference(extension_rule, [i_0_9])).
% 0.21/0.41 cnf(i_0_77, plain, (~r1(esk1_0,esk8_0)), inference(closure_rule, [i_0_3])).
% 0.21/0.41 cnf(i_0_79, plain, (~r1(esk8_0,esk6_1(esk8_0))), inference(closure_rule, [i_0_38])).
% 0.21/0.41 cnf(i_0_41, plain, (~r1(esk8_0,esk1_0)), inference(etableau_closure_rule, [i_0_41, ...])).
% 0.21/0.41 cnf(i_0_70, plain, (r1(esk8_0,esk5_1(esk8_0))), inference(etableau_closure_rule, [i_0_70, ...])).
% 0.21/0.41 cnf(i_0_73, plain, (~r1(esk8_0,esk8_0)), inference(etableau_closure_rule, [i_0_73, ...])).
% 0.21/0.41 cnf(i_0_74, plain, (r1(esk4_3(esk8_0,esk8_0,esk6_1(esk8_0)),esk4_3(esk8_0,esk6_1(esk8_0),esk4_3(esk8_0,esk8_0,esk6_1(esk8_0))))), inference(etableau_closure_rule, [i_0_74, ...])).
% 0.21/0.41 cnf(i_0_75, plain, (~p1(esk4_3(esk8_0,esk1_0,esk8_0))), inference(extension_rule, [i_0_8])).
% 0.21/0.41 cnf(i_0_207, plain, (~r1(esk1_0,esk8_0)), inference(closure_rule, [i_0_3])).
% 0.21/0.41 cnf(i_0_208, plain, (~r1(esk1_0,esk8_0)), inference(closure_rule, [i_0_3])).
% 0.21/0.41 cnf(i_0_76, plain, (~r1(esk5_1(esk8_0),esk4_3(esk8_0,esk1_0,esk8_0))), inference(etableau_closure_rule, [i_0_76, ...])).
% 0.21/0.41 cnf(i_0_206, plain, (r1(esk8_0,esk5_1(esk8_0))), inference(etableau_closure_rule, [i_0_206, ...])).
% 0.21/0.41 cnf(i_0_209, plain, (~r1(esk8_0,esk1_0)), inference(etableau_closure_rule, [i_0_209, ...])).
% 0.21/0.41 # End printing tableau
% 0.21/0.41 # SZS output end
% 0.21/0.41 # Branches closed with saturation will be marked with an "s"
% 0.21/0.41 # Child (22570) has found a proof.
% 0.21/0.41
% 0.21/0.41 # Proof search is over...
% 0.21/0.41 # Freeing feature tree
%------------------------------------------------------------------------------