TSTP Solution File: NLP120-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP120-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 : n013.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:12:50 EDT 2022
% Result : Satisfiable 0.19s 0.37s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP120-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/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 : n013.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 05:37:59 EDT 2022
% 0.19/0.33 % CPUTime :
% 0.19/0.36 # No SInE strategy applied
% 0.19/0.36 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_OS_S1U
% 0.19/0.36 # and selection function SelectComplexAHPExceptRRHorn.
% 0.19/0.36 #
% 0.19/0.36 # Number of axioms: 36 Number of unprocessed: 36
% 0.19/0.36 # Tableaux proof search.
% 0.19/0.36 # APR header successfully linked.
% 0.19/0.36 # Hello from C++
% 0.19/0.36 # The folding up rule is enabled...
% 0.19/0.36 # Local unification is enabled...
% 0.19/0.36 # Any saturation attempts will use folding labels...
% 0.19/0.36 # 36 beginning clauses after preprocessing and clausification
% 0.19/0.36 # Creating start rules for all 36 conjectures.
% 0.19/0.36 # There are 36 start rule candidates:
% 0.19/0.36 # Found 2 unit axioms.
% 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.36 # 36 start rule tableaux created.
% 0.19/0.36 # 34 extension rule candidate clauses
% 0.19/0.36 # 2 unit axiom clauses
% 0.19/0.36
% 0.19/0.36 # Requested 8, 32 cores available to the main process.
% 0.19/0.37 # 30751 Satisfiable branch
% 0.19/0.37 # 30752 Satisfiable branch
% 0.19/0.37 # Satisfiable branch found.
% 0.19/0.37 # There were 1 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 0 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 0 successful branch saturations after the branch.
% 0.19/0.37 # Satisfiable branch found.
% 0.19/0.37 # There were 1 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 0 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 0 successful branch saturations after the branch.
% 0.19/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_37, negated_conjecture, (actual_world(skc17))).
% 0.19/0.37 cnf(i_0_38, negated_conjecture, (actual_world(skc11))).
% 0.19/0.37 cnf(i_0_39, negated_conjecture, (ssSkC0|city(skc17,skc20))).
% 0.19/0.37 cnf(i_0_40, negated_conjecture, (ssSkC0|chevy(skc17,skc20))).
% 0.19/0.37 cnf(i_0_41, negated_conjecture, (ssSkC0|white(skc17,skc20))).
% 0.19/0.37 cnf(i_0_42, negated_conjecture, (ssSkC0|dirty(skc17,skc20))).
% 0.19/0.37 cnf(i_0_43, negated_conjecture, (ssSkC0|old(skc17,skc20))).
% 0.19/0.37 cnf(i_0_44, negated_conjecture, (ssSkC0|placename(skc17,skc21))).
% 0.19/0.37 cnf(i_0_45, negated_conjecture, (ssSkC0|hollywood_placename(skc17,skc21))).
% 0.19/0.37 cnf(i_0_46, negated_conjecture, (ssSkC0|event(skc17,skc18))).
% 0.19/0.37 cnf(i_0_47, negated_conjecture, (ssSkC0|present(skc17,skc18))).
% 0.19/0.37 cnf(i_0_48, negated_conjecture, (ssSkC0|barrel(skc17,skc18))).
% 0.19/0.37 cnf(i_0_49, negated_conjecture, (ssSkC0|lonely(skc17,skc19))).
% 0.19/0.37 cnf(i_0_50, negated_conjecture, (ssSkC0|street(skc17,skc19))).
% 0.19/0.37 cnf(i_0_58, negated_conjecture, (city(skc11,skc15)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_59, negated_conjecture, (chevy(skc11,skc13)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_60, negated_conjecture, (white(skc11,skc13)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_61, negated_conjecture, (dirty(skc11,skc13)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_62, negated_conjecture, (old(skc11,skc13)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_57, negated_conjecture, (placename(skc11,skc14)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_56, negated_conjecture, (hollywood_placename(skc11,skc14)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_55, negated_conjecture, (event(skc11,skc12)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_54, negated_conjecture, (present(skc11,skc12)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_53, negated_conjecture, (barrel(skc11,skc12)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_51, negated_conjecture, (lonely(skc11,skc16)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_52, negated_conjecture, (street(skc11,skc16)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_63, negated_conjecture, (ssSkC0|agent(skc17,skc18,skc20))).
% 0.19/0.37 cnf(i_0_64, negated_conjecture, (ssSkC0|in(skc17,skc18,skc20))).
% 0.19/0.37 cnf(i_0_65, negated_conjecture, (ssSkC0|of(skc17,skc21,skc20))).
% 0.19/0.37 cnf(i_0_66, negated_conjecture, (ssSkC0|down(skc17,skc18,skc19))).
% 0.19/0.37 cnf(i_0_70, negated_conjecture, (agent(skc11,skc12,skc13)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_68, negated_conjecture, (in(skc11,skc12,skc15)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_69, negated_conjecture, (of(skc11,skc14,skc15)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_67, negated_conjecture, (down(skc11,skc12,skc16)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_71, negated_conjecture, (ssSkC0|~actual_world(X1)|~city(X1,X5)|~chevy(X1,X6)|~white(X1,X6)|~dirty(X1,X6)|~old(X1,X6)|~placename(X1,X4)|~hollywood_placename(X1,X4)|~event(X1,X2)|~present(X1,X2)|~barrel(X1,X2)|~lonely(X1,X3)|~street(X1,X3)|~agent(X1,X2,X6)|~in(X1,X2,X5)|~of(X1,X4,X5)|~down(X1,X2,X3))).
% 0.19/0.37 cnf(i_0_72, negated_conjecture, (~ssSkC0|~actual_world(X1)|~city(X1,X2)|~chevy(X1,X2)|~white(X1,X2)|~dirty(X1,X2)|~old(X1,X2)|~placename(X1,X4)|~hollywood_placename(X1,X4)|~event(X1,X3)|~present(X1,X3)|~barrel(X1,X3)|~lonely(X1,X5)|~street(X1,X5)|~agent(X1,X3,X2)|~in(X1,X3,X2)|~of(X1,X4,X2)|~down(X1,X3,X5))).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 3 steps
% 0.19/0.37 cnf(i_0_38, negated_conjecture, (actual_world(skc11)), inference(start_rule)).
% 0.19/0.37 cnf(i_0_173, plain, (actual_world(skc11)), inference(extension_rule, [i_0_71])).
% 0.19/0.37 cnf(i_0_793, plain, (ssSkC0), inference(extension_rule, [i_0_67])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_37, negated_conjecture, (actual_world(skc17))).
% 0.19/0.37 cnf(i_0_38, negated_conjecture, (actual_world(skc11))).
% 0.19/0.37 cnf(i_0_39, negated_conjecture, (ssSkC0|city(skc17,skc20))).
% 0.19/0.37 cnf(i_0_40, negated_conjecture, (ssSkC0|chevy(skc17,skc20))).
% 0.19/0.37 cnf(i_0_41, negated_conjecture, (ssSkC0|white(skc17,skc20))).
% 0.19/0.37 cnf(i_0_42, negated_conjecture, (ssSkC0|dirty(skc17,skc20))).
% 0.19/0.37 cnf(i_0_43, negated_conjecture, (ssSkC0|old(skc17,skc20))).
% 0.19/0.37 cnf(i_0_44, negated_conjecture, (ssSkC0|placename(skc17,skc21))).
% 0.19/0.37 cnf(i_0_45, negated_conjecture, (ssSkC0|hollywood_placename(skc17,skc21))).
% 0.19/0.37 cnf(i_0_46, negated_conjecture, (ssSkC0|event(skc17,skc18))).
% 0.19/0.37 cnf(i_0_47, negated_conjecture, (ssSkC0|present(skc17,skc18))).
% 0.19/0.37 cnf(i_0_48, negated_conjecture, (ssSkC0|barrel(skc17,skc18))).
% 0.19/0.37 cnf(i_0_49, negated_conjecture, (ssSkC0|lonely(skc17,skc19))).
% 0.19/0.37 cnf(i_0_50, negated_conjecture, (ssSkC0|street(skc17,skc19))).
% 0.19/0.37 cnf(i_0_58, negated_conjecture, (city(skc11,skc15)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_59, negated_conjecture, (chevy(skc11,skc13)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_60, negated_conjecture, (white(skc11,skc13)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_61, negated_conjecture, (dirty(skc11,skc13)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_62, negated_conjecture, (old(skc11,skc13)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_57, negated_conjecture, (placename(skc11,skc14)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_56, negated_conjecture, (hollywood_placename(skc11,skc14)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_55, negated_conjecture, (event(skc11,skc12)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_54, negated_conjecture, (present(skc11,skc12)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_53, negated_conjecture, (barrel(skc11,skc12)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_51, negated_conjecture, (lonely(skc11,skc16)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_52, negated_conjecture, (street(skc11,skc16)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_63, negated_conjecture, (ssSkC0|agent(skc17,skc18,skc20))).
% 0.19/0.37 cnf(i_0_64, negated_conjecture, (ssSkC0|in(skc17,skc18,skc20))).
% 0.19/0.37 cnf(i_0_65, negated_conjecture, (ssSkC0|of(skc17,skc21,skc20))).
% 0.19/0.37 cnf(i_0_66, negated_conjecture, (ssSkC0|down(skc17,skc18,skc19))).
% 0.19/0.37 cnf(i_0_70, negated_conjecture, (agent(skc11,skc12,skc13)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_68, negated_conjecture, (in(skc11,skc12,skc15)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_69, negated_conjecture, (of(skc11,skc14,skc15)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_67, negated_conjecture, (down(skc11,skc12,skc16)|~ssSkC0)).
% 0.19/0.37 cnf(i_0_71, negated_conjecture, (ssSkC0|~actual_world(X1)|~city(X1,X5)|~chevy(X1,X6)|~white(X1,X6)|~dirty(X1,X6)|~old(X1,X6)|~placename(X1,X4)|~hollywood_placename(X1,X4)|~event(X1,X2)|~present(X1,X2)|~barrel(X1,X2)|~lonely(X1,X3)|~street(X1,X3)|~agent(X1,X2,X6)|~in(X1,X2,X5)|~of(X1,X4,X5)|~down(X1,X2,X3))).
% 0.19/0.37 cnf(i_0_72, negated_conjecture, (~ssSkC0|~actual_world(X1)|~city(X1,X2)|~chevy(X1,X2)|~white(X1,X2)|~dirty(X1,X2)|~old(X1,X2)|~placename(X1,X4)|~hollywood_placename(X1,X4)|~event(X1,X3)|~present(X1,X3)|~barrel(X1,X3)|~lonely(X1,X5)|~street(X1,X5)|~agent(X1,X3,X2)|~in(X1,X3,X2)|~of(X1,X4,X2)|~down(X1,X3,X5))).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 3 steps
% 0.19/0.37 cnf(i_0_37, negated_conjecture, (actual_world(skc17)), inference(start_rule)).
% 0.19/0.37 cnf(i_0_174, plain, (actual_world(skc17)), inference(extension_rule, [i_0_71])).
% 0.19/0.37 cnf(i_0_793, plain, (ssSkC0), inference(extension_rule, [i_0_67])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # Child (30751) has found a proof.
% 0.19/0.37
% 0.19/0.37 # Proof search is over...
% 0.19/0.37 # Freeing feature tree
%------------------------------------------------------------------------------