TSTP Solution File: LCL657+1.001 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL657+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 : n027.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:56 EDT 2022
% Result : CounterSatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL657+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 22:00:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.12/0.36 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 17 Number of unprocessed: 17
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 17 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 16 conjectures.
% 0.12/0.36 # There are 16 start rule candidates:
% 0.12/0.36 # Found 3 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 16 start rule tableaux created.
% 0.12/0.36 # 14 extension rule candidate clauses
% 0.12/0.36 # 3 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # 13258 Satisfiable branch
% 0.12/0.37 # 13252 Satisfiable branch
% 0.12/0.37 # 13257 Satisfiable branch
% 0.12/0.37 # Satisfiable branch found.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 0 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 0 successful branch saturations after the branch.
% 0.12/0.37 # 13253 Satisfiable branch
% 0.12/0.37 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_2, negated_conjecture, (p100(esk1_0))).
% 0.12/0.37 cnf(i_0_1, plain, (r1(X1,X1))).
% 0.12/0.37 cnf(i_0_3, negated_conjecture, (~p101(esk1_0))).
% 0.12/0.37 cnf(i_0_5, negated_conjecture, (p101(X1)|~p102(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_4, negated_conjecture, (p100(X1)|~p101(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_12, negated_conjecture, (p101(X1)|p2(esk3_1(X1))|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (p101(esk2_1(X1))|p101(X1)|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (p101(X1)|~p100(X1)|~p2(esk2_1(X1))|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (p101(X1)|~p100(X1)|~p102(esk2_1(X1))|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_11, negated_conjecture, (p101(X1)|~p100(X1)|~p102(esk3_1(X1))|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_10, negated_conjecture, (p101(esk3_1(X1))|p101(X1)|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_17, negated_conjecture, (p101(X1)|r1(X1,esk2_1(X1))|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (p101(X1)|r1(X1,esk3_1(X1))|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_8, negated_conjecture, (p2(X1)|~p101(X1)|~p101(X2)|~p2(X2)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.12/0.37 cnf(i_0_9, negated_conjecture, (p2(X1)|~p101(X2)|~p101(X1)|~p2(X2)|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.12/0.37 cnf(i_0_6, negated_conjecture, (p1(X1)|~p1(X2)|~p100(X1)|~p100(X2)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.12/0.37 cnf(i_0_7, negated_conjecture, (p1(X1)|~p1(X2)|~p100(X2)|~p100(X1)|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 6 steps
% 0.12/0.37 cnf(i_0_2, negated_conjecture, (p100(esk1_0)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_81, plain, (p100(esk1_0)), inference(extension_rule, [i_0_13])).
% 0.12/0.37 cnf(i_0_664, plain, (p101(esk1_0)), inference(closure_rule, [i_0_3])).
% 0.12/0.37 cnf(i_0_667, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.37 cnf(i_0_665, plain, (r1(esk1_0,esk3_1(esk1_0))), inference(extension_rule, [i_0_9])).
% 0.12/0.37 cnf(i_0_673, plain, (~r1(esk3_1(esk1_0),esk3_1(esk1_0))), inference(closure_rule, [i_0_1])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Satisfiable branch found.
% 0.12/0.37 # Satisfiable branch found.
% 0.12/0.37 # There were 2 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 0 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 0 successful branch saturations after the branch.
% 0.12/0.37 # 13254 Satisfiable branch
% 0.12/0.37 # Satisfiable branch found.
% 0.12/0.37 # There were 2 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_2, negated_conjecture, (p100(esk1_0))).
% 0.12/0.37 cnf(i_0_1, plain, (r1(X1,X1))).
% 0.12/0.37 cnf(i_0_3, negated_conjecture, (~p101(esk1_0))).
% 0.12/0.37 cnf(i_0_5, negated_conjecture, (p101(X1)|~p102(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_4, negated_conjecture, (p100(X1)|~p101(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_12, negated_conjecture, (p101(X1)|p2(esk3_1(X1))|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (p101(esk2_1(X1))|p101(X1)|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (p101(X1)|~p100(X1)|~p2(esk2_1(X1))|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (p101(X1)|~p100(X1)|~p102(esk2_1(X1))|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_11, negated_conjecture, (p101(X1)|~p100(X1)|~p102(esk3_1(X1))|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_10, negated_conjecture, (p101(esk3_1(X1))|p101(X1)|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_17, negated_conjecture, (p101(X1)|r1(X1,esk2_1(X1))|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (p101(X1)|r1(X1,esk3_1(X1))|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_8, negated_conjecture, (p2(X1)|~p101(X1)|~p101(X2)|~p2(X2)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.12/0.37 cnf(i_0_9, negated_conjecture, (p2(X1)|~p101(X2)|~p101(X1)|~p2(X2)|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.12/0.37 cnf(i_0_6, negated_conjecture, (p1(X1)|~p1(X2)|~p100(X1)|~p100(X2)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.12/0.37 cnf(i_0_7, negated_conjecture, (p1(X1)|~p1(X2)|~p100(X2)|~p100(X1)|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 16 steps
% 0.12/0.37 cnf(i_0_10, negated_conjecture, (p101(esk3_1(esk1_0))|p101(esk1_0)|~p100(esk1_0)|~r1(esk1_0,esk1_0)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_262, plain, (p101(esk2_1(esk1_0))), inference(closure_rule, [i_0_0])).
% 0.12/0.37 cnf(i_0_263, plain, (~p100(esk2_1(esk1_0))), inference(closure_rule, [i_0_0])).
% 0.12/0.37 cnf(i_0_96, plain, (~p101(esk2_1(esk2_1(esk1_0)))), inference(closure_rule, [i_0_0])).
% 0.12/0.37 cnf(i_0_97, plain, (~p2(esk3_1(esk1_0))), inference(closure_rule, [i_0_0])).
% 0.12/0.37 cnf(i_0_98, plain, (~r1(esk1_0,esk2_1(esk2_1(esk1_0)))), inference(closure_rule, [i_0_0])).
% 0.12/0.37 cnf(i_0_99, plain, (~r1(esk2_1(esk2_1(esk1_0)),esk3_1(esk1_0))), inference(closure_rule, [i_0_0])).
% 0.12/0.37 cnf(i_0_51, plain, (p101(esk1_0)), inference(closure_rule, [i_0_3])).
% 0.12/0.37 cnf(i_0_52, plain, (~p100(esk1_0)), inference(closure_rule, [i_0_2])).
% 0.12/0.37 cnf(i_0_53, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.37 cnf(i_0_50, plain, (p101(esk3_1(esk1_0))), inference(extension_rule, [i_0_9])).
% 0.12/0.37 cnf(i_0_94, plain, (p2(esk2_1(esk2_1(esk1_0)))), inference(extension_rule, [i_0_16])).
% 0.12/0.37 cnf(i_0_265, plain, (~r1(esk1_0,esk2_1(esk1_0))), inference(extension_rule, [i_0_17])).
% 0.12/0.37 cnf(i_0_1078, plain, (p101(esk1_0)), inference(closure_rule, [i_0_3])).
% 0.12/0.37 cnf(i_0_1080, plain, (~p100(esk1_0)), inference(closure_rule, [i_0_2])).
% 0.12/0.37 cnf(i_0_1081, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_2, negated_conjecture, (p100(esk1_0))).
% 0.12/0.37 cnf(i_0_1, plain, (r1(X1,X1))).
% 0.12/0.37 cnf(i_0_3, negated_conjecture, (~p101(esk1_0))).
% 0.12/0.37 cnf(i_0_5, negated_conjecture, (p101(X1)|~p102(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_4, negated_conjecture, (p100(X1)|~p101(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_12, negated_conjecture, (p101(X1)|p2(esk3_1(X1))|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_14, negated_conjecture, (p101(esk2_1(X1))|p101(X1)|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (p101(X1)|~p100(X1)|~p2(esk2_1(X1))|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_15, negated_conjecture, (p101(X1)|~p100(X1)|~p102(esk2_1(X1))|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_11, negated_conjecture, (p101(X1)|~p100(X1)|~p102(esk3_1(X1))|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_10, negated_conjecture, (p101(esk3_1(X1))|p101(X1)|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_17, negated_conjecture, (p101(X1)|r1(X1,esk2_1(X1))|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_13, negated_conjecture, (p101(X1)|r1(X1,esk3_1(X1))|~p100(X1)|~r1(esk1_0,X1))).
% 0.12/0.37 cnf(i_0_8, negated_conjecture, (p2(X1)|~p101(X1)|~p101(X2)|~p2(X2)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.12/0.37 cnf(i_0_9, negated_conjecture, (p2(X1)|~p101(X2)|~p101(X1)|~p2(X2)|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.12/0.37 cnf(i_0_6, negated_conjecture, (p1(X1)|~p1(X2)|~p100(X1)|~p100(X2)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.12/0.37 cnf(i_0_7, negated_conjecture, (p1(X1)|~p1(X2)|~p100(X2)|~p100(X1)|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 9 steps
% 0.12/0.37 cnf(i_0_16, negated_conjecture, (p101(esk1_0)|~p100(esk1_0)|~p2(esk2_1(esk1_0))|~r1(esk1_0,esk1_0)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_62, plain, (p101(esk1_0)), inference(closure_rule, [i_0_3])).
% 0.12/0.37 cnf(i_0_63, plain, (~p100(esk1_0)), inference(closure_rule, [i_0_2])).
% 0.12/0.37 cnf(i_0_65, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.37 cnf(i_0_64, plain, (~p2(esk2_1(esk1_0))), inference(extension_rule, [i_0_9])).
% 0.12/0.37 cnf(i_0_157, plain, (~p101(esk1_0)), inference(extension_rule, [i_0_13])).
% 0.12/0.37 cnf(i_0_182, plain, (~p100(esk1_0)), inference(closure_rule, [i_0_2])).
% 0.12/0.37 cnf(i_0_183, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.37 cnf(i_0_158, plain, (~p101(esk2_1(esk1_0))), inference(etableau_closure_rule, [i_0_158, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # 13251 Satisfiable branch
% 0.12/0.37 # Child (13258) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------