TSTP Solution File: NLP034-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP034-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 : n014.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:51 EDT 2022
% Result : Satisfiable 8.90s 1.52s
% Output : CNFRefutation 8.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP034-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 30 22:52:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.19/0.37 # and selection function SelectNewComplexAHP.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 46 Number of unprocessed: 46
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 46 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 46 conjectures.
% 0.19/0.37 # There are 46 start rule candidates:
% 0.19/0.37 # Found 2 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 46 start rule tableaux created.
% 0.19/0.37 # 44 extension rule candidate clauses
% 0.19/0.37 # 2 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 8.90/1.52 # 11875 Satisfiable branch
% 8.90/1.52 # Satisfiable branch found.
% 8.90/1.52 # There were 1 total branch saturation attempts.
% 8.90/1.52 # There were 0 of these attempts blocked.
% 8.90/1.52 # There were 0 deferred branch saturation attempts.
% 8.90/1.52 # There were 0 free duplicated saturations.
% 8.90/1.52 # There were 0 total successful branch saturations.
% 8.90/1.52 # There were 0 successful branch saturations in interreduction.
% 8.90/1.52 # There were 0 successful branch saturations on the branch.
% 8.90/1.52 # There were 0 successful branch saturations after the branch.
% 8.90/1.52 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.90/1.52 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.90/1.52 # Begin clausification derivation
% 8.90/1.52
% 8.90/1.52 # End clausification derivation
% 8.90/1.52 # Begin listing active clauses obtained from FOF to CNF conversion
% 8.90/1.52 cnf(i_0_47, negated_conjecture, (actual_world(skc65))).
% 8.90/1.52 cnf(i_0_48, negated_conjecture, (actual_world(skc5))).
% 8.90/1.52 cnf(i_0_52, negated_conjecture, (group(skc5,skc6)|~ssSkC0)).
% 8.90/1.52 cnf(i_0_51, negated_conjecture, (three(skc5,skc6)|~ssSkC0)).
% 8.90/1.52 cnf(i_0_53, negated_conjecture, (table(skc5,skc7)|~ssSkC0)).
% 8.90/1.52 cnf(i_0_49, negated_conjecture, (group(skc65,skc66)|ssSkC0)).
% 8.90/1.52 cnf(i_0_50, negated_conjecture, (ssSkP3(skc66,skc65)|ssSkC0)).
% 8.90/1.52 cnf(i_0_54, negated_conjecture, (ssSkP2(skc7,skc6,skc5)|~ssSkC0)).
% 8.90/1.52 cnf(i_0_57, negated_conjecture, (guy(skc5,X1)|~member(skc5,X1,skc6)|~ssSkC0)).
% 8.90/1.52 cnf(i_0_58, negated_conjecture, (young(skc5,X1)|~member(skc5,X1,skc6)|~ssSkC0)).
% 8.90/1.52 cnf(i_0_56, negated_conjecture, (hamburger(skc65,X1)|ssSkC0|~member(skc65,X1,skc66))).
% 8.90/1.52 cnf(i_0_55, negated_conjecture, (member(X1,skf31(X1,X2),X2)|ssSkP3(X2,X1))).
% 8.90/1.52 cnf(i_0_74, negated_conjecture, (~hamburger(X1,skf14(X1,X2))|~ssSkP3(X3,X1)|~group(X1,X3)|~ssSkC0|~actual_world(X1))).
% 8.90/1.52 cnf(i_0_63, negated_conjecture, (group(X1,skf27(X1,X2))|~member(X1,X3,X4)|~ssSkP3(X4,X1))).
% 8.90/1.52 cnf(i_0_75, negated_conjecture, (member(X1,skf14(X1,X2),X2)|~ssSkP3(X2,X1)|~group(X1,X2)|~ssSkC0|~actual_world(X1))).
% 8.90/1.52 cnf(i_0_64, negated_conjecture, (three(X1,skf27(X1,X2))|~member(X1,X3,X4)|~ssSkP3(X4,X1))).
% 8.90/1.52 cnf(i_0_62, negated_conjecture, (table(X1,skf28(X1,X2))|~member(X1,X3,X4)|~ssSkP3(X4,X1))).
% 8.90/1.52 cnf(i_0_59, negated_conjecture, (member(X1,skf24(X1,X2,X3),X3)|ssSkP2(X2,X3,X1))).
% 8.90/1.52 cnf(i_0_83, negated_conjecture, (guy(X1,X2)|~member(X1,X2,skf27(X1,X3))|~member(X1,X4,X5)|~ssSkP3(X5,X1))).
% 8.90/1.52 cnf(i_0_82, negated_conjecture, (young(X1,X2)|~member(X1,X2,skf27(X1,X3))|~member(X1,X4,X5)|~ssSkP3(X5,X1))).
% 8.90/1.52 cnf(i_0_65, negated_conjecture, (group(X1,skf22(X1,X2,X3))|~member(X1,X4,X5)|~ssSkP2(X6,X5,X1))).
% 8.90/1.52 cnf(i_0_84, negated_conjecture, (hamburger(X1,X2)|~member(X1,X2,skf22(X1,X3,X4))|~member(X1,X5,X6)|~ssSkP2(X7,X6,X1))).
% 8.90/1.52 cnf(i_0_60, negated_conjecture, (ssSkP0(X1,X2,X3,X4)|member(X4,skf17(X3,X4,X5,X6),X3))).
% 8.90/1.52 cnf(i_0_72, negated_conjecture, (ssSkP1(X1,X2,skf22(X3,X2,X1),X3)|~member(X3,X2,X4)|~ssSkP2(X1,X4,X3))).
% 8.90/1.52 cnf(i_0_85, negated_conjecture, (ssSkP2(X1,X2,X3)|~ssSkP1(X1,skf24(X3,X1,X4),X5,X3)|~hamburger(X3,skf25(X3,X6))|~group(X3,X5))).
% 8.90/1.52 cnf(i_0_87, negated_conjecture, (member(X1,skf34(X1,X2),X2)|ssSkC0|~ssSkP2(X3,X2,X1)|~table(X1,X3)|~three(X1,X2)|~group(X1,X2)|~actual_world(X1))).
% 8.90/1.52 cnf(i_0_61, negated_conjecture, (ssSkP1(X1,X2,X3,X4)|member(X4,skf20(X3,X4,X5,X6),X3))).
% 8.90/1.52 cnf(i_0_89, negated_conjecture, (ssSkC0|~young(X1,skf34(X1,X2))|~guy(X1,skf34(X1,X2))|~ssSkP2(X3,X4,X1)|~table(X1,X3)|~three(X1,X4)|~group(X1,X4)|~actual_world(X1))).
% 8.90/1.52 cnf(i_0_66, negated_conjecture, (event(X1,skf15(X1,X2,X3,X4))|~ssSkP0(X5,X6,X7,X1)|~member(X1,X8,X7))).
% 8.90/1.52 cnf(i_0_69, negated_conjecture, (event(X1,skf18(X1,X2,X3,X4))|~ssSkP1(X5,X6,X7,X1)|~member(X1,X8,X7))).
% 8.90/1.52 cnf(i_0_67, negated_conjecture, (present(X1,skf15(X1,X2,X3,X4))|~ssSkP0(X5,X6,X7,X1)|~member(X1,X8,X7))).
% 8.90/1.52 cnf(i_0_70, negated_conjecture, (present(X1,skf18(X1,X2,X3,X4))|~ssSkP1(X5,X6,X7,X1)|~member(X1,X8,X7))).
% 8.90/1.52 cnf(i_0_68, negated_conjecture, (sit(X1,skf15(X1,X2,X3,X4))|~ssSkP0(X5,X6,X7,X1)|~member(X1,X8,X7))).
% 8.90/1.52 cnf(i_0_71, negated_conjecture, (sit(X1,skf18(X1,X2,X3,X4))|~ssSkP1(X5,X6,X7,X1)|~member(X1,X8,X7))).
% 8.90/1.52 cnf(i_0_73, negated_conjecture, (ssSkP0(X1,skf28(X2,X1),skf27(X2,X1),X2)|~member(X2,X1,X3)|~ssSkP3(X3,X2))).
% 8.90/1.52 cnf(i_0_76, negated_conjecture, (agent(X1,skf15(X1,X2,X3,X4),X2)|~ssSkP0(X5,X6,X7,X1)|~member(X1,X2,X7))).
% 8.90/1.52 cnf(i_0_79, negated_conjecture, (agent(X1,skf18(X1,X2,X3,X4),X4)|~ssSkP1(X3,X4,X5,X1)|~member(X1,X2,X5))).
% 8.90/1.52 cnf(i_0_77, negated_conjecture, (at(X1,skf15(X1,X2,X3,X4),X4)|~ssSkP0(X3,X4,X5,X1)|~member(X1,X2,X5))).
% 8.90/1.52 cnf(i_0_88, negated_conjecture, (member(X1,skf32(X1,X2),X2)|ssSkP3(X3,X1)|~ssSkP0(skf31(X1,X4),X5,X2,X1)|~table(X1,X5)|~three(X1,X2)|~group(X1,X2))).
% 8.90/1.52 cnf(i_0_80, negated_conjecture, (at(X1,skf18(X1,X2,X3,X4),X3)|~ssSkP1(X3,X5,X6,X1)|~member(X1,X2,X6))).
% 8.90/1.52 cnf(i_0_78, negated_conjecture, (with(X1,skf15(X1,X2,X3,X4),X3)|~ssSkP0(X3,X5,X6,X1)|~member(X1,X2,X6))).
% 8.90/1.52 cnf(i_0_81, negated_conjecture, (with(X1,skf18(X1,X2,X3,X4),X2)|~ssSkP1(X5,X6,X7,X1)|~member(X1,X2,X7))).
% 8.90/1.52 cnf(i_0_90, negated_conjecture, (ssSkP3(X1,X2)|~ssSkP0(skf31(X2,X3),X4,X5,X2)|~young(X2,skf32(X2,X6))|~guy(X2,skf32(X2,X6))|~table(X2,X4)|~three(X2,X5)|~group(X2,X5))).
% 8.90/1.52 cnf(i_0_86, negated_conjecture, (member(X1,skf25(X1,X2),X2)|ssSkP2(X3,X4,X1)|~ssSkP1(X3,skf24(X1,X3,X5),X2,X1)|~group(X1,X2))).
% 8.90/1.52 cnf(i_0_92, negated_conjecture, (ssSkP0(X1,X2,X3,X4)|~with(X4,X5,X1)|~at(X4,X5,X2)|~agent(X4,X5,skf17(X3,X4,X1,X2))|~sit(X4,X5)|~present(X4,X5)|~event(X4,X5))).
% 8.90/1.52 cnf(i_0_91, negated_conjecture, (ssSkP1(X1,X2,X3,X4)|~with(X4,X5,skf20(X3,X4,X1,X2))|~at(X4,X5,X1)|~agent(X4,X5,X2)|~sit(X4,X5)|~present(X4,X5)|~event(X4,X5))).
% 8.90/1.52 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 8.90/1.52 # Begin printing tableau
% 8.90/1.52 # Found 31 steps
% 8.90/1.52 cnf(i_0_75, negated_conjecture, (member(skc5,skf14(skc5,skc6),skc6)|~ssSkP3(skc6,skc5)|~group(skc5,skc6)|~ssSkC0|~actual_world(skc5)), inference(start_rule)).
% 8.90/1.52 cnf(i_0_216, plain, (~actual_world(skc5)), inference(closure_rule, [i_0_48])).
% 8.90/1.52 cnf(i_0_212, plain, (member(skc5,skf14(skc5,skc6),skc6)), inference(extension_rule, [i_0_81])).
% 8.90/1.52 cnf(i_0_46378, plain, (with(skc5,skf18(skc5,skf14(skc5,skc6),X16,skf17(skc6,skc5,skf14(skc5,skc6),X16)),skf14(skc5,skc6))), inference(extension_rule, [i_0_92])).
% 8.90/1.52 cnf(i_0_46445, plain, (ssSkP0(skf14(skc5,skc6),X16,skc6,skc5)), inference(extension_rule, [i_0_78])).
% 8.90/1.52 cnf(i_0_46566, plain, (~member(skc5,skf14(skc5,skc6),skc6)), inference(closure_rule, [i_0_212])).
% 8.90/1.52 cnf(i_0_46447, plain, (~at(skc5,skf18(skc5,skf14(skc5,skc6),X16,skf17(skc6,skc5,skf14(skc5,skc6),X16)),X16)), inference(extension_rule, [i_0_80])).
% 8.90/1.52 cnf(i_0_46633, plain, (~member(skc5,skf14(skc5,skc6),skc6)), inference(closure_rule, [i_0_212])).
% 8.90/1.52 cnf(i_0_46448, plain, (~agent(skc5,skf18(skc5,skf14(skc5,skc6),X16,skf17(skc6,skc5,skf14(skc5,skc6),X16)),skf17(skc6,skc5,skf14(skc5,skc6),X16))), inference(extension_rule, [i_0_79])).
% 8.90/1.52 cnf(i_0_46700, plain, (~member(skc5,skf14(skc5,skc6),skc6)), inference(closure_rule, [i_0_212])).
% 8.90/1.52 cnf(i_0_46449, plain, (~sit(skc5,skf18(skc5,skf14(skc5,skc6),X16,skf17(skc6,skc5,skf14(skc5,skc6),X16)))), inference(extension_rule, [i_0_71])).
% 8.90/1.52 cnf(i_0_46767, plain, (~member(skc5,skf14(skc5,skc6),skc6)), inference(closure_rule, [i_0_212])).
% 8.90/1.52 cnf(i_0_46450, plain, (~present(skc5,skf18(skc5,skf14(skc5,skc6),X16,skf17(skc6,skc5,skf14(skc5,skc6),X16)))), inference(extension_rule, [i_0_70])).
% 8.90/1.52 cnf(i_0_46834, plain, (~member(skc5,skf14(skc5,skc6),skc6)), inference(closure_rule, [i_0_212])).
% 8.90/1.52 cnf(i_0_46451, plain, (~event(skc5,skf18(skc5,skf14(skc5,skc6),X16,skf17(skc6,skc5,skf14(skc5,skc6),X16)))), inference(extension_rule, [i_0_69])).
% 8.90/1.52 cnf(i_0_46901, plain, (~member(skc5,skf14(skc5,skc6),skc6)), inference(closure_rule, [i_0_212])).
% 8.90/1.52 cnf(i_0_46379, plain, (~ssSkP1(X13,skf14(skc5,skc6),skc6,skc5)), inference(extension_rule, [i_0_91])).
% 8.90/1.52 cnf(i_0_46967, plain, (~with(skc5,skf15(skc5,skf14(skc5,skc6),skf20(skc6,skc5,X13,skf14(skc5,skc6)),X13),skf20(skc6,skc5,X13,skf14(skc5,skc6)))), inference(extension_rule, [i_0_78])).
% 8.90/1.52 cnf(i_0_47105, plain, (~member(skc5,skf14(skc5,skc6),skc6)), inference(closure_rule, [i_0_212])).
% 8.90/1.52 cnf(i_0_46968, plain, (~at(skc5,skf15(skc5,skf14(skc5,skc6),skf20(skc6,skc5,X13,skf14(skc5,skc6)),X13),X13)), inference(extension_rule, [i_0_77])).
% 8.90/1.52 cnf(i_0_47198, plain, (~member(skc5,skf14(skc5,skc6),skc6)), inference(closure_rule, [i_0_212])).
% 8.90/1.52 cnf(i_0_46969, plain, (~agent(skc5,skf15(skc5,skf14(skc5,skc6),skf20(skc6,skc5,X13,skf14(skc5,skc6)),X13),skf14(skc5,skc6))), inference(extension_rule, [i_0_76])).
% 8.90/1.52 cnf(i_0_47291, plain, (~member(skc5,skf14(skc5,skc6),skc6)), inference(closure_rule, [i_0_212])).
% 8.90/1.52 cnf(i_0_46970, plain, (~sit(skc5,skf15(skc5,skf14(skc5,skc6),skf20(skc6,skc5,X13,skf14(skc5,skc6)),X13))), inference(extension_rule, [i_0_68])).
% 8.90/1.52 cnf(i_0_47384, plain, (~member(skc5,skf14(skc5,skc6),skc6)), inference(closure_rule, [i_0_212])).
% 8.90/1.52 cnf(i_0_46971, plain, (~present(skc5,skf15(skc5,skf14(skc5,skc6),skf20(skc6,skc5,X13,skf14(skc5,skc6)),X13))), inference(extension_rule, [i_0_67])).
% 8.90/1.52 cnf(i_0_47477, plain, (~member(skc5,skf14(skc5,skc6),skc6)), inference(closure_rule, [i_0_212])).
% 8.90/1.52 cnf(i_0_46972, plain, (~event(skc5,skf15(skc5,skf14(skc5,skc6),skf20(skc6,skc5,X13,skf14(skc5,skc6)),X13))), inference(extension_rule, [i_0_66])).
% 8.90/1.52 cnf(i_0_47570, plain, (~member(skc5,skf14(skc5,skc6),skc6)), inference(closure_rule, [i_0_212])).
% 8.90/1.52 cnf(i_0_213, plain, (~ssSkP3(skc6,skc5)), inference(extension_rule, [i_0_55])).
% 8.90/1.52 cnf(i_0_47598, plain, (member(skc5,skf31(skc5,skc6),skc6)), inference(extension_rule, [i_0_58])).
% 8.90/1.52 # End printing tableau
% 8.90/1.52 # SZS output end
% 8.90/1.52 # Branches closed with saturation will be marked with an "s"
% 9.33/1.53 # Child (11875) has found a proof.
% 9.33/1.53
% 9.33/1.53 # Proof search is over...
% 9.33/1.53 # Freeing feature tree
%------------------------------------------------------------------------------