TSTP Solution File: NLP031-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP031-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 : n018.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:49 EDT 2022
% Result : Satisfiable 3.32s 0.79s
% Output : CNFRefutation 3.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP031-1 : TPTP v8.1.0. Released v2.4.0.
% 0.14/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.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 30 23:25:47 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.20/0.37 # and selection function SelectNewComplexAHP.
% 0.20/0.37 #
% 0.20/0.37 # Presaturation interreduction done
% 0.20/0.37 # Number of axioms: 38 Number of unprocessed: 38
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 38 beginning clauses after preprocessing and clausification
% 0.20/0.37 # Creating start rules for all 38 conjectures.
% 0.20/0.37 # There are 38 start rule candidates:
% 0.20/0.37 # Found 2 unit axioms.
% 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.37 # 38 start rule tableaux created.
% 0.20/0.37 # 36 extension rule candidate clauses
% 0.20/0.37 # 2 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 3.32/0.79 # 14606 Satisfiable branch
% 3.32/0.79 # Satisfiable branch found.
% 3.32/0.79 # There were 1 total branch saturation attempts.
% 3.32/0.79 # There were 0 of these attempts blocked.
% 3.32/0.79 # There were 0 deferred branch saturation attempts.
% 3.32/0.79 # There were 0 free duplicated saturations.
% 3.32/0.79 # There were 0 total successful branch saturations.
% 3.32/0.79 # There were 0 successful branch saturations in interreduction.
% 3.32/0.79 # There were 0 successful branch saturations on the branch.
% 3.32/0.79 # There were 0 successful branch saturations after the branch.
% 3.32/0.79 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.32/0.79 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.32/0.79 # Begin clausification derivation
% 3.32/0.79
% 3.32/0.79 # End clausification derivation
% 3.32/0.79 # Begin listing active clauses obtained from FOF to CNF conversion
% 3.32/0.79 cnf(i_0_39, negated_conjecture, (actual_world(skc50))).
% 3.32/0.79 cnf(i_0_40, negated_conjecture, (actual_world(skc5))).
% 3.32/0.79 cnf(i_0_45, negated_conjecture, (group(skc5,skc6)|~ssSkC0)).
% 3.32/0.79 cnf(i_0_44, negated_conjecture, (three(skc5,skc6)|~ssSkC0)).
% 3.32/0.79 cnf(i_0_46, negated_conjecture, (table(skc5,skc7)|~ssSkC0)).
% 3.32/0.79 cnf(i_0_41, negated_conjecture, (group(skc50,skc51)|ssSkC0)).
% 3.32/0.79 cnf(i_0_42, negated_conjecture, (three(skc50,skc51)|ssSkC0)).
% 3.32/0.79 cnf(i_0_43, negated_conjecture, (ssSkP2(skc51,skc50)|ssSkC0)).
% 3.32/0.79 cnf(i_0_47, negated_conjecture, (ssSkP1(skc7,skc6,skc5)|~ssSkC0)).
% 3.32/0.79 cnf(i_0_51, negated_conjecture, (guy(skc5,X1)|~member(skc5,X1,skc6)|~ssSkC0)).
% 3.32/0.79 cnf(i_0_52, negated_conjecture, (young(skc5,X1)|~member(skc5,X1,skc6)|~ssSkC0)).
% 3.32/0.79 cnf(i_0_49, negated_conjecture, (guy(skc50,X1)|ssSkC0|~member(skc50,X1,skc51))).
% 3.32/0.79 cnf(i_0_50, negated_conjecture, (young(skc50,X1)|ssSkC0|~member(skc50,X1,skc51))).
% 3.32/0.79 cnf(i_0_48, negated_conjecture, (member(X1,skf26(X1,X2),X2)|ssSkP2(X2,X1))).
% 3.32/0.79 cnf(i_0_56, negated_conjecture, (group(X1,skf22(X1,X2))|~member(X1,X3,X4)|~ssSkP2(X4,X1))).
% 3.32/0.79 cnf(i_0_55, negated_conjecture, (table(X1,skf23(X1,X2))|~member(X1,X3,X4)|~ssSkP2(X4,X1))).
% 3.32/0.79 cnf(i_0_70, negated_conjecture, (member(X1,skf12(X1,X2),X2)|~ssSkP2(X2,X1)|~three(X1,X2)|~group(X1,X2)|~ssSkC0|~actual_world(X1))).
% 3.32/0.79 cnf(i_0_53, negated_conjecture, (member(X1,skf19(X1,X2,X3),X3)|ssSkP1(X2,X3,X1))).
% 3.32/0.79 cnf(i_0_66, negated_conjecture, (hamburger(X1,X2)|~member(X1,X2,skf22(X1,X3))|~member(X1,X4,X5)|~ssSkP2(X5,X1))).
% 3.32/0.79 cnf(i_0_57, negated_conjecture, (group(X1,skf17(X1,X2,X3))|~member(X1,X4,X5)|~ssSkP1(X6,X5,X1))).
% 3.32/0.79 cnf(i_0_67, negated_conjecture, (hamburger(X1,X2)|~member(X1,X2,skf17(X1,X3,X4))|~member(X1,X5,X6)|~ssSkP1(X7,X6,X1))).
% 3.32/0.79 cnf(i_0_74, negated_conjecture, (~young(X1,skf12(X1,X2))|~guy(X1,skf12(X1,X2))|~ssSkP2(X3,X1)|~three(X1,X3)|~group(X1,X3)|~ssSkC0|~actual_world(X1))).
% 3.32/0.79 cnf(i_0_54, negated_conjecture, (ssSkP0(X1,X2,X3,X4)|member(X4,skf15(X3,X4,X5,X6),X3))).
% 3.32/0.79 cnf(i_0_62, negated_conjecture, (ssSkP0(skf23(X1,X2),X2,skf22(X1,X2),X1)|~member(X1,X2,X3)|~ssSkP2(X3,X1))).
% 3.32/0.79 cnf(i_0_61, negated_conjecture, (ssSkP0(X1,X2,skf17(X3,X2,X1),X3)|~member(X3,X2,X4)|~ssSkP1(X1,X4,X3))).
% 3.32/0.79 cnf(i_0_71, negated_conjecture, (ssSkP2(X1,X2)|~hamburger(X2,skf27(X2,X3))|~ssSkP0(X4,skf26(X2,X5),X6,X2)|~table(X2,X4)|~group(X2,X6))).
% 3.32/0.79 cnf(i_0_69, negated_conjecture, (ssSkP1(X1,X2,X3)|~hamburger(X3,skf20(X3,X4))|~ssSkP0(X1,skf19(X3,X1,X5),X6,X3)|~group(X3,X6))).
% 3.32/0.79 cnf(i_0_73, negated_conjecture, (member(X1,skf29(X1,X2),X2)|ssSkC0|~ssSkP1(X3,X2,X1)|~table(X1,X3)|~three(X1,X2)|~group(X1,X2)|~actual_world(X1))).
% 3.32/0.79 cnf(i_0_58, negated_conjecture, (event(X1,skf13(X1,X2,X3,X4))|~ssSkP0(X5,X6,X7,X1)|~member(X1,X8,X7))).
% 3.32/0.79 cnf(i_0_75, negated_conjecture, (ssSkC0|~young(X1,skf29(X1,X2))|~guy(X1,skf29(X1,X2))|~ssSkP1(X3,X4,X1)|~table(X1,X3)|~three(X1,X4)|~group(X1,X4)|~actual_world(X1))).
% 3.32/0.79 cnf(i_0_59, negated_conjecture, (present(X1,skf13(X1,X2,X3,X4))|~ssSkP0(X5,X6,X7,X1)|~member(X1,X8,X7))).
% 3.32/0.79 cnf(i_0_60, negated_conjecture, (sit(X1,skf13(X1,X2,X3,X4))|~ssSkP0(X5,X6,X7,X1)|~member(X1,X8,X7))).
% 3.32/0.79 cnf(i_0_72, negated_conjecture, (member(X1,skf27(X1,X2),X2)|ssSkP2(X3,X1)|~ssSkP0(X4,skf26(X1,X5),X2,X1)|~table(X1,X4)|~group(X1,X2))).
% 3.32/0.79 cnf(i_0_63, negated_conjecture, (agent(X1,skf13(X1,X2,X3,X4),X4)|~ssSkP0(X3,X4,X5,X1)|~member(X1,X2,X5))).
% 3.32/0.79 cnf(i_0_64, negated_conjecture, (at(X1,skf13(X1,X2,X3,X4),X3)|~ssSkP0(X3,X5,X6,X1)|~member(X1,X2,X6))).
% 3.32/0.79 cnf(i_0_65, negated_conjecture, (with(X1,skf13(X1,X2,X3,X4),X2)|~ssSkP0(X5,X6,X7,X1)|~member(X1,X2,X7))).
% 3.32/0.79 cnf(i_0_68, negated_conjecture, (member(X1,skf20(X1,X2),X2)|ssSkP1(X3,X4,X1)|~ssSkP0(X3,skf19(X1,X3,X5),X2,X1)|~group(X1,X2))).
% 3.32/0.79 cnf(i_0_76, negated_conjecture, (ssSkP0(X1,X2,X3,X4)|~with(X4,X5,skf15(X3,X4,X1,X2))|~at(X4,X5,X1)|~agent(X4,X5,X2)|~sit(X4,X5)|~present(X4,X5)|~event(X4,X5))).
% 3.32/0.79 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 3.32/0.79 # Begin printing tableau
% 3.32/0.79 # Found 8 steps
% 3.32/0.79 cnf(i_0_61, negated_conjecture, (ssSkP0(skc7,skf26(skc5,skc6),skf17(skc5,skf26(skc5,skc6),skc7),skc5)|~member(skc5,skf26(skc5,skc6),skc6)|~ssSkP1(skc7,skc6,skc5)), inference(start_rule)).
% 3.32/0.79 cnf(i_0_135, plain, (ssSkP0(skc7,skf26(skc5,skc6),skf17(skc5,skf26(skc5,skc6),skc7),skc5)), inference(closure_rule, [i_0_0])).
% 3.32/0.79 cnf(i_0_136, plain, (~member(skc5,skf26(skc5,skc6),skc6)), inference(extension_rule, [i_0_48])).
% 3.32/0.79 cnf(i_0_20301, plain, (ssSkP2(skc6,skc5)), inference(extension_rule, [i_0_66])).
% 3.32/0.79 cnf(i_0_20326, plain, (hamburger(skc5,skf20(skc5,skf22(skc5,X20)))), inference(extension_rule, [i_0_69])).
% 3.32/0.79 cnf(i_0_20327, plain, (~member(skc5,skf20(skc5,skf22(skc5,X20)),skf22(skc5,X20))), inference(extension_rule, [i_0_68])).
% 3.32/0.79 cnf(i_0_20328, plain, (~member(skc5,skf15(skc6,skc5,X21,X22),skc6)), inference(extension_rule, [i_0_54])).
% 3.32/0.79 cnf(i_0_137, plain, (~ssSkP1(skc7,skc6,skc5)), inference(extension_rule, [i_0_47])).
% 3.32/0.79 # End printing tableau
% 3.32/0.79 # SZS output end
% 3.32/0.79 # Branches closed with saturation will be marked with an "s"
% 3.32/0.79 # Child (14606) has found a proof.
% 3.32/0.79
% 3.32/0.79 # Proof search is over...
% 3.32/0.79 # Freeing feature tree
%------------------------------------------------------------------------------