TSTP Solution File: NLP165-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP165-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:13:22 EDT 2022
% Result : Satisfiable 7.13s 1.26s
% Output : CNFRefutation 7.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NLP165-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.12/0.33 % Computer : n026.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 : Fri Jul 1 02:00:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.37 # No SInE strategy applied
% 0.18/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.18/0.37 # and selection function SelectNewComplexAHP.
% 0.18/0.37 #
% 0.18/0.37 # Presaturation interreduction done
% 0.18/0.37 # Number of axioms: 78 Number of unprocessed: 78
% 0.18/0.37 # Tableaux proof search.
% 0.18/0.37 # APR header successfully linked.
% 0.18/0.37 # Hello from C++
% 0.18/0.37 # The folding up rule is enabled...
% 0.18/0.37 # Local unification is enabled...
% 0.18/0.37 # Any saturation attempts will use folding labels...
% 0.18/0.37 # 78 beginning clauses after preprocessing and clausification
% 0.18/0.37 # Creating start rules for all 78 conjectures.
% 0.18/0.37 # There are 78 start rule candidates:
% 0.18/0.37 # Found 2 unit axioms.
% 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.37 # 78 start rule tableaux created.
% 0.18/0.37 # 76 extension rule candidate clauses
% 0.18/0.37 # 2 unit axiom clauses
% 0.18/0.37
% 0.18/0.37 # Requested 8, 32 cores available to the main process.
% 7.13/1.26 # 29618 Satisfiable branch
% 7.13/1.26 # Satisfiable branch found.
% 7.13/1.26 # There were 1 total branch saturation attempts.
% 7.13/1.26 # There were 0 of these attempts blocked.
% 7.13/1.26 # There were 0 deferred branch saturation attempts.
% 7.13/1.26 # There were 0 free duplicated saturations.
% 7.13/1.26 # There were 0 total successful branch saturations.
% 7.13/1.26 # There were 0 successful branch saturations in interreduction.
% 7.13/1.26 # There were 0 successful branch saturations on the branch.
% 7.13/1.26 # There were 0 successful branch saturations after the branch.
% 7.13/1.26 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.13/1.26 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.13/1.26 # Begin clausification derivation
% 7.13/1.26
% 7.13/1.26 # End clausification derivation
% 7.13/1.26 # Begin listing active clauses obtained from FOF to CNF conversion
% 7.13/1.26 cnf(i_0_79, negated_conjecture, (actual_world(skc63))).
% 7.13/1.26 cnf(i_0_80, negated_conjecture, (actual_world(skc19))).
% 7.13/1.26 cnf(i_0_114, negated_conjecture, (frontseat(skc19,skc24)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_101, negated_conjecture, (two(skc19,skc22)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_100, negated_conjecture, (group(skc19,skc22)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_81, negated_conjecture, (frontseat(skc63,skc72)|ssSkC0)).
% 7.13/1.26 cnf(i_0_82, negated_conjecture, (two(skc63,skc71)|ssSkC0)).
% 7.13/1.26 cnf(i_0_115, negated_conjecture, (group(skc19,skc20)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_116, negated_conjecture, (group(skc19,skc21)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_99, negated_conjecture, (ssSkP0(skc22,skc19)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_105, negated_conjecture, (old(skc19,skc27)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_83, negated_conjecture, (group(skc63,skc71)|ssSkC0)).
% 7.13/1.26 cnf(i_0_104, negated_conjecture, (dirty(skc19,skc27)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_103, negated_conjecture, (white(skc19,skc27)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_102, negated_conjecture, (chevy(skc19,skc27)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_108, negated_conjecture, (barrel(skc19,skc23)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_97, negated_conjecture, (group(skc63,skc65)|ssSkC0)).
% 7.13/1.26 cnf(i_0_98, negated_conjecture, (group(skc63,skc64)|ssSkC0)).
% 7.13/1.26 cnf(i_0_107, negated_conjecture, (present(skc19,skc23)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_106, negated_conjecture, (event(skc19,skc23)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_110, negated_conjecture, (hollywood_placename(skc19,skc25)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_109, negated_conjecture, (placename(skc19,skc25)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_84, negated_conjecture, (ssSkP0(skc71,skc63)|ssSkC0)).
% 7.13/1.26 cnf(i_0_111, negated_conjecture, (city(skc19,skc26)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_113, negated_conjecture, (street(skc19,skc24)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_112, negated_conjecture, (lonely(skc19,skc24)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_85, negated_conjecture, (old(skc63,skc70)|ssSkC0)).
% 7.13/1.26 cnf(i_0_86, negated_conjecture, (dirty(skc63,skc70)|ssSkC0)).
% 7.13/1.26 cnf(i_0_87, negated_conjecture, (white(skc63,skc70)|ssSkC0)).
% 7.13/1.26 cnf(i_0_88, negated_conjecture, (chevy(skc63,skc70)|ssSkC0)).
% 7.13/1.26 cnf(i_0_89, negated_conjecture, (barrel(skc63,skc66)|ssSkC0)).
% 7.13/1.26 cnf(i_0_90, negated_conjecture, (present(skc63,skc66)|ssSkC0)).
% 7.13/1.26 cnf(i_0_91, negated_conjecture, (event(skc63,skc66)|ssSkC0)).
% 7.13/1.26 cnf(i_0_92, negated_conjecture, (hollywood_placename(skc63,skc68)|ssSkC0)).
% 7.13/1.26 cnf(i_0_93, negated_conjecture, (placename(skc63,skc68)|ssSkC0)).
% 7.13/1.26 cnf(i_0_94, negated_conjecture, (city(skc63,skc69)|ssSkC0)).
% 7.13/1.26 cnf(i_0_95, negated_conjecture, (street(skc63,skc67)|ssSkC0)).
% 7.13/1.26 cnf(i_0_96, negated_conjecture, (lonely(skc63,skc67)|ssSkC0)).
% 7.13/1.26 cnf(i_0_117, negated_conjecture, (ssSkP1(skc72,skc71,skc63)|ssSkC0)).
% 7.13/1.26 cnf(i_0_118, negated_conjecture, (agent(skc63,skc66,skc70)|ssSkC0)).
% 7.13/1.26 cnf(i_0_126, negated_conjecture, (ssSkP1(skc24,skc22,skc19)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_123, negated_conjecture, (agent(skc19,skc23,skc27)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_125, negated_conjecture, (in(skc19,skc23,skc26)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_124, negated_conjecture, (of(skc19,skc25,skc26)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_119, negated_conjecture, (in(skc63,skc66,skc69)|ssSkC0)).
% 7.13/1.26 cnf(i_0_127, negated_conjecture, (down(skc19,skc23,skc24)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_128, negated_conjecture, (ssSkP2(skc21,skc20,skc19)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_120, negated_conjecture, (of(skc63,skc68,skc69)|ssSkC0)).
% 7.13/1.26 cnf(i_0_121, negated_conjecture, (down(skc63,skc66,skc67)|ssSkC0)).
% 7.13/1.26 cnf(i_0_122, negated_conjecture, (ssSkP2(skc65,skc64,skc63)|ssSkC0)).
% 7.13/1.26 cnf(i_0_130, negated_conjecture, (coat(skc63,X1)|ssSkC0|~member(skc63,X1,skc64))).
% 7.13/1.26 cnf(i_0_133, negated_conjecture, (coat(skc19,X1)|~member(skc19,X1,skc20)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_134, negated_conjecture, (black(skc19,X1)|~member(skc19,X1,skc20)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_135, negated_conjecture, (cheap(skc19,X1)|~member(skc19,X1,skc20)|~ssSkC0)).
% 7.13/1.26 cnf(i_0_131, negated_conjecture, (black(skc63,X1)|ssSkC0|~member(skc63,X1,skc64))).
% 7.13/1.26 cnf(i_0_132, negated_conjecture, (cheap(skc63,X1)|ssSkC0|~member(skc63,X1,skc64))).
% 7.13/1.26 cnf(i_0_139, negated_conjecture, (fellow(X1,X2)|~member(X1,X2,X3)|~ssSkP0(X3,X1))).
% 7.13/1.26 cnf(i_0_140, negated_conjecture, (young(X1,X2)|~member(X1,X2,X3)|~ssSkP0(X3,X1))).
% 7.13/1.26 cnf(i_0_129, negated_conjecture, (member(X1,skf11(X1,X2),X2)|ssSkP0(X2,X1))).
% 7.13/1.26 cnf(i_0_141, negated_conjecture, (ssSkP0(X1,X2)|~young(X2,skf11(X2,X3))|~fellow(X2,skf11(X2,X3)))).
% 7.13/1.26 cnf(i_0_136, negated_conjecture, (member(X1,skf16(X2,X1,X3),X3)|ssSkP1(X2,X3,X1))).
% 7.13/1.26 cnf(i_0_137, negated_conjecture, (member(X1,skf21(X2,X1,X3),X2)|ssSkP2(X2,X4,X1))).
% 7.13/1.26 cnf(i_0_138, negated_conjecture, (member(X1,skf19(X2,X1,X3),X3)|ssSkP2(X2,X3,X1))).
% 7.13/1.26 cnf(i_0_142, negated_conjecture, (state(X1,skf13(X1,X2,X3))|~member(X1,X4,X5)|~ssSkP1(X6,X5,X1))).
% 7.13/1.26 cnf(i_0_150, negated_conjecture, (ssSkP1(X1,X2,X3)|~be(X3,X4,skf16(X1,X3,X5),X6)|~state(X3,X4)|~in(X3,X6,X1))).
% 7.13/1.26 cnf(i_0_143, negated_conjecture, (in(X1,skf12(X2,X1,X3),X3)|~member(X1,X2,X4)|~ssSkP1(X3,X4,X1))).
% 7.13/1.26 cnf(i_0_147, negated_conjecture, (present(X1,skf17(X1,X2,X3))|~member(X1,X4,X5)|~member(X1,X6,X7)|~ssSkP2(X7,X5,X1))).
% 7.13/1.26 cnf(i_0_148, negated_conjecture, (event(X1,skf17(X1,X2,X3))|~member(X1,X4,X5)|~member(X1,X6,X7)|~ssSkP2(X7,X5,X1))).
% 7.13/1.26 cnf(i_0_145, negated_conjecture, (wear(X1,skf17(X1,X2,X3))|~member(X1,X4,X5)|~member(X1,X6,X7)|~ssSkP2(X7,X5,X1))).
% 7.13/1.26 cnf(i_0_146, negated_conjecture, (nonreflexive(X1,skf17(X1,X2,X3))|~member(X1,X4,X5)|~member(X1,X6,X7)|~ssSkP2(X7,X5,X1))).
% 7.13/1.26 cnf(i_0_149, negated_conjecture, (agent(X1,skf17(X1,X2,X3),X2)|~member(X1,X4,X5)|~member(X1,X2,X6)|~ssSkP2(X6,X5,X1))).
% 7.13/1.26 cnf(i_0_151, negated_conjecture, (patient(X1,skf17(X1,X2,X3),X3)|~member(X1,X3,X4)|~member(X1,X2,X5)|~ssSkP2(X5,X4,X1))).
% 7.13/1.26 cnf(i_0_144, negated_conjecture, (be(X1,skf13(X1,X2,X3),X3,skf12(X3,X1,X2))|~member(X1,X3,X4)|~ssSkP1(X5,X4,X1))).
% 7.13/1.26 cnf(i_0_152, negated_conjecture, (ssSkP2(X1,X2,X3)|~patient(X3,X4,skf19(X1,X3,X5))|~nonreflexive(X3,X4)|~wear(X3,X4)|~agent(X3,X4,skf21(X1,X3,X5))|~event(X3,X4)|~present(X3,X4))).
% 7.13/1.26 cnf(i_0_154, negated_conjecture, (member(X1,skf10(X1,X2),X2)|~ssSkP2(X3,X2,X1)|~down(X1,X4,X5)|~of(X1,X6,X7)|~in(X1,X4,X7)|~agent(X1,X4,X8)|~ssSkP1(X9,X10,X1)|~lonely(X1,X5)|~street(X1,X5)|~city(X1,X7)|~placename(X1,X6)|~hollywood_placename(X1,X6)|~event(X1,X4)|~present(X1,X4)|~barrel(X1,X4)|~chevy(X1,X8)|~white(X1,X8)|~dirty(X1,X8)|~old(X1,X8)|~ssSkP0(X10,X1)|~group(X1,X2)|~group(X1,X3)|~group(X1,X10)|~two(X1,X10)|~frontseat(X1,X9)|~ssSkC0|~actual_world(X1))).
% 7.13/1.26 cnf(i_0_153, negated_conjecture, (member(X1,skf23(X1,X2),X2)|ssSkC0|~ssSkP2(X3,X2,X1)|~down(X1,X4,X5)|~of(X1,X6,X7)|~in(X1,X4,X7)|~agent(X1,X4,X8)|~ssSkP1(X5,X9,X1)|~lonely(X1,X5)|~street(X1,X5)|~city(X1,X7)|~placename(X1,X6)|~hollywood_placename(X1,X6)|~event(X1,X4)|~present(X1,X4)|~barrel(X1,X4)|~chevy(X1,X8)|~white(X1,X8)|~dirty(X1,X8)|~old(X1,X8)|~ssSkP0(X9,X1)|~group(X1,X3)|~group(X1,X2)|~group(X1,X9)|~two(X1,X9)|~frontseat(X1,X5)|~actual_world(X1))).
% 7.13/1.26 cnf(i_0_156, negated_conjecture, (~cheap(X1,skf10(X1,X2))|~black(X1,skf10(X1,X2))|~coat(X1,skf10(X1,X2))|~ssSkP2(X3,X4,X1)|~down(X1,X5,X6)|~of(X1,X7,X8)|~in(X1,X5,X8)|~agent(X1,X5,X9)|~ssSkP1(X10,X11,X1)|~lonely(X1,X6)|~street(X1,X6)|~city(X1,X8)|~placename(X1,X7)|~hollywood_placename(X1,X7)|~event(X1,X5)|~present(X1,X5)|~barrel(X1,X5)|~chevy(X1,X9)|~white(X1,X9)|~dirty(X1,X9)|~old(X1,X9)|~ssSkP0(X11,X1)|~group(X1,X4)|~group(X1,X3)|~group(X1,X11)|~two(X1,X11)|~frontseat(X1,X10)|~ssSkC0|~actual_world(X1))).
% 7.13/1.26 cnf(i_0_155, negated_conjecture, (ssSkC0|~cheap(X1,skf23(X1,X2))|~black(X1,skf23(X1,X2))|~coat(X1,skf23(X1,X2))|~ssSkP2(X3,X4,X1)|~down(X1,X5,X6)|~of(X1,X7,X8)|~in(X1,X5,X8)|~agent(X1,X5,X9)|~ssSkP1(X6,X10,X1)|~lonely(X1,X6)|~street(X1,X6)|~city(X1,X8)|~placename(X1,X7)|~hollywood_placename(X1,X7)|~event(X1,X5)|~present(X1,X5)|~barrel(X1,X5)|~chevy(X1,X9)|~white(X1,X9)|~dirty(X1,X9)|~old(X1,X9)|~ssSkP0(X10,X1)|~group(X1,X3)|~group(X1,X4)|~group(X1,X10)|~two(X1,X10)|~frontseat(X1,X6)|~actual_world(X1))).
% 7.13/1.26 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 7.13/1.26 # Begin printing tableau
% 7.13/1.26 # Found 12 steps
% 7.13/1.26 cnf(i_0_143, negated_conjecture, (in(skc19,skf12(skf19(skc22,skc19,skc22),skc19,skc24),skc24)|~member(skc19,skf19(skc22,skc19,skc22),skc22)|~ssSkP1(skc24,skc22,skc19)), inference(start_rule)).
% 7.13/1.26 cnf(i_0_303, plain, (in(skc19,skf12(skf19(skc22,skc19,skc22),skc19,skc24),skc24)), inference(closure_rule, [i_0_0])).
% 7.13/1.26 cnf(i_0_305, plain, (~ssSkP1(skc24,skc22,skc19)), inference(extension_rule, [i_0_126])).
% 7.13/1.26 cnf(i_0_69955, plain, (~ssSkC0), inference(extension_rule, [i_0_91])).
% 7.13/1.26 cnf(i_0_69959, plain, (event(skc63,skc66)), inference(extension_rule, [i_0_152])).
% 7.13/1.26 cnf(i_0_304, plain, (~member(skc19,skf19(skc22,skc19,skc22),skc22)), inference(extension_rule, [i_0_138])).
% 7.13/1.26 cnf(i_0_71086, plain, (ssSkP2(skc22,skc22,skc19)), inference(extension_rule, [i_0_146])).
% 7.13/1.26 cnf(i_0_71161, plain, (nonreflexive(skc19,skf17(skc19,X22,X21))), inference(extension_rule, [i_0_152])).
% 7.13/1.26 cnf(i_0_71162, plain, (~member(skc19,skf16(X5,skc19,skc22),skc22)), inference(extension_rule, [i_0_136])).
% 7.13/1.26 cnf(i_0_71163, plain, (~member(skc19,skf10(skc19,skc22),skc22)), inference(extension_rule, [i_0_154])).
% 7.13/1.26 cnf(i_0_129319, plain, (~ssSkP2(skc22,skc22,skc19)), inference(closure_rule, [i_0_71086])).
% 7.13/1.26 cnf(i_0_129344, plain, (~actual_world(skc19)), inference(closure_rule, [i_0_80])).
% 7.13/1.26 # End printing tableau
% 7.13/1.26 # SZS output end
% 7.13/1.26 # Branches closed with saturation will be marked with an "s"
% 7.13/1.26 # Child (29618) has found a proof.
% 7.13/1.26
% 7.13/1.26 # Proof search is over...
% 7.13/1.26 # Freeing feature tree
%------------------------------------------------------------------------------