TSTP Solution File: NLP222-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP222-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 : n011.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:14:02 EDT 2022
% Result : Satisfiable 0.19s 0.39s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NLP222-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 : n011.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 12:13:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.36 # No SInE strategy applied
% 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.36 #
% 0.19/0.36 # Presaturation interreduction done
% 0.19/0.36 # Number of axioms: 49 Number of unprocessed: 49
% 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.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 49 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 49 conjectures.
% 0.19/0.37 # There are 49 start rule candidates:
% 0.19/0.37 # Found 2 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 49 start rule tableaux created.
% 0.19/0.37 # 47 extension rule candidate clauses
% 0.19/0.37 # 2 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.39 # 28301 Satisfiable branch
% 0.19/0.39 # Satisfiable branch found.
% 0.19/0.39 # There were 1 total branch saturation attempts.
% 0.19/0.39 # There were 0 of these attempts blocked.
% 0.19/0.39 # There were 0 deferred branch saturation attempts.
% 0.19/0.39 # There were 0 free duplicated saturations.
% 0.19/0.39 # There were 0 total successful branch saturations.
% 0.19/0.39 # There were 0 successful branch saturations in interreduction.
% 0.19/0.39 # There were 0 successful branch saturations on the branch.
% 0.19/0.39 # There were 0 successful branch saturations after the branch.
% 0.19/0.39 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 # Begin clausification derivation
% 0.19/0.39
% 0.19/0.39 # End clausification derivation
% 0.19/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.39 cnf(i_0_50, negated_conjecture, (actual_world(skc29))).
% 0.19/0.39 cnf(i_0_51, negated_conjecture, (actual_world(skc17))).
% 0.19/0.39 cnf(i_0_64, negated_conjecture, (proposition(skc17,skc22)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_65, negated_conjecture, (accessible_world(skc17,skc22)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_66, negated_conjecture, (think_believe_consider(skc17,skc23)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_52, negated_conjecture, (proposition(skc29,skc33)|ssSkC0)).
% 0.19/0.39 cnf(i_0_53, negated_conjecture, (accessible_world(skc29,skc33)|ssSkC0)).
% 0.19/0.39 cnf(i_0_67, negated_conjecture, (present(skc17,skc23)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_68, negated_conjecture, (event(skc17,skc23)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_69, negated_conjecture, (vincent_forename(skc17,skc24)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_70, negated_conjecture, (forename(skc17,skc24)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_54, negated_conjecture, (think_believe_consider(skc29,skc34)|ssSkC0)).
% 0.19/0.39 cnf(i_0_75, negated_conjecture, (forename(skc17,skc20)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_71, negated_conjecture, (man(skc17,skc25)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_73, negated_conjecture, (man(skc17,skc19)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_76, negated_conjecture, (man(skc17,skc21)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_55, negated_conjecture, (present(skc29,skc34)|ssSkC0)).
% 0.19/0.39 cnf(i_0_56, negated_conjecture, (event(skc29,skc34)|ssSkC0)).
% 0.19/0.39 cnf(i_0_72, negated_conjecture, (state(skc17,skc18)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_74, negated_conjecture, (jules_forename(skc17,skc20)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_57, negated_conjecture, (vincent_forename(skc29,skc35)|ssSkC0)).
% 0.19/0.39 cnf(i_0_58, negated_conjecture, (forename(skc29,skc35)|ssSkC0)).
% 0.19/0.39 cnf(i_0_62, negated_conjecture, (forename(skc29,skc32)|ssSkC0)).
% 0.19/0.39 cnf(i_0_59, negated_conjecture, (man(skc29,skc36)|ssSkC0)).
% 0.19/0.39 cnf(i_0_61, negated_conjecture, (man(skc29,skc31)|ssSkC0)).
% 0.19/0.39 cnf(i_0_60, negated_conjecture, (state(skc29,skc30)|ssSkC0)).
% 0.19/0.39 cnf(i_0_63, negated_conjecture, (jules_forename(skc29,skc32)|ssSkC0)).
% 0.19/0.39 cnf(i_0_88, negated_conjecture, (present(skc33,skf9(X1))|ssSkC0|~man(skc33,X2))).
% 0.19/0.39 cnf(i_0_77, negated_conjecture, (theme(skc29,skc34,skc33)|ssSkC0)).
% 0.19/0.39 cnf(i_0_81, negated_conjecture, (theme(skc17,skc23,skc22)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_82, negated_conjecture, (agent(skc17,skc23,skc25)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_83, negated_conjecture, (of(skc17,skc24,skc25)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_84, negated_conjecture, (of(skc17,skc20,skc21)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_78, negated_conjecture, (agent(skc29,skc34,skc36)|ssSkC0)).
% 0.19/0.39 cnf(i_0_79, negated_conjecture, (of(skc29,skc35,skc36)|ssSkC0)).
% 0.19/0.39 cnf(i_0_80, negated_conjecture, (of(skc29,skc32,skc31)|ssSkC0)).
% 0.19/0.39 cnf(i_0_86, negated_conjecture, (be(skc17,skc18,skc21,skc19)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_85, negated_conjecture, (be(skc29,skc30,skc31,skc31)|ssSkC0)).
% 0.19/0.39 cnf(i_0_87, negated_conjecture, (event(skc33,skf9(X1))|ssSkC0|~man(skc33,X2))).
% 0.19/0.39 cnf(i_0_89, negated_conjecture, (smoke(skc33,skf9(X1))|ssSkC0|~man(skc33,X2))).
% 0.19/0.39 cnf(i_0_91, negated_conjecture, (present(skc22,skf5(X1))|~man(skc22,X2)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_90, negated_conjecture, (event(skc22,skf5(X1))|~man(skc22,X2)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_92, negated_conjecture, (smoke(skc22,skf5(X1))|~man(skc22,X2)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_94, negated_conjecture, (agent(skc22,skf5(X1),X1)|~man(skc22,X1)|~ssSkC0)).
% 0.19/0.39 cnf(i_0_93, negated_conjecture, (agent(skc33,skf9(X1),X1)|ssSkC0|~man(skc33,X1))).
% 0.19/0.39 cnf(i_0_95, negated_conjecture, (man(X1,skf7(X1))|~be(X2,X3,X4,X4)|~of(X2,X5,X4)|~of(X2,X6,X7)|~agent(X2,X8,X7)|~theme(X2,X8,X1)|~jules_forename(X2,X5)|~state(X2,X3)|~man(X2,X4)|~man(X2,X7)|~forename(X2,X5)|~forename(X2,X6)|~vincent_forename(X2,X6)|~event(X2,X8)|~present(X2,X8)|~think_believe_consider(X2,X8)|~accessible_world(X2,X1)|~proposition(X2,X1)|~ssSkC0|~actual_world(X2))).
% 0.19/0.39 cnf(i_0_96, negated_conjecture, (man(X1,skf11(X1))|ssSkC0|~be(X2,X3,X4,X5)|~of(X2,X6,X4)|~of(X2,X7,X8)|~agent(X2,X9,X8)|~theme(X2,X9,X1)|~jules_forename(X2,X6)|~state(X2,X3)|~man(X2,X4)|~man(X2,X5)|~man(X2,X8)|~forename(X2,X6)|~forename(X2,X7)|~vincent_forename(X2,X7)|~event(X2,X9)|~present(X2,X9)|~think_believe_consider(X2,X9)|~accessible_world(X2,X1)|~proposition(X2,X1)|~actual_world(X2))).
% 0.19/0.39 cnf(i_0_97, negated_conjecture, (~smoke(X1,X2)|~be(X3,X4,X5,X5)|~of(X3,X6,X5)|~of(X3,X7,X8)|~agent(X1,X2,skf7(X1))|~agent(X3,X9,X8)|~theme(X3,X9,X1)|~jules_forename(X3,X6)|~state(X3,X4)|~man(X3,X5)|~man(X3,X8)|~forename(X3,X6)|~forename(X3,X7)|~vincent_forename(X3,X7)|~event(X1,X2)|~event(X3,X9)|~present(X1,X2)|~present(X3,X9)|~think_believe_consider(X3,X9)|~accessible_world(X3,X1)|~proposition(X3,X1)|~ssSkC0|~actual_world(X3))).
% 0.19/0.39 cnf(i_0_98, negated_conjecture, (ssSkC0|~smoke(X1,X2)|~be(X3,X4,X5,X6)|~of(X3,X7,X5)|~of(X3,X8,X9)|~agent(X1,X2,skf11(X1))|~agent(X3,X10,X9)|~theme(X3,X10,X1)|~jules_forename(X3,X7)|~state(X3,X4)|~man(X3,X5)|~man(X3,X6)|~man(X3,X9)|~forename(X3,X7)|~forename(X3,X8)|~vincent_forename(X3,X8)|~event(X1,X2)|~event(X3,X10)|~present(X1,X2)|~present(X3,X10)|~think_believe_consider(X3,X10)|~accessible_world(X3,X1)|~proposition(X3,X1)|~actual_world(X3))).
% 0.19/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.39 # Begin printing tableau
% 0.19/0.39 # Found 3 steps
% 0.19/0.39 cnf(i_0_51, negated_conjecture, (actual_world(skc17)), inference(start_rule)).
% 0.19/0.39 cnf(i_0_3402, plain, (actual_world(skc17)), inference(extension_rule, [i_0_98])).
% 0.19/0.39 cnf(i_0_4592, plain, (ssSkC0), inference(extension_rule, [i_0_92])).
% 0.19/0.39 # End printing tableau
% 0.19/0.39 # SZS output end
% 0.19/0.39 # Branches closed with saturation will be marked with an "s"
% 0.19/0.39 # Child (28301) has found a proof.
% 0.19/0.39
% 0.19/0.39 # Proof search is over...
% 0.19/0.39 # Freeing feature tree
%------------------------------------------------------------------------------