TSTP Solution File: NLP194-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP194-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:13:43 EDT 2022
% Result : Satisfiable 8.90s 1.49s
% Output : CNFRefutation 8.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP194-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 1 03:00:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.18/0.38 # No SInE strategy applied
% 0.18/0.38 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.18/0.38 # and selection function SelectNewComplexAHP.
% 0.18/0.38 #
% 0.18/0.38 # Presaturation interreduction done
% 0.18/0.38 # Number of axioms: 92 Number of unprocessed: 92
% 0.18/0.38 # Tableaux proof search.
% 0.18/0.38 # APR header successfully linked.
% 0.18/0.38 # Hello from C++
% 0.18/0.38 # The folding up rule is enabled...
% 0.18/0.38 # Local unification is enabled...
% 0.18/0.38 # Any saturation attempts will use folding labels...
% 0.18/0.38 # 92 beginning clauses after preprocessing and clausification
% 0.18/0.38 # Creating start rules for all 92 conjectures.
% 0.18/0.38 # There are 92 start rule candidates:
% 0.18/0.38 # Found 2 unit axioms.
% 0.18/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.38 # 92 start rule tableaux created.
% 0.18/0.38 # 90 extension rule candidate clauses
% 0.18/0.38 # 2 unit axiom clauses
% 0.18/0.38
% 0.18/0.38 # Requested 8, 32 cores available to the main process.
% 8.90/1.49 # 6861 Satisfiable branch
% 8.90/1.49 # Satisfiable branch found.
% 8.90/1.49 # There were 1 total branch saturation attempts.
% 8.90/1.49 # There were 0 of these attempts blocked.
% 8.90/1.49 # There were 0 deferred branch saturation attempts.
% 8.90/1.49 # There were 0 free duplicated saturations.
% 8.90/1.49 # There were 0 total successful branch saturations.
% 8.90/1.49 # There were 0 successful branch saturations in interreduction.
% 8.90/1.49 # There were 0 successful branch saturations on the branch.
% 8.90/1.49 # There were 0 successful branch saturations after the branch.
% 8.90/1.49 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.90/1.49 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.90/1.49 # Begin clausification derivation
% 8.90/1.49
% 8.90/1.49 # End clausification derivation
% 8.90/1.49 # Begin listing active clauses obtained from FOF to CNF conversion
% 8.90/1.49 cnf(i_0_93, negated_conjecture, (actual_world(skc71))).
% 8.90/1.49 cnf(i_0_94, negated_conjecture, (actual_world(skc24))).
% 8.90/1.49 cnf(i_0_122, negated_conjecture, (barrel(skc24,skc29)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_123, negated_conjecture, (present(skc24,skc29)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_124, negated_conjecture, (event(skc24,skc29)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_95, negated_conjecture, (barrel(skc71,skc79)|ssSkC0)).
% 8.90/1.49 cnf(i_0_96, negated_conjecture, (present(skc71,skc79)|ssSkC0)).
% 8.90/1.49 cnf(i_0_125, negated_conjecture, (chevy(skc24,skc32)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_126, negated_conjecture, (white(skc24,skc32)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_127, negated_conjecture, (dirty(skc24,skc32)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_128, negated_conjecture, (old(skc24,skc32)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_97, negated_conjecture, (event(skc71,skc79)|ssSkC0)).
% 8.90/1.49 cnf(i_0_130, negated_conjecture, (city(skc24,skc30)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_131, negated_conjecture, (street(skc24,skc30)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_132, negated_conjecture, (lonely(skc24,skc30)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_133, negated_conjecture, (placename(skc24,skc31)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_98, negated_conjecture, (chevy(skc71,skc82)|ssSkC0)).
% 8.90/1.49 cnf(i_0_99, negated_conjecture, (white(skc71,skc82)|ssSkC0)).
% 8.90/1.49 cnf(i_0_134, negated_conjecture, (hollywood_placename(skc24,skc31)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_117, negated_conjecture, (group(skc24,skc33)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_119, negated_conjecture, (group(skc24,skc34)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_118, negated_conjecture, (two(skc24,skc34)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_100, negated_conjecture, (dirty(skc71,skc82)|ssSkC0)).
% 8.90/1.49 cnf(i_0_120, negated_conjecture, (ssSkP0(skc34,skc24)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_121, negated_conjecture, (frontseat(skc24,skc35)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_129, negated_conjecture, (wheel(skc24,skc30)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_135, negated_conjecture, (jules_forename(skc24,skc27)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_101, negated_conjecture, (old(skc71,skc82)|ssSkC0)).
% 8.90/1.49 cnf(i_0_102, negated_conjecture, (city(skc71,skc80)|ssSkC0)).
% 8.90/1.49 cnf(i_0_136, negated_conjecture, (forename(skc24,skc27)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_137, negated_conjecture, (man(skc24,skc28)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_138, negated_conjecture, (state(skc24,skc26)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_103, negated_conjecture, (street(skc71,skc80)|ssSkC0)).
% 8.90/1.49 cnf(i_0_104, negated_conjecture, (lonely(skc71,skc80)|ssSkC0)).
% 8.90/1.49 cnf(i_0_105, negated_conjecture, (placename(skc71,skc81)|ssSkC0)).
% 8.90/1.49 cnf(i_0_106, negated_conjecture, (hollywood_placename(skc71,skc81)|ssSkC0)).
% 8.90/1.49 cnf(i_0_107, negated_conjecture, (group(skc71,skc76)|ssSkC0)).
% 8.90/1.49 cnf(i_0_109, negated_conjecture, (group(skc71,skc77)|ssSkC0)).
% 8.90/1.49 cnf(i_0_108, negated_conjecture, (two(skc71,skc77)|ssSkC0)).
% 8.90/1.49 cnf(i_0_110, negated_conjecture, (ssSkP0(skc77,skc71)|ssSkC0)).
% 8.90/1.49 cnf(i_0_111, negated_conjecture, (frontseat(skc71,skc78)|ssSkC0)).
% 8.90/1.49 cnf(i_0_112, negated_conjecture, (wheel(skc71,skc78)|ssSkC0)).
% 8.90/1.49 cnf(i_0_113, negated_conjecture, (jules_forename(skc71,skc74)|ssSkC0)).
% 8.90/1.49 cnf(i_0_114, negated_conjecture, (forename(skc71,skc74)|ssSkC0)).
% 8.90/1.49 cnf(i_0_115, negated_conjecture, (man(skc71,skc75)|ssSkC0)).
% 8.90/1.49 cnf(i_0_116, negated_conjecture, (state(skc71,skc73)|ssSkC0)).
% 8.90/1.49 cnf(i_0_149, negated_conjecture, (agent(skc24,skc29,skc32)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_150, negated_conjecture, (down(skc24,skc29,skc30)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_151, negated_conjecture, (in(skc24,skc29,skc30)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_139, negated_conjecture, (agent(skc71,skc79,skc82)|ssSkC0)).
% 8.90/1.49 cnf(i_0_140, negated_conjecture, (down(skc71,skc79,skc80)|ssSkC0)).
% 8.90/1.49 cnf(i_0_153, negated_conjecture, (of(skc24,skc31,skc30)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_154, negated_conjecture, (of(skc24,skc27,skc28)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_147, negated_conjecture, (ssSkP2(skc34,skc33,skc24)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_152, negated_conjecture, (behind(skc24,skc25,skc30)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_141, negated_conjecture, (in(skc71,skc79,skc80)|ssSkC0)).
% 8.90/1.49 cnf(i_0_148, negated_conjecture, (ssSkP1(skc35,skc34,skc24)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_142, negated_conjecture, (of(skc71,skc81,skc80)|ssSkC0)).
% 8.90/1.49 cnf(i_0_146, negated_conjecture, (of(skc71,skc74,skc75)|ssSkC0)).
% 8.90/1.49 cnf(i_0_143, negated_conjecture, (ssSkP2(skc77,skc76,skc71)|ssSkC0)).
% 8.90/1.49 cnf(i_0_144, negated_conjecture, (behind(skc71,skc72,skc78)|ssSkC0)).
% 8.90/1.49 cnf(i_0_145, negated_conjecture, (ssSkP1(skc78,skc77,skc71)|ssSkC0)).
% 8.90/1.49 cnf(i_0_161, negated_conjecture, (coat(skc24,X1)|~member(skc24,X1,skc33)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_162, negated_conjecture, (black(skc24,X1)|~member(skc24,X1,skc33)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_163, negated_conjecture, (cheap(skc24,X1)|~member(skc24,X1,skc33)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_158, negated_conjecture, (coat(skc71,X1)|ssSkC0|~member(skc71,X1,skc76))).
% 8.90/1.49 cnf(i_0_155, negated_conjecture, (be(skc71,skc73,skc75,skc72)|ssSkC0)).
% 8.90/1.49 cnf(i_0_156, negated_conjecture, (be(skc24,skc26,skc28,skc25)|~ssSkC0)).
% 8.90/1.49 cnf(i_0_159, negated_conjecture, (black(skc71,X1)|ssSkC0|~member(skc71,X1,skc76))).
% 8.90/1.49 cnf(i_0_160, negated_conjecture, (cheap(skc71,X1)|ssSkC0|~member(skc71,X1,skc76))).
% 8.90/1.49 cnf(i_0_167, negated_conjecture, (fellow(X1,X2)|~member(X1,X2,X3)|~ssSkP0(X3,X1))).
% 8.90/1.49 cnf(i_0_157, negated_conjecture, (member(X1,skf11(X1,X2),X2)|ssSkP0(X2,X1))).
% 8.90/1.49 cnf(i_0_168, negated_conjecture, (young(X1,X2)|~member(X1,X2,X3)|~ssSkP0(X3,X1))).
% 8.90/1.49 cnf(i_0_169, negated_conjecture, (ssSkP0(X1,X2)|~young(X2,skf11(X2,X3))|~fellow(X2,skf11(X2,X3)))).
% 8.90/1.49 cnf(i_0_165, negated_conjecture, (member(X1,skf21(X2,X1,X3),X2)|ssSkP2(X2,X4,X1))).
% 8.90/1.49 cnf(i_0_166, negated_conjecture, (member(X1,skf19(X2,X1,X3),X3)|ssSkP2(X2,X3,X1))).
% 8.90/1.49 cnf(i_0_164, negated_conjecture, (member(X1,skf16(X2,X1,X3),X3)|ssSkP1(X2,X3,X1))).
% 8.90/1.49 cnf(i_0_170, negated_conjecture, (state(X1,skf13(X1,X2,X3))|~member(X1,X4,X5)|~ssSkP1(X6,X5,X1))).
% 8.90/1.49 cnf(i_0_171, negated_conjecture, (in(X1,skf12(X2,X1,X3),X3)|~member(X1,X2,X4)|~ssSkP1(X3,X4,X1))).
% 8.90/1.49 cnf(i_0_175, negated_conjecture, (present(X1,skf17(X1,X2,X3))|~member(X1,X4,X5)|~member(X1,X6,X7)|~ssSkP2(X7,X5,X1))).
% 8.90/1.49 cnf(i_0_176, negated_conjecture, (event(X1,skf17(X1,X2,X3))|~member(X1,X4,X5)|~member(X1,X6,X7)|~ssSkP2(X7,X5,X1))).
% 8.90/1.49 cnf(i_0_173, negated_conjecture, (wear(X1,skf17(X1,X2,X3))|~member(X1,X4,X5)|~member(X1,X6,X7)|~ssSkP2(X7,X5,X1))).
% 8.90/1.49 cnf(i_0_174, negated_conjecture, (nonreflexive(X1,skf17(X1,X2,X3))|~member(X1,X4,X5)|~member(X1,X6,X7)|~ssSkP2(X7,X5,X1))).
% 8.90/1.49 cnf(i_0_177, negated_conjecture, (agent(X1,skf17(X1,X2,X3),X2)|~member(X1,X4,X5)|~member(X1,X2,X6)|~ssSkP2(X6,X5,X1))).
% 8.90/1.49 cnf(i_0_178, negated_conjecture, (ssSkP1(X1,X2,X3)|~be(X3,X4,skf16(X1,X3,X5),X6)|~in(X3,X6,X1)|~state(X3,X4))).
% 8.90/1.49 cnf(i_0_179, negated_conjecture, (patient(X1,skf17(X1,X2,X3),X3)|~member(X1,X3,X4)|~member(X1,X2,X5)|~ssSkP2(X5,X4,X1))).
% 8.90/1.49 cnf(i_0_180, 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))).
% 8.90/1.49 cnf(i_0_172, negated_conjecture, (be(X1,skf13(X1,X2,X3),X3,skf12(X3,X1,X2))|~member(X1,X3,X4)|~ssSkP1(X5,X4,X1))).
% 8.90/1.49 cnf(i_0_181, negated_conjecture, (member(X1,skf24(X1,X2),X2)|ssSkC0|~be(X1,X3,X4,X5)|~ssSkP1(X6,X7,X1)|~behind(X1,X5,X8)|~ssSkP2(X7,X2,X1)|~of(X1,X9,X4)|~of(X1,X10,X8)|~in(X1,X11,X8)|~down(X1,X11,X8)|~agent(X1,X11,X12)|~state(X1,X3)|~man(X1,X4)|~forename(X1,X9)|~jules_forename(X1,X9)|~wheel(X1,X8)|~frontseat(X1,X6)|~ssSkP0(X7,X1)|~two(X1,X7)|~group(X1,X7)|~group(X1,X2)|~hollywood_placename(X1,X10)|~placename(X1,X10)|~lonely(X1,X8)|~street(X1,X8)|~city(X1,X8)|~old(X1,X12)|~dirty(X1,X12)|~white(X1,X12)|~chevy(X1,X12)|~event(X1,X11)|~present(X1,X11)|~barrel(X1,X11)|~actual_world(X1))).
% 8.90/1.49 cnf(i_0_182, negated_conjecture, (member(X1,skf10(X1,X2),X2)|~be(X1,X3,X4,X5)|~ssSkP1(X6,X7,X1)|~behind(X1,X5,X6)|~ssSkP2(X7,X2,X1)|~of(X1,X8,X4)|~of(X1,X9,X10)|~in(X1,X11,X10)|~down(X1,X11,X10)|~agent(X1,X11,X12)|~state(X1,X3)|~man(X1,X4)|~forename(X1,X8)|~jules_forename(X1,X8)|~wheel(X1,X6)|~frontseat(X1,X6)|~ssSkP0(X7,X1)|~two(X1,X7)|~group(X1,X7)|~group(X1,X2)|~hollywood_placename(X1,X9)|~placename(X1,X9)|~lonely(X1,X10)|~street(X1,X10)|~city(X1,X10)|~old(X1,X12)|~dirty(X1,X12)|~white(X1,X12)|~chevy(X1,X12)|~event(X1,X11)|~present(X1,X11)|~barrel(X1,X11)|~ssSkC0|~actual_world(X1))).
% 8.90/1.49 cnf(i_0_184, negated_conjecture, (~cheap(X1,skf10(X1,X2))|~black(X1,skf10(X1,X2))|~coat(X1,skf10(X1,X2))|~be(X1,X3,X4,X5)|~ssSkP1(X6,X7,X1)|~behind(X1,X5,X6)|~ssSkP2(X7,X8,X1)|~of(X1,X9,X4)|~of(X1,X10,X11)|~in(X1,X12,X11)|~down(X1,X12,X11)|~agent(X1,X12,X13)|~state(X1,X3)|~man(X1,X4)|~forename(X1,X9)|~jules_forename(X1,X9)|~wheel(X1,X6)|~frontseat(X1,X6)|~ssSkP0(X7,X1)|~two(X1,X7)|~group(X1,X7)|~group(X1,X8)|~hollywood_placename(X1,X10)|~placename(X1,X10)|~lonely(X1,X11)|~street(X1,X11)|~city(X1,X11)|~old(X1,X13)|~dirty(X1,X13)|~white(X1,X13)|~chevy(X1,X13)|~event(X1,X12)|~present(X1,X12)|~barrel(X1,X12)|~ssSkC0|~actual_world(X1))).
% 8.90/1.49 cnf(i_0_183, negated_conjecture, (ssSkC0|~cheap(X1,skf24(X1,X2))|~black(X1,skf24(X1,X2))|~coat(X1,skf24(X1,X2))|~be(X1,X3,X4,X5)|~ssSkP1(X6,X7,X1)|~behind(X1,X5,X8)|~ssSkP2(X7,X9,X1)|~of(X1,X10,X4)|~of(X1,X11,X8)|~in(X1,X12,X8)|~down(X1,X12,X8)|~agent(X1,X12,X13)|~state(X1,X3)|~man(X1,X4)|~forename(X1,X10)|~jules_forename(X1,X10)|~wheel(X1,X8)|~frontseat(X1,X6)|~ssSkP0(X7,X1)|~two(X1,X7)|~group(X1,X7)|~group(X1,X9)|~hollywood_placename(X1,X11)|~placename(X1,X11)|~lonely(X1,X8)|~street(X1,X8)|~city(X1,X8)|~old(X1,X13)|~dirty(X1,X13)|~white(X1,X13)|~chevy(X1,X13)|~event(X1,X12)|~present(X1,X12)|~barrel(X1,X12)|~actual_world(X1))).
% 8.90/1.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 8.90/1.49 # Begin printing tableau
% 8.90/1.49 # Found 3 steps
% 8.90/1.49 cnf(i_0_124, negated_conjecture, (event(skc24,skc29)|~ssSkC0), inference(start_rule)).
% 8.90/1.49 cnf(i_0_522, plain, (event(skc24,skc29)), inference(extension_rule, [i_0_180])).
% 8.90/1.49 cnf(i_0_161348, plain, (ssSkP2(X15,X13,skc24)), inference(extension_rule, [i_0_176])).
% 8.90/1.49 # End printing tableau
% 8.90/1.49 # SZS output end
% 8.90/1.49 # Branches closed with saturation will be marked with an "s"
% 8.90/1.49 # Child (6861) has found a proof.
% 8.90/1.49
% 8.90/1.49 # Proof search is over...
% 8.90/1.49 # Freeing feature tree
%------------------------------------------------------------------------------