TSTP Solution File: NLP137-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP137-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 : n024.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:04 EDT 2022
% Result : Satisfiable 0.17s 0.41s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP137-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.12/0.32 % Computer : n024.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Fri Jul 1 01:56:45 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.17/0.35 # No SInE strategy applied
% 0.17/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.35 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.17/0.35 #
% 0.17/0.35 # Presaturation interreduction done
% 0.17/0.35 # Number of axioms: 60 Number of unprocessed: 60
% 0.17/0.35 # Tableaux proof search.
% 0.17/0.35 # APR header successfully linked.
% 0.17/0.35 # Hello from C++
% 0.17/0.36 # The folding up rule is enabled...
% 0.17/0.36 # Local unification is enabled...
% 0.17/0.36 # Any saturation attempts will use folding labels...
% 0.17/0.36 # 60 beginning clauses after preprocessing and clausification
% 0.17/0.36 # Creating start rules for all 60 conjectures.
% 0.17/0.36 # There are 60 start rule candidates:
% 0.17/0.36 # Found 2 unit axioms.
% 0.17/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.17/0.36 # 60 start rule tableaux created.
% 0.17/0.36 # 58 extension rule candidate clauses
% 0.17/0.36 # 2 unit axiom clauses
% 0.17/0.36
% 0.17/0.36 # Requested 8, 32 cores available to the main process.
% 0.17/0.41 # 25175 Satisfiable branch
% 0.17/0.41 # Satisfiable branch found.
% 0.17/0.41 # There were 1 total branch saturation attempts.
% 0.17/0.41 # There were 0 of these attempts blocked.
% 0.17/0.41 # There were 0 deferred branch saturation attempts.
% 0.17/0.41 # There were 0 free duplicated saturations.
% 0.17/0.41 # There were 0 total successful branch saturations.
% 0.17/0.41 # There were 0 successful branch saturations in interreduction.
% 0.17/0.41 # There were 0 successful branch saturations on the branch.
% 0.17/0.41 # There were 0 successful branch saturations after the branch.
% 0.17/0.41 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.41 # Begin clausification derivation
% 0.17/0.41
% 0.17/0.41 # End clausification derivation
% 0.17/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.17/0.41 cnf(i_0_61, negated_conjecture, (actual_world(skc43))).
% 0.17/0.41 cnf(i_0_62, negated_conjecture, (actual_world(skc13))).
% 0.17/0.41 cnf(i_0_81, negated_conjecture, (old(skc13,skc18)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_82, negated_conjecture, (dirty(skc13,skc18)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_83, negated_conjecture, (white(skc13,skc18)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_63, negated_conjecture, (old(skc43,skc49)|ssSkC0)).
% 0.17/0.41 cnf(i_0_64, negated_conjecture, (dirty(skc43,skc49)|ssSkC0)).
% 0.17/0.41 cnf(i_0_84, negated_conjecture, (chevy(skc13,skc18)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_80, negated_conjecture, (barrel(skc13,skc15)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_79, negated_conjecture, (present(skc13,skc15)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_78, negated_conjecture, (event(skc13,skc15)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_65, negated_conjecture, (white(skc43,skc49)|ssSkC0)).
% 0.17/0.41 cnf(i_0_88, negated_conjecture, (hollywood_placename(skc13,skc17)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_89, negated_conjecture, (placename(skc13,skc17)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_87, negated_conjecture, (city(skc13,skc16)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_86, negated_conjecture, (street(skc13,skc16)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_66, negated_conjecture, (chevy(skc43,skc49)|ssSkC0)).
% 0.17/0.41 cnf(i_0_67, negated_conjecture, (barrel(skc43,skc45)|ssSkC0)).
% 0.17/0.41 cnf(i_0_85, negated_conjecture, (lonely(skc13,skc16)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_91, negated_conjecture, (two(skc13,skc14)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_90, negated_conjecture, (group(skc13,skc14)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_92, negated_conjecture, (ssSkP1(skc14,skc13)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_68, negated_conjecture, (present(skc43,skc45)|ssSkC0)).
% 0.17/0.41 cnf(i_0_69, negated_conjecture, (event(skc43,skc45)|ssSkC0)).
% 0.17/0.41 cnf(i_0_70, negated_conjecture, (hollywood_placename(skc43,skc47)|ssSkC0)).
% 0.17/0.41 cnf(i_0_71, negated_conjecture, (placename(skc43,skc47)|ssSkC0)).
% 0.17/0.41 cnf(i_0_72, negated_conjecture, (city(skc43,skc48)|ssSkC0)).
% 0.17/0.41 cnf(i_0_73, negated_conjecture, (street(skc43,skc46)|ssSkC0)).
% 0.17/0.41 cnf(i_0_74, negated_conjecture, (lonely(skc43,skc46)|ssSkC0)).
% 0.17/0.41 cnf(i_0_75, negated_conjecture, (ssSkP0(skc44,skc43)|ssSkC0)).
% 0.17/0.41 cnf(i_0_76, negated_conjecture, (two(skc43,skc44)|ssSkC0)).
% 0.17/0.41 cnf(i_0_77, negated_conjecture, (group(skc43,skc44)|ssSkC0)).
% 0.17/0.41 cnf(i_0_106, negated_conjecture, (fellow(skc13,X1)|~member(skc13,X1,skc14)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_93, negated_conjecture, (agent(skc43,skc45,skc49)|ssSkC0)).
% 0.17/0.41 cnf(i_0_97, negated_conjecture, (agent(skc13,skc15,skc18)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_98, negated_conjecture, (in(skc13,skc15,skc16)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_100, negated_conjecture, (of(skc13,skc17,skc16)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_99, negated_conjecture, (down(skc13,skc15,skc16)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_94, negated_conjecture, (in(skc43,skc45,skc48)|ssSkC0)).
% 0.17/0.41 cnf(i_0_95, negated_conjecture, (of(skc43,skc47,skc48)|ssSkC0)).
% 0.17/0.41 cnf(i_0_107, negated_conjecture, (young(skc13,X1)|~member(skc13,X1,skc14)|~ssSkC0)).
% 0.17/0.41 cnf(i_0_104, negated_conjecture, (fellow(skc43,X1)|ssSkC0|~member(skc43,X1,skc44))).
% 0.17/0.41 cnf(i_0_105, negated_conjecture, (young(skc43,X1)|ssSkC0|~member(skc43,X1,skc44))).
% 0.17/0.41 cnf(i_0_96, negated_conjecture, (down(skc43,skc45,skc46)|ssSkC0)).
% 0.17/0.41 cnf(i_0_101, negated_conjecture, (frontseat(X1,skf14(X1,X2))|ssSkP0(X3,X1))).
% 0.17/0.41 cnf(i_0_102, negated_conjecture, (member(X1,skf14(X1,X2),X2)|ssSkP0(X2,X1))).
% 0.17/0.41 cnf(i_0_103, negated_conjecture, (member(X1,skf19(X1,X2),X2)|ssSkP1(X2,X1))).
% 0.17/0.41 cnf(i_0_109, negated_conjecture, (frontseat(X1,skf15(X1,X2))|~member(X1,X3,X4)|~ssSkP1(X4,X1))).
% 0.17/0.41 cnf(i_0_108, negated_conjecture, (state(X1,skf16(X1,X2))|~member(X1,X3,X4)|~ssSkP1(X4,X1))).
% 0.17/0.41 cnf(i_0_111, negated_conjecture, (state(X1,skf11(X1,X2))|~member(X1,X3,X4)|~frontseat(X1,X3)|~ssSkP0(X4,X1))).
% 0.17/0.41 cnf(i_0_110, negated_conjecture, (in(X1,skf15(X1,X2),skf15(X1,X2))|~member(X1,X3,X4)|~ssSkP1(X4,X1))).
% 0.17/0.41 cnf(i_0_115, negated_conjecture, (ssSkP0(X1,X2)|~be(X2,X3,skf14(X2,X4),X5)|~state(X2,X3)|~in(X2,X5,skf14(X2,X4)))).
% 0.17/0.41 cnf(i_0_116, negated_conjecture, (ssSkP1(X1,X2)|~be(X2,X3,skf19(X2,X4),X5)|~state(X2,X3)|~frontseat(X2,X5)|~in(X2,X5,X5))).
% 0.17/0.41 cnf(i_0_113, negated_conjecture, (in(X1,skf10(X2,X1),X2)|~member(X1,X2,X3)|~frontseat(X1,X2)|~ssSkP0(X3,X1))).
% 0.17/0.41 cnf(i_0_112, negated_conjecture, (be(X1,skf16(X1,X2),X2,skf15(X1,X2))|~member(X1,X2,X3)|~ssSkP1(X3,X1))).
% 0.17/0.41 cnf(i_0_114, negated_conjecture, (be(X1,skf11(X1,X2),X2,skf10(X2,X1))|~member(X1,X2,X3)|~frontseat(X1,X2)|~ssSkP0(X3,X1))).
% 0.17/0.41 cnf(i_0_119, negated_conjecture, (ssSkC0|~young(X1,skf21(X1,X2))|~fellow(X1,skf21(X1,X2))|~down(X1,X3,X4)|~of(X1,X5,X4)|~in(X1,X3,X4)|~agent(X1,X3,X6)|~ssSkP1(X7,X1)|~group(X1,X7)|~two(X1,X7)|~lonely(X1,X4)|~street(X1,X4)|~city(X1,X4)|~placename(X1,X5)|~hollywood_placename(X1,X5)|~event(X1,X3)|~present(X1,X3)|~barrel(X1,X3)|~chevy(X1,X6)|~white(X1,X6)|~dirty(X1,X6)|~old(X1,X6)|~actual_world(X1))).
% 0.17/0.41 cnf(i_0_117, negated_conjecture, (member(X1,skf21(X1,X2),X2)|ssSkC0|~down(X1,X3,X4)|~of(X1,X5,X4)|~in(X1,X3,X4)|~agent(X1,X3,X6)|~ssSkP1(X2,X1)|~group(X1,X2)|~two(X1,X2)|~lonely(X1,X4)|~street(X1,X4)|~city(X1,X4)|~placename(X1,X5)|~hollywood_placename(X1,X5)|~event(X1,X3)|~present(X1,X3)|~barrel(X1,X3)|~chevy(X1,X6)|~white(X1,X6)|~dirty(X1,X6)|~old(X1,X6)|~actual_world(X1))).
% 0.17/0.41 cnf(i_0_120, negated_conjecture, (~young(X1,skf9(X1,X2))|~fellow(X1,skf9(X1,X2))|~down(X1,X3,X4)|~of(X1,X5,X6)|~in(X1,X3,X6)|~agent(X1,X3,X7)|~group(X1,X8)|~two(X1,X8)|~ssSkP0(X8,X1)|~lonely(X1,X4)|~street(X1,X4)|~city(X1,X6)|~placename(X1,X5)|~hollywood_placename(X1,X5)|~event(X1,X3)|~present(X1,X3)|~barrel(X1,X3)|~chevy(X1,X7)|~white(X1,X7)|~dirty(X1,X7)|~old(X1,X7)|~ssSkC0|~actual_world(X1))).
% 0.17/0.41 cnf(i_0_118, negated_conjecture, (member(X1,skf9(X1,X2),X2)|~down(X1,X3,X4)|~of(X1,X5,X6)|~in(X1,X3,X6)|~agent(X1,X3,X7)|~group(X1,X2)|~two(X1,X2)|~ssSkP0(X2,X1)|~lonely(X1,X4)|~street(X1,X4)|~city(X1,X6)|~placename(X1,X5)|~hollywood_placename(X1,X5)|~event(X1,X3)|~present(X1,X3)|~barrel(X1,X3)|~chevy(X1,X7)|~white(X1,X7)|~dirty(X1,X7)|~old(X1,X7)|~ssSkC0|~actual_world(X1))).
% 0.17/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.17/0.41 # Begin printing tableau
% 0.17/0.41 # Found 8 steps
% 0.17/0.41 cnf(i_0_114, negated_conjecture, (be(skc43,skf11(skc43,skf21(skc43,skc44)),skf21(skc43,skc44),skf10(skf21(skc43,skc44),skc43))|~member(skc43,skf21(skc43,skc44),skc44)|~frontseat(skc43,skf21(skc43,skc44))|~ssSkP0(skc44,skc43)), inference(start_rule)).
% 0.17/0.41 cnf(i_0_211, plain, (be(skc43,skf11(skc43,skf21(skc43,skc44)),skf21(skc43,skc44),skf10(skf21(skc43,skc44),skc43))), inference(closure_rule, [i_0_0])).
% 0.17/0.41 cnf(i_0_213, plain, (~frontseat(skc43,skf21(skc43,skc44))), inference(closure_rule, [i_0_0])).
% 0.17/0.41 cnf(i_0_214, plain, (~ssSkP0(skc44,skc43)), inference(extension_rule, [i_0_75])).
% 0.17/0.41 cnf(i_0_21710, plain, (ssSkC0), inference(extension_rule, [i_0_92])).
% 0.17/0.41 cnf(i_0_22901, plain, (ssSkP1(skc14,skc13)), inference(extension_rule, [i_0_110])).
% 0.17/0.41 cnf(i_0_212, plain, (~member(skc43,skf21(skc43,skc44),skc44)), inference(extension_rule, [i_0_117])).
% 0.17/0.41 cnf(i_0_29560, plain, (~actual_world(skc43)), inference(closure_rule, [i_0_61])).
% 0.17/0.41 # End printing tableau
% 0.17/0.41 # SZS output end
% 0.17/0.41 # Branches closed with saturation will be marked with an "s"
% 0.17/0.41 # Child (25175) has found a proof.
% 0.17/0.41
% 0.17/0.41 # Proof search is over...
% 0.17/0.41 # Freeing feature tree
%------------------------------------------------------------------------------