TSTP Solution File: NLP026-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP026-1 : TPTP v8.1.0. Released v2.4.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 : n015.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 : Mon Jul 18 02:11:46 EDT 2022
% Result : Satisfiable 4.19s 1.17s
% Output : CNFRefutation 4.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NLP026-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Fri Jul 1 04:49:12 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.14/0.38 # and selection function SelectNewComplexAHP.
% 0.14/0.38 #
% 0.14/0.38 # Presaturation interreduction done
% 0.14/0.38 # Number of axioms: 46 Number of unprocessed: 46
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.14/0.38 # The folding up rule is enabled...
% 0.14/0.38 # Local unification is enabled...
% 0.14/0.38 # Any saturation attempts will use folding labels...
% 0.14/0.38 # 46 beginning clauses after preprocessing and clausification
% 0.14/0.38 # Creating start rules for all 46 conjectures.
% 0.14/0.38 # There are 46 start rule candidates:
% 0.14/0.38 # Found 2 unit axioms.
% 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.38 # 46 start rule tableaux created.
% 0.14/0.38 # 44 extension rule candidate clauses
% 0.14/0.38 # 2 unit axiom clauses
% 0.14/0.38
% 0.14/0.38 # Requested 8, 32 cores available to the main process.
% 4.19/1.16 # 22556 Satisfiable branch
% 4.19/1.17 # Satisfiable branch found.
% 4.19/1.17 # There were 2 total branch saturation attempts.
% 4.19/1.17 # There were 0 of these attempts blocked.
% 4.19/1.17 # There were 0 deferred branch saturation attempts.
% 4.19/1.17 # There were 0 free duplicated saturations.
% 4.19/1.17 # There were 1 total successful branch saturations.
% 4.19/1.17 # There were 0 successful branch saturations in interreduction.
% 4.19/1.17 # There were 0 successful branch saturations on the branch.
% 4.19/1.17 # There were 1 successful branch saturations after the branch.
% 4.19/1.17 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.19/1.17 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.19/1.17 # Begin clausification derivation
% 4.19/1.17
% 4.19/1.17 # End clausification derivation
% 4.19/1.17 # Begin listing active clauses obtained from FOF to CNF conversion
% 4.19/1.17 cnf(i_0_47, negated_conjecture, (actual_world(skc64))).
% 4.19/1.17 cnf(i_0_48, negated_conjecture, (actual_world(skc5))).
% 4.19/1.17 cnf(i_0_51, negated_conjecture, (group(skc5,skc6)|~ssSkC0)).
% 4.19/1.17 cnf(i_0_49, negated_conjecture, (group(skc64,skc65)|ssSkC0)).
% 4.19/1.17 cnf(i_0_52, negated_conjecture, (ssSkP3(skc6,skc5)|~ssSkC0)).
% 4.19/1.17 cnf(i_0_50, negated_conjecture, (table(skc64,skc66)|ssSkC0)).
% 4.19/1.17 cnf(i_0_53, negated_conjecture, (ssSkP2(skc66,skc65,skc64)|ssSkC0)).
% 4.19/1.17 cnf(i_0_56, negated_conjecture, (hamburger(skc5,X1)|~member(skc5,X1,skc6)|~ssSkC0)).
% 4.19/1.17 cnf(i_0_55, negated_conjecture, (hamburger(skc64,X1)|ssSkC0|~member(skc64,X1,skc65))).
% 4.19/1.17 cnf(i_0_75, negated_conjecture, (ssSkC0|~hamburger(X1,skf34(X1,X2))|~ssSkP3(X3,X1)|~group(X1,X3)|~actual_world(X1))).
% 4.19/1.17 cnf(i_0_61, negated_conjecture, (group(X1,skf29(X1,X2))|~member(X1,X3,X4)|~ssSkP3(X4,X1))).
% 4.19/1.17 cnf(i_0_54, negated_conjecture, (member(X1,skf31(X1,X2),X2)|ssSkP3(X2,X1))).
% 4.19/1.17 cnf(i_0_60, negated_conjecture, (three(X1,skf29(X1,X2))|~member(X1,X3,X4)|~ssSkP3(X4,X1))).
% 4.19/1.17 cnf(i_0_76, negated_conjecture, (member(X1,skf34(X1,X2),X2)|ssSkC0|~ssSkP3(X2,X1)|~group(X1,X2)|~actual_world(X1))).
% 4.19/1.17 cnf(i_0_62, negated_conjecture, (ssSkP1(X1,skf29(X2,X1),X2)|~member(X2,X1,X3)|~ssSkP3(X3,X2))).
% 4.19/1.17 cnf(i_0_86, negated_conjecture, (~hamburger(X1,skf14(X1,X2))|~ssSkP2(X3,X4,X1)|~table(X1,X3)|~group(X1,X4)|~ssSkC0|~actual_world(X1))).
% 4.19/1.17 cnf(i_0_58, negated_conjecture, (member(X1,skf26(X1,X2,X3),X3)|ssSkP2(X2,X3,X1))).
% 4.19/1.17 cnf(i_0_57, negated_conjecture, (ssSkP1(X1,X2,X3)|member(X3,skf22(X1,X3,X2),X2))).
% 4.19/1.17 cnf(i_0_80, negated_conjecture, (young(X1,X2)|~member(X1,X2,skf29(X1,X3))|~member(X1,X4,X5)|~ssSkP3(X5,X1))).
% 4.19/1.17 cnf(i_0_81, negated_conjecture, (guy(X1,X2)|~member(X1,X2,skf29(X1,X3))|~member(X1,X4,X5)|~ssSkP3(X5,X1))).
% 4.19/1.17 cnf(i_0_68, negated_conjecture, (group(X1,skf24(X1,X2,X3))|~member(X1,X4,X5)|~ssSkP2(X6,X5,X1))).
% 4.19/1.17 cnf(i_0_84, negated_conjecture, (young(X1,X2)|~member(X1,X2,skf24(X1,X3,X4))|~member(X1,X5,X6)|~ssSkP2(X7,X6,X1))).
% 4.19/1.17 cnf(i_0_59, negated_conjecture, (ssSkP0(X1,X2,X3,X4)|member(X4,skf17(X3,X4,X5,X6),X3))).
% 4.19/1.17 cnf(i_0_63, negated_conjecture, (table(X1,skf19(X1,X2,X3))|~ssSkP1(X4,X5,X1)|~member(X1,X6,X5))).
% 4.19/1.17 cnf(i_0_67, negated_conjecture, (three(X1,skf24(X1,X2,X3))|~member(X1,X4,X5)|~ssSkP2(X6,X5,X1))).
% 4.19/1.17 cnf(i_0_64, negated_conjecture, (sit(X1,skf18(X1,X2,X3))|~ssSkP1(X4,X5,X1)|~member(X1,X6,X5))).
% 4.19/1.17 cnf(i_0_65, negated_conjecture, (present(X1,skf18(X1,X2,X3))|~ssSkP1(X4,X5,X1)|~member(X1,X6,X5))).
% 4.19/1.17 cnf(i_0_85, negated_conjecture, (member(X1,skf14(X1,X2),X2)|~ssSkP2(X3,X2,X1)|~table(X1,X3)|~group(X1,X2)|~ssSkC0|~actual_world(X1))).
% 4.19/1.17 cnf(i_0_66, negated_conjecture, (event(X1,skf18(X1,X2,X3))|~ssSkP1(X4,X5,X1)|~member(X1,X6,X5))).
% 4.19/1.17 cnf(i_0_83, negated_conjecture, (guy(X1,X2)|~member(X1,X2,skf24(X1,X3,X4))|~member(X1,X5,X6)|~ssSkP2(X7,X6,X1))).
% 4.19/1.17 cnf(i_0_69, negated_conjecture, (with(X1,skf18(X1,X2,X3),X3)|~ssSkP1(X3,X4,X1)|~member(X1,X2,X4))).
% 4.19/1.17 cnf(i_0_70, negated_conjecture, (agent(X1,skf18(X1,X2,X3),X2)|~ssSkP1(X4,X5,X1)|~member(X1,X2,X5))).
% 4.19/1.17 cnf(i_0_73, negated_conjecture, (sit(X1,skf15(X1,X2,X3,X4))|~ssSkP0(X5,X6,X7,X1)|~member(X1,X8,X7))).
% 4.19/1.17 cnf(i_0_72, negated_conjecture, (present(X1,skf15(X1,X2,X3,X4))|~ssSkP0(X5,X6,X7,X1)|~member(X1,X8,X7))).
% 4.19/1.17 cnf(i_0_71, negated_conjecture, (event(X1,skf15(X1,X2,X3,X4))|~ssSkP0(X5,X6,X7,X1)|~member(X1,X8,X7))).
% 4.19/1.17 cnf(i_0_87, negated_conjecture, (member(X1,skf32(X1,X2),X2)|ssSkP3(X3,X1)|~three(X1,X2)|~ssSkP1(skf31(X1,X4),X2,X1)|~group(X1,X2))).
% 4.19/1.17 cnf(i_0_89, negated_conjecture, (ssSkP3(X1,X2)|~guy(X2,skf32(X2,X3))|~young(X2,skf32(X2,X3))|~three(X2,X4)|~ssSkP1(skf31(X2,X5),X4,X2)|~group(X2,X4))).
% 4.19/1.17 cnf(i_0_74, negated_conjecture, (ssSkP0(X1,X2,skf24(X3,X2,X1),X3)|~member(X3,X1,X4)|~ssSkP2(X2,X4,X3))).
% 4.19/1.17 cnf(i_0_82, negated_conjecture, (at(X1,skf18(X1,X2,X3),skf19(X1,X3,X2))|~ssSkP1(X4,X5,X1)|~member(X1,X6,X5))).
% 4.19/1.17 cnf(i_0_79, negated_conjecture, (with(X1,skf15(X1,X2,X3,X4),X3)|~ssSkP0(X3,X5,X6,X1)|~member(X1,X2,X6))).
% 4.19/1.17 cnf(i_0_77, negated_conjecture, (agent(X1,skf15(X1,X2,X3,X4),X2)|~ssSkP0(X5,X6,X7,X1)|~member(X1,X2,X7))).
% 4.19/1.17 cnf(i_0_78, negated_conjecture, (at(X1,skf15(X1,X2,X3,X4),X4)|~ssSkP0(X3,X4,X5,X1)|~member(X1,X2,X5))).
% 4.19/1.17 cnf(i_0_90, negated_conjecture, (ssSkP2(X1,X2,X3)|~guy(X3,skf27(X3,X4))|~young(X3,skf27(X3,X4))|~three(X3,X5)|~ssSkP0(skf26(X3,X1,X6),X1,X5,X3)|~group(X3,X5))).
% 4.19/1.17 cnf(i_0_88, negated_conjecture, (member(X1,skf27(X1,X2),X2)|ssSkP2(X3,X4,X1)|~three(X1,X2)|~ssSkP0(skf26(X1,X3,X5),X3,X2,X1)|~group(X1,X2))).
% 4.19/1.17 cnf(i_0_91, negated_conjecture, (ssSkP0(X1,X2,X3,X4)|~at(X4,X5,X2)|~agent(X4,X5,skf17(X3,X4,X1,X2))|~with(X4,X5,X1)|~event(X4,X5)|~present(X4,X5)|~sit(X4,X5))).
% 4.19/1.17 cnf(i_0_92, negated_conjecture, (ssSkP1(X1,X2,X3)|~at(X3,X4,X5)|~agent(X3,X4,skf22(X1,X3,X6))|~with(X3,X4,X1)|~event(X3,X4)|~present(X3,X4)|~sit(X3,X4)|~table(X3,X5))).
% 4.19/1.17 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 4.19/1.17 # Begin printing tableau
% 4.19/1.17 # Found 26 steps
% 4.19/1.17 cnf(i_0_62, negated_conjecture, (ssSkP1(skf14(skc5,skc6),skf29(skc5,skf14(skc5,skc6)),skc5)|~member(skc5,skf14(skc5,skc6),skc6)|~ssSkP3(skc6,skc5)), inference(start_rule)).
% 4.19/1.17 cnf(i_0_212, plain, (ssSkP1(skf14(skc5,skc6),skf29(skc5,skf14(skc5,skc6)),skc5)), inference(extension_rule, [i_0_65])).
% 4.19/1.17 cnf(i_0_57976, plain, (~member(skc5,skf34(skc5,skf29(skc5,skf14(skc5,skc6))),skf29(skc5,skf14(skc5,skc6)))), inference(extension_rule, [i_0_76])).
% 4.19/1.17 cnf(i_0_60385, plain, (~actual_world(skc5)), inference(closure_rule, [i_0_48])).
% 4.19/1.17 cnf(i_0_60382, plain, (ssSkC0), inference(extension_rule, [i_0_52])).
% 4.19/1.17 cnf(i_0_60383, plain, (~ssSkP3(skf29(skc5,skf14(skc5,skc6)),skc5)), inference(extension_rule, [i_0_54])).
% 4.19/1.17 cnf(i_0_60384, plain, (~group(skc5,skf29(skc5,skf14(skc5,skc6)))), inference(extension_rule, [i_0_61])).
% 4.19/1.17 cnf(i_0_57974, plain, (present(skc5,skf18(skc5,skf22(skf14(skc5,skc6),skc5,X23),skf14(skc5,skc6)))), inference(extension_rule, [i_0_92])).
% 4.19/1.17 cnf(i_0_60580, plain, (ssSkP1(skf14(skc5,skc6),X17,skc5)), inference(extension_rule, [i_0_63])).
% 4.19/1.17 cnf(i_0_60581, plain, (~at(skc5,skf18(skc5,skf22(skf14(skc5,skc6),skc5,X23),skf14(skc5,skc6)),skf19(skc5,skf14(skc5,skc6),skf22(skf14(skc5,skc6),skc5,X23)))), inference(extension_rule, [i_0_82])).
% 4.19/1.17 cnf(i_0_60758, plain, (~ssSkP1(skf14(skc5,skc6),skf29(skc5,skf14(skc5,skc6)),skc5)), inference(closure_rule, [i_0_212])).
% 4.19/1.17 cnf(i_0_60582, plain, (~agent(skc5,skf18(skc5,skf22(skf14(skc5,skc6),skc5,X23),skf14(skc5,skc6)),skf22(skf14(skc5,skc6),skc5,X23))), inference(extension_rule, [i_0_70])).
% 4.19/1.17 cnf(i_0_60879, plain, (~ssSkP1(skf14(skc5,skc6),skf29(skc5,skf14(skc5,skc6)),skc5)), inference(closure_rule, [i_0_212])).
% 4.19/1.17 cnf(i_0_60583, plain, (~with(skc5,skf18(skc5,skf22(skf14(skc5,skc6),skc5,X23),skf14(skc5,skc6)),skf14(skc5,skc6))), inference(extension_rule, [i_0_69])).
% 4.19/1.17 cnf(i_0_61000, plain, (~ssSkP1(skf14(skc5,skc6),skf29(skc5,skf14(skc5,skc6)),skc5)), inference(closure_rule, [i_0_212])).
% 4.19/1.17 cnf(i_0_60584, plain, (~event(skc5,skf18(skc5,skf22(skf14(skc5,skc6),skc5,X23),skf14(skc5,skc6)))), inference(extension_rule, [i_0_66])).
% 4.19/1.17 cnf(i_0_61121, plain, (~ssSkP1(skf14(skc5,skc6),skf29(skc5,skf14(skc5,skc6)),skc5)), inference(closure_rule, [i_0_212])).
% 4.19/1.17 cnf(i_0_60586, plain, (~sit(skc5,skf18(skc5,skf22(skf14(skc5,skc6),skc5,X23),skf14(skc5,skc6)))), inference(extension_rule, [i_0_64])).
% 4.19/1.17 cnf(i_0_61242, plain, (~ssSkP1(skf14(skc5,skc6),skf29(skc5,skf14(skc5,skc6)),skc5)), inference(closure_rule, [i_0_212])).
% 4.19/1.17 cnf(i_0_60587, plain, (~table(skc5,skf19(skc5,skf14(skc5,skc6),skf22(skf14(skc5,skc6),skc5,X23)))), inference(extension_rule, [i_0_63])).
% 4.19/1.17 cnf(i_0_61383, plain, (~ssSkP1(skf14(skc5,skc6),skf29(skc5,skf14(skc5,skc6)),skc5)), inference(closure_rule, [i_0_212])).
% 4.19/1.17 cnf(i_0_213, plain, (~member(skc5,skf14(skc5,skc6),skc6)), inference(extension_rule, [i_0_85])).
% 4.19/1.17 cnf(i_0_61402, plain, (~actual_world(skc5)), inference(closure_rule, [i_0_48])).
% 4.19/1.17 cnf(i_0_61398, plain, (~ssSkP2(X8,skc6,skc5)), inference(extension_rule, [i_0_58])).
% 4.19/1.17 cnf(i_0_61415, plain, (member(skc5,skf26(skc5,X8,skc6),skc6)), inference(extension_rule, [i_0_56])).
% 4.19/1.17 cnf(i_0_214, plain, (~ssSkP3(skc6,skc5)), inference(etableau_closure_rule, [i_0_214, ...])).
% 4.19/1.17 # End printing tableau
% 4.19/1.17 # SZS output end
% 4.19/1.17 # Branches closed with saturation will be marked with an "s"
% 4.60/1.17 # Child (22556) has found a proof.
% 4.60/1.17
% 4.60/1.17 # Proof search is over...
% 4.60/1.17 # Freeing feature tree
%------------------------------------------------------------------------------