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