TSTP Solution File: LCL665+1.001 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL665+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 : n020.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:24:08 EDT 2022
% Result : CounterSatisfiable 0.22s 0.42s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL665+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sun Jul 3 21:51:29 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.39 # No SInE strategy applied
% 0.15/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.15/0.39 #
% 0.15/0.39 # Presaturation interreduction done
% 0.15/0.39 # Number of axioms: 37 Number of unprocessed: 37
% 0.15/0.39 # Tableaux proof search.
% 0.15/0.39 # APR header successfully linked.
% 0.15/0.39 # Hello from C++
% 0.15/0.39 # The folding up rule is enabled...
% 0.15/0.39 # Local unification is enabled...
% 0.15/0.39 # Any saturation attempts will use folding labels...
% 0.15/0.39 # 37 beginning clauses after preprocessing and clausification
% 0.15/0.39 # Creating start rules for all 36 conjectures.
% 0.15/0.39 # There are 36 start rule candidates:
% 0.15/0.39 # Found 9 unit axioms.
% 0.15/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.15/0.39 # 36 start rule tableaux created.
% 0.15/0.39 # 28 extension rule candidate clauses
% 0.15/0.39 # 9 unit axiom clauses
% 0.15/0.39
% 0.15/0.39 # Requested 8, 32 cores available to the main process.
% 0.22/0.42 # 31415 Satisfiable branch
% 0.22/0.42 # 31418 Satisfiable branch
% 0.22/0.42 # Satisfiable branch found.
% 0.22/0.42 # There were 1 total branch saturation attempts.
% 0.22/0.42 # There were 0 of these attempts blocked.
% 0.22/0.42 # There were 0 deferred branch saturation attempts.
% 0.22/0.42 # There were 0 free duplicated saturations.
% 0.22/0.42 # There were 0 total successful branch saturations.
% 0.22/0.42 # There were 0 successful branch saturations in interreduction.
% 0.22/0.42 # There were 0 successful branch saturations on the branch.
% 0.22/0.42 # There were 0 successful branch saturations after the branch.
% 0.22/0.42 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.42 # Begin clausification derivation
% 0.22/0.42
% 0.22/0.42 # End clausification derivation
% 0.22/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.22/0.42 cnf(i_0_9, negated_conjecture, (r1(esk1_0,esk14_0))).
% 0.22/0.42 cnf(i_0_7, negated_conjecture, (r1(esk1_0,esk15_0))).
% 0.22/0.42 cnf(i_0_5, negated_conjecture, (r1(esk1_0,esk16_0))).
% 0.22/0.42 cnf(i_0_1, plain, (r1(X1,X1))).
% 0.22/0.42 cnf(i_0_3, negated_conjecture, (r1(esk1_0,esk17_0))).
% 0.22/0.42 cnf(i_0_8, negated_conjecture, (~p15(esk14_0))).
% 0.22/0.42 cnf(i_0_6, negated_conjecture, (~p13(esk15_0))).
% 0.22/0.42 cnf(i_0_2, negated_conjecture, (~p11(esk17_0))).
% 0.22/0.42 cnf(i_0_4, negated_conjecture, (~p12(esk16_0))).
% 0.22/0.42 cnf(i_0_32, negated_conjecture, (p16(X1)|~p26(esk2_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_28, negated_conjecture, (p16(X1)|~p24(esk4_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_24, negated_conjecture, (p16(X1)|~p22(esk6_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_30, negated_conjecture, (p14(X1)|~p26(esk3_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_26, negated_conjecture, (p14(X1)|~p24(esk5_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_22, negated_conjecture, (p14(X1)|~p22(esk7_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_20, negated_conjecture, (p15(X1)|~p23(esk8_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_18, negated_conjecture, (p15(X1)|~p21(esk9_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_16, negated_conjecture, (p13(X1)|~p23(esk10_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_14, negated_conjecture, (p13(X1)|~p21(esk11_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_12, negated_conjecture, (p11(X1)|~p23(esk12_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_10, negated_conjecture, (p11(X1)|~p21(esk13_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_37, negated_conjecture, (p26(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.22/0.42 cnf(i_0_33, negated_conjecture, (p16(X1)|r1(X1,esk2_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_36, negated_conjecture, (p25(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.22/0.42 cnf(i_0_35, negated_conjecture, (p24(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.22/0.42 cnf(i_0_34, negated_conjecture, (p22(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.22/0.42 cnf(i_0_29, negated_conjecture, (p16(X1)|r1(X1,esk4_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_25, negated_conjecture, (p16(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_31, negated_conjecture, (p14(X1)|r1(X1,esk3_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_27, negated_conjecture, (p14(X1)|r1(X1,esk5_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_23, negated_conjecture, (p14(X1)|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_21, negated_conjecture, (p15(X1)|r1(X1,esk8_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_19, negated_conjecture, (p15(X1)|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_17, negated_conjecture, (p13(X1)|r1(X1,esk10_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_15, negated_conjecture, (p13(X1)|r1(X1,esk11_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_13, negated_conjecture, (p11(X1)|r1(X1,esk12_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_11, negated_conjecture, (p11(X1)|r1(X1,esk13_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.22/0.42 # Begin printing tableau
% 0.22/0.42 # Found 5 steps
% 0.22/0.42 cnf(i_0_3, negated_conjecture, (r1(esk1_0,esk17_0)), inference(start_rule)).
% 0.22/0.42 cnf(i_0_1593, plain, (~r1(esk17_0,esk7_1(esk1_0))), inference(closure_rule, [i_0_0])).
% 0.22/0.42 cnf(i_0_126, plain, (r1(esk1_0,esk17_0)), inference(extension_rule, [i_0_34])).
% 0.22/0.42 cnf(i_0_1591, plain, (p22(esk7_1(esk1_0))), inference(extension_rule, [i_0_22])).
% 0.22/0.42 cnf(i_0_1710, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.22/0.42 # End printing tableau
% 0.22/0.42 # SZS output end
% 0.22/0.42 # Branches closed with saturation will be marked with an "s"
% 0.22/0.42 # Satisfiable branch found.
% 0.22/0.42 # There were 1 total branch saturation attempts.
% 0.22/0.42 # There were 0 of these attempts blocked.
% 0.22/0.42 # There were 0 deferred branch saturation attempts.
% 0.22/0.42 # There were 0 free duplicated saturations.
% 0.22/0.42 # There were 0 total successful branch saturations.
% 0.22/0.42 # There were 0 successful branch saturations in interreduction.
% 0.22/0.42 # There were 0 successful branch saturations on the branch.
% 0.22/0.42 # There were 0 successful branch saturations after the branch.
% 0.22/0.42 # Child (31415) has found a proof.
% 0.22/0.42
% 0.22/0.42 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.42 # Begin clausification derivation
% 0.22/0.42
% 0.22/0.42 # End clausification derivation
% 0.22/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.22/0.42 cnf(i_0_9, negated_conjecture, (r1(esk1_0,esk14_0))).
% 0.22/0.42 cnf(i_0_7, negated_conjecture, (r1(esk1_0,esk15_0))).
% 0.22/0.42 cnf(i_0_5, negated_conjecture, (r1(esk1_0,esk16_0))).
% 0.22/0.42 cnf(i_0_1, plain, (r1(X1,X1))).
% 0.22/0.42 cnf(i_0_3, negated_conjecture, (r1(esk1_0,esk17_0))).
% 0.22/0.42 cnf(i_0_8, negated_conjecture, (~p15(esk14_0))).
% 0.22/0.42 cnf(i_0_6, negated_conjecture, (~p13(esk15_0))).
% 0.22/0.42 cnf(i_0_2, negated_conjecture, (~p11(esk17_0))).
% 0.22/0.42 cnf(i_0_4, negated_conjecture, (~p12(esk16_0))).
% 0.22/0.42 cnf(i_0_32, negated_conjecture, (p16(X1)|~p26(esk2_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_28, negated_conjecture, (p16(X1)|~p24(esk4_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_24, negated_conjecture, (p16(X1)|~p22(esk6_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_30, negated_conjecture, (p14(X1)|~p26(esk3_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_26, negated_conjecture, (p14(X1)|~p24(esk5_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_22, negated_conjecture, (p14(X1)|~p22(esk7_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_20, negated_conjecture, (p15(X1)|~p23(esk8_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_18, negated_conjecture, (p15(X1)|~p21(esk9_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_16, negated_conjecture, (p13(X1)|~p23(esk10_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_14, negated_conjecture, (p13(X1)|~p21(esk11_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_12, negated_conjecture, (p11(X1)|~p23(esk12_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_10, negated_conjecture, (p11(X1)|~p21(esk13_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_37, negated_conjecture, (p26(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.22/0.42 cnf(i_0_33, negated_conjecture, (p16(X1)|r1(X1,esk2_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_36, negated_conjecture, (p25(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.22/0.42 cnf(i_0_35, negated_conjecture, (p24(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.22/0.42 cnf(i_0_34, negated_conjecture, (p22(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.22/0.42 cnf(i_0_29, negated_conjecture, (p16(X1)|r1(X1,esk4_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_25, negated_conjecture, (p16(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_31, negated_conjecture, (p14(X1)|r1(X1,esk3_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_27, negated_conjecture, (p14(X1)|r1(X1,esk5_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_23, negated_conjecture, (p14(X1)|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_21, negated_conjecture, (p15(X1)|r1(X1,esk8_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_19, negated_conjecture, (p15(X1)|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_17, negated_conjecture, (p13(X1)|r1(X1,esk10_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_15, negated_conjecture, (p13(X1)|r1(X1,esk11_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_13, negated_conjecture, (p11(X1)|r1(X1,esk12_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 cnf(i_0_11, negated_conjecture, (p11(X1)|r1(X1,esk13_1(X1))|~r1(esk1_0,X1))).
% 0.22/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.22/0.42 # Begin printing tableau
% 0.22/0.42 # Found 5 steps
% 0.22/0.42 cnf(i_0_9, negated_conjecture, (r1(esk1_0,esk14_0)), inference(start_rule)).
% 0.22/0.42 cnf(i_0_1593, plain, (~r1(esk14_0,esk7_1(esk1_0))), inference(closure_rule, [i_0_0])).
% 0.22/0.42 cnf(i_0_129, plain, (r1(esk1_0,esk14_0)), inference(extension_rule, [i_0_34])).
% 0.22/0.42 cnf(i_0_1591, plain, (p22(esk7_1(esk1_0))), inference(extension_rule, [i_0_22])).
% 0.22/0.42 cnf(i_0_1710, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.22/0.42 # End printing tableau
% 0.22/0.42 # SZS output end
% 0.22/0.42 # Branches closed with saturation will be marked with an "s"
% 0.22/0.42 # Ran out of tableaux, making start rules for all clauses
% 0.22/0.42 # 31419 Satisfiable branch
% 0.22/0.42 # Proof search is over...
% 0.22/0.42 # Freeing feature tree
%------------------------------------------------------------------------------