TSTP Solution File: NLP048-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP048-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 : n026.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:12:01 EDT 2022
% Result : Satisfiable 0.22s 0.44s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NLP048-1 : TPTP v8.1.0. Released v2.4.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.36 % Computer : n026.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Fri Jul 1 07:50:19 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.39 # No SInE strategy applied
% 0.22/0.39 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.22/0.39 # and selection function SelectNewComplexAHP.
% 0.22/0.39 #
% 0.22/0.39 # Presaturation interreduction done
% 0.22/0.39 # Number of axioms: 46 Number of unprocessed: 46
% 0.22/0.39 # Tableaux proof search.
% 0.22/0.39 # APR header successfully linked.
% 0.22/0.39 # Hello from C++
% 0.22/0.39 # The folding up rule is enabled...
% 0.22/0.39 # Local unification is enabled...
% 0.22/0.39 # Any saturation attempts will use folding labels...
% 0.22/0.39 # 46 beginning clauses after preprocessing and clausification
% 0.22/0.39 # Creating start rules for all 46 conjectures.
% 0.22/0.39 # There are 46 start rule candidates:
% 0.22/0.39 # Found 2 unit axioms.
% 0.22/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.22/0.39 # 46 start rule tableaux created.
% 0.22/0.39 # 44 extension rule candidate clauses
% 0.22/0.39 # 2 unit axiom clauses
% 0.22/0.39
% 0.22/0.39 # Requested 8, 32 cores available to the main process.
% 0.22/0.44 # 14075 Satisfiable branch
% 0.22/0.44 # Satisfiable branch found.
% 0.22/0.44 # There were 1 total branch saturation attempts.
% 0.22/0.44 # There were 0 of these attempts blocked.
% 0.22/0.44 # There were 0 deferred branch saturation attempts.
% 0.22/0.44 # There were 0 free duplicated saturations.
% 0.22/0.44 # There were 0 total successful branch saturations.
% 0.22/0.44 # There were 0 successful branch saturations in interreduction.
% 0.22/0.44 # There were 0 successful branch saturations on the branch.
% 0.22/0.44 # There were 0 successful branch saturations after the branch.
% 0.22/0.44 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.44 # Begin clausification derivation
% 0.22/0.44
% 0.22/0.44 # End clausification derivation
% 0.22/0.44 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.22/0.44 cnf(i_0_47, negated_conjecture, (actual_world(skc33))).
% 0.22/0.44 cnf(i_0_48, negated_conjecture, (actual_world(skc12))).
% 0.22/0.44 cnf(i_0_63, negated_conjecture, (mia_forename(skc12,skc16)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_64, negated_conjecture, (forename(skc12,skc16)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_65, negated_conjecture, (woman(skc12,skc17)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_49, negated_conjecture, (mia_forename(skc33,skc37)|ssSkC0)).
% 0.22/0.44 cnf(i_0_50, negated_conjecture, (forename(skc33,skc37)|ssSkC0)).
% 0.22/0.44 cnf(i_0_66, negated_conjecture, (event(skc12,skc14)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_67, negated_conjecture, (past(skc12,skc14)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_68, negated_conjecture, (nonreflexive(skc12,skc14)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_69, negated_conjecture, (order(skc12,skc14)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_51, negated_conjecture, (woman(skc33,skc38)|ssSkC0)).
% 0.22/0.44 cnf(i_0_70, negated_conjecture, (shake_beverage(skc12,skc15)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_60, negated_conjecture, (group(skc12,skc13)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_61, negated_conjecture, (five(skc12,skc13)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_62, negated_conjecture, (nonhuman(skc12,skc16)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_52, negated_conjecture, (event(skc33,skc35)|ssSkC0)).
% 0.22/0.44 cnf(i_0_53, negated_conjecture, (past(skc33,skc35)|ssSkC0)).
% 0.22/0.44 cnf(i_0_54, negated_conjecture, (nonreflexive(skc33,skc35)|ssSkC0)).
% 0.22/0.44 cnf(i_0_55, negated_conjecture, (order(skc33,skc35)|ssSkC0)).
% 0.22/0.44 cnf(i_0_56, negated_conjecture, (shake_beverage(skc33,skc36)|ssSkC0)).
% 0.22/0.44 cnf(i_0_57, negated_conjecture, (group(skc33,skc34)|ssSkC0)).
% 0.22/0.44 cnf(i_0_58, negated_conjecture, (five(skc33,skc34)|ssSkC0)).
% 0.22/0.44 cnf(i_0_59, negated_conjecture, (nonhuman(skc33,skc34)|ssSkC0)).
% 0.22/0.44 cnf(i_0_76, negated_conjecture, (agent(skc12,skc14,skc17)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_77, negated_conjecture, (of(skc12,skc16,skc17)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_78, negated_conjecture, (patient(skc12,skc14,skc15)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_71, negated_conjecture, (agent(skc33,skc35,skc38)|ssSkC0)).
% 0.22/0.44 cnf(i_0_72, negated_conjecture, (of(skc33,skc37,skc38)|ssSkC0)).
% 0.22/0.44 cnf(i_0_75, negated_conjecture, (ssSkP0(skc16,skc13,skc12)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_73, negated_conjecture, (patient(skc33,skc35,skc36)|ssSkC0)).
% 0.22/0.44 cnf(i_0_74, negated_conjecture, (ssSkP0(skc34,skc34,skc33)|ssSkC0)).
% 0.22/0.44 cnf(i_0_80, negated_conjecture, (dollar(skc12,X1)|~member(skc12,X1,skc13)|~ssSkC0)).
% 0.22/0.44 cnf(i_0_79, negated_conjecture, (dollar(skc33,X1)|ssSkC0|~member(skc33,X1,skc34))).
% 0.22/0.44 cnf(i_0_82, negated_conjecture, (event(X1,skf6(X1,X2,X3))|~member(X1,X4,X5)|~ssSkP0(X6,X5,X1))).
% 0.22/0.44 cnf(i_0_84, negated_conjecture, (nonreflexive(X1,skf6(X1,X2,X3))|~member(X1,X4,X5)|~ssSkP0(X6,X5,X1))).
% 0.22/0.44 cnf(i_0_83, negated_conjecture, (present(X1,skf6(X1,X2,X3))|~member(X1,X4,X5)|~ssSkP0(X6,X5,X1))).
% 0.22/0.44 cnf(i_0_85, negated_conjecture, (cost(X1,skf6(X1,X2,X3))|~member(X1,X4,X5)|~ssSkP0(X6,X5,X1))).
% 0.22/0.44 cnf(i_0_81, negated_conjecture, (member(X1,skf8(X2,X1,X3),X3)|ssSkP0(X2,X3,X1))).
% 0.22/0.44 cnf(i_0_86, negated_conjecture, (agent(X1,skf6(X1,X2,X3),X3)|~member(X1,X2,X4)|~ssSkP0(X3,X4,X1))).
% 0.22/0.44 cnf(i_0_87, negated_conjecture, (patient(X1,skf6(X1,X2,X3),X2)|~member(X1,X2,X4)|~ssSkP0(X5,X4,X1))).
% 0.22/0.44 cnf(i_0_88, negated_conjecture, (ssSkP0(X1,X2,X3)|~cost(X3,X4)|~present(X3,X4)|~patient(X3,X4,skf8(X1,X3,X5))|~agent(X3,X4,X1)|~nonreflexive(X3,X4)|~event(X3,X4))).
% 0.22/0.44 cnf(i_0_91, negated_conjecture, (~dollar(X1,skf5(X1,X2))|~ssSkP0(X3,X3,X1)|~patient(X1,X4,X5)|~of(X1,X6,X7)|~agent(X1,X4,X7)|~nonhuman(X1,X3)|~five(X1,X3)|~group(X1,X3)|~shake_beverage(X1,X5)|~order(X1,X4)|~nonreflexive(X1,X4)|~past(X1,X4)|~event(X1,X4)|~woman(X1,X7)|~forename(X1,X6)|~mia_forename(X1,X6)|~ssSkC0|~actual_world(X1))).
% 0.22/0.44 cnf(i_0_90, negated_conjecture, (ssSkC0|~dollar(X1,skf10(X1,X2))|~ssSkP0(X3,X4,X1)|~patient(X1,X5,X6)|~of(X1,X3,X7)|~agent(X1,X5,X7)|~nonhuman(X1,X3)|~five(X1,X4)|~group(X1,X4)|~shake_beverage(X1,X6)|~order(X1,X5)|~nonreflexive(X1,X5)|~past(X1,X5)|~event(X1,X5)|~woman(X1,X7)|~forename(X1,X3)|~mia_forename(X1,X3)|~actual_world(X1))).
% 0.22/0.44 cnf(i_0_89, negated_conjecture, (member(X1,skf10(X1,X2),X2)|ssSkC0|~ssSkP0(X3,X2,X1)|~patient(X1,X4,X5)|~of(X1,X3,X6)|~agent(X1,X4,X6)|~nonhuman(X1,X3)|~five(X1,X2)|~group(X1,X2)|~shake_beverage(X1,X5)|~order(X1,X4)|~nonreflexive(X1,X4)|~past(X1,X4)|~event(X1,X4)|~woman(X1,X6)|~forename(X1,X3)|~mia_forename(X1,X3)|~actual_world(X1))).
% 0.22/0.44 cnf(i_0_92, negated_conjecture, (member(X1,skf5(X1,X2),X2)|~ssSkP0(X2,X2,X1)|~patient(X1,X3,X4)|~of(X1,X5,X6)|~agent(X1,X3,X6)|~nonhuman(X1,X2)|~five(X1,X2)|~group(X1,X2)|~shake_beverage(X1,X4)|~order(X1,X3)|~nonreflexive(X1,X3)|~past(X1,X3)|~event(X1,X3)|~woman(X1,X6)|~forename(X1,X5)|~mia_forename(X1,X5)|~ssSkC0|~actual_world(X1))).
% 0.22/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.22/0.44 # Begin printing tableau
% 0.22/0.44 # Found 22 steps
% 0.22/0.44 cnf(i_0_81, negated_conjecture, (member(skc33,skf8(skc34,skc33,skc34),skc34)|ssSkP0(skc34,skc34,skc33)), inference(start_rule)).
% 0.22/0.44 cnf(i_0_178, plain, (member(skc33,skf8(skc34,skc33,skc34),skc34)), inference(extension_rule, [i_0_87])).
% 0.22/0.44 cnf(i_0_341, plain, (~ssSkP0(skc34,skc34,skc33)), inference(extension_rule, [i_0_74])).
% 0.22/0.44 cnf(i_0_1385, plain, (ssSkC0), inference(extension_rule, [i_0_91])).
% 0.22/0.44 cnf(i_0_1439, plain, (~actual_world(skc12)), inference(closure_rule, [i_0_48])).
% 0.22/0.44 cnf(i_0_339, plain, (patient(skc33,skf6(skc33,skf8(skc34,skc33,skc34),skc34),skf8(skc34,skc33,skc34))), inference(extension_rule, [i_0_88])).
% 0.22/0.44 cnf(i_0_2982, plain, (ssSkP0(skc34,skc34,skc33)), inference(extension_rule, [i_0_83])).
% 0.22/0.44 cnf(i_0_2990, plain, (~member(skc33,skf8(skc34,skc33,skc34),skc34)), inference(closure_rule, [i_0_178])).
% 0.22/0.44 cnf(i_0_2983, plain, (~cost(skc33,skf6(skc33,skf8(skc34,skc33,skc34),skc34))), inference(extension_rule, [i_0_85])).
% 0.22/0.44 cnf(i_0_3120, plain, (~member(skc33,skf8(skc34,skc33,skc34),skc34)), inference(closure_rule, [i_0_178])).
% 0.22/0.44 cnf(i_0_2984, plain, (~present(skc33,skf6(skc33,skf8(skc34,skc33,skc34),skc34))), inference(extension_rule, [i_0_83])).
% 0.22/0.44 cnf(i_0_3282, plain, (~member(skc33,skf8(skc34,skc33,skc34),skc34)), inference(closure_rule, [i_0_178])).
% 0.22/0.44 cnf(i_0_2986, plain, (~agent(skc33,skf6(skc33,skf8(skc34,skc33,skc34),skc34),skc34)), inference(extension_rule, [i_0_86])).
% 0.22/0.44 cnf(i_0_3371, plain, (~member(skc33,skf8(skc34,skc33,skc34),skc34)), inference(closure_rule, [i_0_178])).
% 0.22/0.44 cnf(i_0_2987, plain, (~nonreflexive(skc33,skf6(skc33,skf8(skc34,skc33,skc34),skc34))), inference(extension_rule, [i_0_84])).
% 0.22/0.44 cnf(i_0_3374, plain, (~member(skc33,skf8(skc34,skc33,skc34),skc34)), inference(closure_rule, [i_0_178])).
% 0.22/0.44 cnf(i_0_2988, plain, (~event(skc33,skf6(skc33,skf8(skc34,skc33,skc34),skc34))), inference(extension_rule, [i_0_82])).
% 0.22/0.44 cnf(i_0_3377, plain, (~member(skc33,skf8(skc34,skc33,skc34),skc34)), inference(closure_rule, [i_0_178])).
% 0.22/0.44 cnf(i_0_179, plain, (ssSkP0(skc34,skc34,skc33)), inference(extension_rule, [i_0_87])).
% 0.22/0.44 cnf(i_0_3438, plain, (patient(skc33,skf6(skc33,X25,X29),X25)), inference(extension_rule, [i_0_92])).
% 0.22/0.44 cnf(i_0_3501, plain, (~ssSkP0(skc34,skc34,skc33)), inference(closure_rule, [i_0_179])).
% 0.22/0.44 cnf(i_0_3517, plain, (~actual_world(skc33)), inference(closure_rule, [i_0_47])).
% 0.22/0.44 # End printing tableau
% 0.22/0.44 # SZS output end
% 0.22/0.44 # Branches closed with saturation will be marked with an "s"
% 0.22/0.45 # Child (14075) has found a proof.
% 0.22/0.45
% 0.22/0.45 # Proof search is over...
% 0.22/0.45 # Freeing feature tree
%------------------------------------------------------------------------------