TSTP Solution File: NLP229-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP229-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 : n016.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:09 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.12 % Problem : NLP229-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 : n016.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 08:47:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 89 Number of unprocessed: 89
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # 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 # 89 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 18 conjectures.
% 0.19/0.37 # There are 18 start rule candidates:
% 0.19/0.37 # Found 12 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 18 start rule tableaux created.
% 0.19/0.37 # 77 extension rule candidate clauses
% 0.19/0.37 # 12 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.39 # 30958 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/sandbox/benchmark/theBenchmark.p
% 0.19/0.39 # SZS output start for /export/starexec/sandbox/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_161, negated_conjecture, (actual_world(skc5))).
% 0.19/0.39 cnf(i_0_165, negated_conjecture, (event(skc5,skc7))).
% 0.19/0.39 cnf(i_0_162, negated_conjecture, (man(skc5,skc9))).
% 0.19/0.39 cnf(i_0_163, negated_conjecture, (forename(skc5,skc8))).
% 0.19/0.39 cnf(i_0_169, negated_conjecture, (proposition(skc5,skc6))).
% 0.19/0.39 cnf(i_0_164, negated_conjecture, (vincent_forename(skc5,skc8))).
% 0.19/0.39 cnf(i_0_168, negated_conjecture, (accessible_world(skc5,skc6))).
% 0.19/0.39 cnf(i_0_166, negated_conjecture, (present(skc5,skc7))).
% 0.19/0.39 cnf(i_0_167, negated_conjecture, (think_believe_consider(skc5,skc7))).
% 0.19/0.39 cnf(i_0_170, negated_conjecture, (of(skc5,skc8,skc9))).
% 0.19/0.39 cnf(i_0_171, negated_conjecture, (agent(skc5,skc7,skc9))).
% 0.19/0.39 cnf(i_0_172, negated_conjecture, (theme(skc5,skc7,skc6))).
% 0.19/0.39 cnf(i_0_121, plain, (~general(X1,X2)|~specific(X1,X2))).
% 0.19/0.39 cnf(i_0_123, plain, (~existent(X1,X2)|~nonexistent(X1,X2))).
% 0.19/0.39 cnf(i_0_120, plain, (~male(X1,X2)|~unisex(X1,X2))).
% 0.19/0.39 cnf(i_0_122, plain, (~nonhuman(X1,X2)|~human(X1,X2))).
% 0.19/0.39 cnf(i_0_90, plain, (eventuality(X1,X2)|~state(X1,X2))).
% 0.19/0.39 cnf(i_0_96, plain, (event(X1,X2)|~state(X1,X2))).
% 0.19/0.39 cnf(i_0_117, plain, (event(X1,X2)|~smoke(X1,X2))).
% 0.19/0.39 cnf(i_0_100, plain, (entity(X1,X2)|~organism(X1,X2))).
% 0.19/0.39 cnf(i_0_116, plain, (forename(X1,X2)|~jules_forename(X1,X2))).
% 0.19/0.39 cnf(i_0_119, plain, (forename(X1,X2)|~vincent_forename(X1,X2))).
% 0.19/0.39 cnf(i_0_175, negated_conjecture, (event(skc6,skf2(X1))|~man(skc6,X2))).
% 0.19/0.39 cnf(i_0_173, negated_conjecture, (smoke(skc6,skf2(X1))|~man(skc6,X2))).
% 0.19/0.39 cnf(i_0_174, negated_conjecture, (present(skc6,skf2(X1))|~man(skc6,X2))).
% 0.19/0.39 cnf(i_0_176, negated_conjecture, (agent(skc6,skf2(X1),X1)|~man(skc6,X1))).
% 0.19/0.39 cnf(i_0_97, plain, (eventuality(X1,X2)|~event(X1,X2))).
% 0.19/0.39 cnf(i_0_91, plain, (thing(X1,X2)|~eventuality(X1,X2))).
% 0.19/0.39 cnf(i_0_98, plain, (human_person(X1,X2)|~man(X1,X2))).
% 0.19/0.39 cnf(i_0_110, plain, (relation(X1,X2)|~relname(X1,X2))).
% 0.19/0.39 cnf(i_0_111, plain, (abstraction(X1,X2)|~relation(X1,X2))).
% 0.19/0.39 cnf(i_0_124, plain, (X1=X2|~be(X3,X4,X1,X2))).
% 0.19/0.39 cnf(i_0_101, plain, (thing(X1,X2)|~entity(X1,X2))).
% 0.19/0.39 cnf(i_0_108, plain, (male(X1,X2)|~man(X1,X2))).
% 0.19/0.39 cnf(i_0_109, plain, (relname(X1,X2)|~forename(X1,X2))).
% 0.19/0.39 cnf(i_0_118, plain, (relation(X1,X2)|~proposition(X1,X2))).
% 0.19/0.39 cnf(i_0_112, plain, (thing(X1,X2)|~abstraction(X1,X2))).
% 0.19/0.39 cnf(i_0_92, plain, (singleton(X1,X2)|~thing(X1,X2))).
% 0.19/0.39 cnf(i_0_93, plain, (specific(X1,X2)|~eventuality(X1,X2))).
% 0.19/0.39 cnf(i_0_102, plain, (specific(X1,X2)|~entity(X1,X2))).
% 0.19/0.39 cnf(i_0_94, plain, (nonexistent(X1,X2)|~eventuality(X1,X2))).
% 0.19/0.39 cnf(i_0_95, plain, (unisex(X1,X2)|~eventuality(X1,X2))).
% 0.19/0.39 cnf(i_0_115, plain, (unisex(X1,X2)|~abstraction(X1,X2))).
% 0.19/0.39 cnf(i_0_99, plain, (organism(X1,X2)|~human_person(X1,X2))).
% 0.19/0.39 cnf(i_0_103, plain, (existent(X1,X2)|~entity(X1,X2))).
% 0.19/0.39 cnf(i_0_104, plain, (impartial(X1,X2)|~organism(X1,X2))).
% 0.19/0.39 cnf(i_0_105, plain, (living(X1,X2)|~organism(X1,X2))).
% 0.19/0.39 cnf(i_0_106, plain, (human(X1,X2)|~human_person(X1,X2))).
% 0.19/0.39 cnf(i_0_107, plain, (animate(X1,X2)|~human_person(X1,X2))).
% 0.19/0.39 cnf(i_0_113, plain, (nonhuman(X1,X2)|~abstraction(X1,X2))).
% 0.19/0.39 cnf(i_0_114, plain, (general(X1,X2)|~abstraction(X1,X2))).
% 0.19/0.39 cnf(i_0_125, plain, (state(X1,X2)|~accessible_world(X3,X1)|~state(X3,X2))).
% 0.19/0.39 cnf(i_0_126, plain, (eventuality(X1,X2)|~accessible_world(X3,X1)|~eventuality(X3,X2))).
% 0.19/0.39 cnf(i_0_127, plain, (thing(X1,X2)|~accessible_world(X3,X1)|~thing(X3,X2))).
% 0.19/0.39 cnf(i_0_128, plain, (singleton(X1,X2)|~accessible_world(X3,X1)|~singleton(X3,X2))).
% 0.19/0.39 cnf(i_0_132, plain, (event(X1,X2)|~accessible_world(X3,X1)|~event(X3,X2))).
% 0.19/0.39 cnf(i_0_133, plain, (man(X1,X2)|~accessible_world(X3,X1)|~man(X3,X2))).
% 0.19/0.39 cnf(i_0_143, plain, (forename(X1,X2)|~accessible_world(X3,X1)|~forename(X3,X2))).
% 0.19/0.39 cnf(i_0_149, plain, (jules_forename(X1,X2)|~accessible_world(X3,X1)|~jules_forename(X3,X2))).
% 0.19/0.39 cnf(i_0_150, plain, (smoke(X1,X2)|~accessible_world(X3,X1)|~smoke(X3,X2))).
% 0.19/0.39 cnf(i_0_129, plain, (specific(X1,X2)|~accessible_world(X3,X1)|~specific(X3,X2))).
% 0.19/0.39 cnf(i_0_153, plain, (proposition(X1,X2)|~accessible_world(X3,X1)|~proposition(X3,X2))).
% 0.19/0.39 cnf(i_0_130, plain, (nonexistent(X1,X2)|~accessible_world(X3,X1)|~nonexistent(X3,X2))).
% 0.19/0.39 cnf(i_0_131, plain, (unisex(X1,X2)|~accessible_world(X3,X1)|~unisex(X3,X2))).
% 0.19/0.39 cnf(i_0_134, plain, (human_person(X1,X2)|~accessible_world(X3,X1)|~human_person(X3,X2))).
% 0.19/0.39 cnf(i_0_135, plain, (organism(X1,X2)|~accessible_world(X3,X1)|~organism(X3,X2))).
% 0.19/0.39 cnf(i_0_154, plain, (vincent_forename(X1,X2)|~accessible_world(X3,X1)|~vincent_forename(X3,X2))).
% 0.19/0.39 cnf(i_0_151, plain, (present(X1,X2)|~present(X3,X2)|~accessible_world(X3,X1))).
% 0.19/0.39 cnf(i_0_152, plain, (think_believe_consider(X1,X2)|~think_believe_consider(X3,X2)|~accessible_world(X3,X1))).
% 0.19/0.39 cnf(i_0_136, plain, (entity(X1,X2)|~accessible_world(X3,X1)|~entity(X3,X2))).
% 0.19/0.39 cnf(i_0_137, plain, (existent(X1,X2)|~accessible_world(X3,X1)|~existent(X3,X2))).
% 0.19/0.39 cnf(i_0_138, plain, (impartial(X1,X2)|~accessible_world(X3,X1)|~impartial(X3,X2))).
% 0.19/0.39 cnf(i_0_139, plain, (living(X1,X2)|~accessible_world(X3,X1)|~living(X3,X2))).
% 0.19/0.39 cnf(i_0_140, plain, (human(X1,X2)|~accessible_world(X3,X1)|~human(X3,X2))).
% 0.19/0.39 cnf(i_0_141, plain, (animate(X1,X2)|~accessible_world(X3,X1)|~animate(X3,X2))).
% 0.19/0.39 cnf(i_0_142, plain, (male(X1,X2)|~accessible_world(X3,X1)|~male(X3,X2))).
% 0.19/0.39 cnf(i_0_144, plain, (relname(X1,X2)|~accessible_world(X3,X1)|~relname(X3,X2))).
% 0.19/0.39 cnf(i_0_145, plain, (relation(X1,X2)|~accessible_world(X3,X1)|~relation(X3,X2))).
% 0.19/0.39 cnf(i_0_146, plain, (abstraction(X1,X2)|~accessible_world(X3,X1)|~abstraction(X3,X2))).
% 0.19/0.39 cnf(i_0_147, plain, (nonhuman(X1,X2)|~accessible_world(X3,X1)|~nonhuman(X3,X2))).
% 0.19/0.39 cnf(i_0_148, plain, (general(X1,X2)|~accessible_world(X3,X1)|~general(X3,X2))).
% 0.19/0.39 cnf(i_0_155, plain, (of(X1,X2,X3)|~of(X4,X2,X3)|~accessible_world(X4,X1))).
% 0.19/0.39 cnf(i_0_156, plain, (agent(X1,X2,X3)|~agent(X4,X2,X3)|~accessible_world(X4,X1))).
% 0.19/0.39 cnf(i_0_157, plain, (theme(X1,X2,X3)|~theme(X4,X2,X3)|~accessible_world(X4,X1))).
% 0.19/0.39 cnf(i_0_158, plain, (be(X1,X2,X3,X4)|~accessible_world(X5,X1)|~be(X5,X2,X3,X4))).
% 0.19/0.39 cnf(i_0_159, plain, (X1=X2|~of(X3,X2,X4)|~of(X3,X1,X4)|~forename(X3,X2)|~forename(X3,X1)|~entity(X3,X4))).
% 0.19/0.39 cnf(i_0_160, plain, (X1=X2|~theme(X3,X4,X2)|~theme(X3,X5,X1)|~agent(X3,X4,X6)|~agent(X3,X5,X6)|~think_believe_consider(X3,X4)|~think_believe_consider(X3,X5)|~proposition(X3,X2)|~proposition(X3,X1))).
% 0.19/0.39 cnf(i_0_177, negated_conjecture, (man(X1,skf4(X1))|~actual_world(X2)|~theme(X2,X3,X1)|~agent(X2,X3,X4)|~of(X2,X5,X6)|~of(X2,X7,X4)|~think_believe_consider(X2,X3)|~present(X2,X3)|~accessible_world(X2,X1)|~be(X2,X8,X6,X6)|~vincent_forename(X2,X7)|~proposition(X2,X1)|~jules_forename(X2,X5)|~man(X2,X6)|~man(X2,X4)|~event(X2,X3)|~state(X2,X8))).
% 0.19/0.39 cnf(i_0_178, negated_conjecture, (~actual_world(X1)|~theme(X1,X2,X3)|~agent(X3,X4,skf4(X3))|~agent(X1,X2,X5)|~of(X1,X6,X7)|~of(X1,X8,X5)|~think_believe_consider(X1,X2)|~present(X3,X4)|~present(X1,X2)|~accessible_world(X1,X3)|~be(X1,X9,X7,X7)|~vincent_forename(X1,X8)|~proposition(X1,X3)|~smoke(X3,X4)|~jules_forename(X1,X6)|~man(X1,X7)|~man(X1,X5)|~event(X1,X2)|~state(X1,X9))).
% 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 5 steps
% 0.19/0.39 cnf(i_0_172, negated_conjecture, (theme(skc5,skc7,skc6)), inference(start_rule)).
% 0.19/0.39 cnf(i_0_223, plain, (theme(skc5,skc7,skc6)), inference(extension_rule, [i_0_157])).
% 0.19/0.39 cnf(i_0_403, plain, (~accessible_world(skc5,skc6)), inference(closure_rule, [i_0_168])).
% 0.19/0.39 cnf(i_0_401, plain, (theme(skc6,skc7,skc6)), inference(extension_rule, [i_0_160])).
% 0.19/0.39 cnf(i_0_581, plain, (~theme(skc6,skc7,skc6)), inference(closure_rule, [i_0_401])).
% 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 (30958) has found a proof.
% 0.19/0.39
% 0.19/0.39 # Proof search is over...
% 0.19/0.39 # Freeing feature tree
%------------------------------------------------------------------------------