TSTP Solution File: NLP227-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP227-10 : TPTP v8.1.0. Released v7.3.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 : n028.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:07 EDT 2022
% Result : Satisfiable 4.12s 0.87s
% Output : CNFRefutation 4.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NLP227-10 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jun 30 17:36:59 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.34 # No SInE strategy applied
% 0.11/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.34 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.11/0.34 #
% 0.11/0.34 # Presaturation interreduction done
% 0.11/0.34 # Number of axioms: 94 Number of unprocessed: 94
% 0.11/0.34 # Tableaux proof search.
% 0.11/0.34 # APR header successfully linked.
% 0.11/0.34 # Hello from C++
% 0.11/0.34 # The folding up rule is enabled...
% 0.11/0.34 # Local unification is enabled...
% 0.11/0.34 # Any saturation attempts will use folding labels...
% 0.11/0.34 # 94 beginning clauses after preprocessing and clausification
% 0.11/0.34 # Creating start rules for all 19 conjectures.
% 0.11/0.34 # There are 19 start rule candidates:
% 0.11/0.34 # Found 94 unit axioms.
% 0.11/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.11/0.34 # 19 start rule tableaux created.
% 0.11/0.34 # 0 extension rule candidate clauses
% 0.11/0.34 # 94 unit axiom clauses
% 0.11/0.34
% 0.11/0.34 # Requested 8, 32 cores available to the main process.
% 3.88/0.83 # Creating equality axioms
% 3.88/0.83 # Ran out of tableaux, making start rules for all clauses
% 3.88/0.83 # 30552 Satisfiable branch
% 4.12/0.86 # Creating equality axioms
% 4.12/0.86 # Ran out of tableaux, making start rules for all clauses
% 4.12/0.86 # 30545 Satisfiable branch
% 4.12/0.87 # Satisfiable branch found.
% 4.12/0.87 # There were 1 total branch saturation attempts.
% 4.12/0.87 # There were 0 of these attempts blocked.
% 4.12/0.87 # There were 0 deferred branch saturation attempts.
% 4.12/0.87 # There were 0 free duplicated saturations.
% 4.12/0.87 # There were 0 total successful branch saturations.
% 4.12/0.87 # There were 0 successful branch saturations in interreduction.
% 4.12/0.87 # There were 0 successful branch saturations on the branch.
% 4.12/0.87 # There were 0 successful branch saturations after the branch.
% 4.12/0.87 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.12/0.87 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.12/0.87 # Begin clausification derivation
% 4.12/0.87
% 4.12/0.87 # End clausification derivation
% 4.12/0.87 # Begin listing active clauses obtained from FOF to CNF conversion
% 4.12/0.87 cnf(i_0_166, negated_conjecture, (actual_world(skc5)=true)).
% 4.12/0.87 cnf(i_0_170, negated_conjecture, (event(skc5,skc7)=true)).
% 4.12/0.87 cnf(i_0_167, negated_conjecture, (man(skc5,skc9)=true)).
% 4.12/0.87 cnf(i_0_168, negated_conjecture, (forename(skc5,skc8)=true)).
% 4.12/0.87 cnf(i_0_174, negated_conjecture, (proposition(skc5,skc6)=true)).
% 4.12/0.87 cnf(i_0_169, negated_conjecture, (vincent_forename(skc5,skc8)=true)).
% 4.12/0.87 cnf(i_0_173, negated_conjecture, (accessible_world(skc5,skc6)=true)).
% 4.12/0.87 cnf(i_0_171, negated_conjecture, (present(skc5,skc7)=true)).
% 4.12/0.87 cnf(i_0_172, negated_conjecture, (think_believe_consider(skc5,skc7)=true)).
% 4.12/0.87 cnf(i_0_95, plain, (ifeq4(X1,X1,X2,X3)=X2)).
% 4.12/0.87 cnf(i_0_175, negated_conjecture, (of(skc5,skc8,skc9)=true)).
% 4.12/0.87 cnf(i_0_176, negated_conjecture, (agent(skc5,skc7,skc9)=true)).
% 4.12/0.87 cnf(i_0_177, negated_conjecture, (theme(skc5,skc7,skc6)=true)).
% 4.12/0.87 cnf(i_0_180, negated_conjecture, (ifeq3(man(skc6,X1),true,event(skc6,skf2(X2)),true)=true)).
% 4.12/0.87 cnf(i_0_178, negated_conjecture, (ifeq3(man(skc6,X1),true,smoke(skc6,skf2(X2)),true)=true)).
% 4.12/0.87 cnf(i_0_96, plain, (ifeq3(X1,X1,X2,X3)=X2)).
% 4.12/0.87 cnf(i_0_98, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 4.12/0.87 cnf(i_0_97, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 4.12/0.87 cnf(i_0_129, plain, (ifeq4(be(X1,X2,X3,X4),true,X3,X4)=X4)).
% 4.12/0.87 cnf(i_0_99, plain, (ifeq3(state(X1,X2),true,eventuality(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_105, plain, (ifeq3(state(X1,X2),true,event(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_179, negated_conjecture, (ifeq3(man(skc6,X1),true,present(skc6,skf2(X2)),true)=true)).
% 4.12/0.87 cnf(i_0_181, negated_conjecture, (ifeq3(man(skc6,X1),true,agent(skc6,skf2(X1),X1),true)=true)).
% 4.12/0.87 cnf(i_0_125, plain, (ifeq3(jules_forename(X1,X2),true,forename(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_126, plain, (ifeq3(smoke(X1,X2),true,event(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_128, plain, (ifeq3(vincent_forename(X1,X2),true,forename(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_100, plain, (ifeq3(eventuality(X1,X2),true,thing(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_106, plain, (ifeq3(event(X1,X2),true,eventuality(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_102, plain, (ifeq3(eventuality(X1,X2),true,specific(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_103, plain, (ifeq3(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_104, plain, (ifeq3(eventuality(X1,X2),true,unisex(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_101, plain, (ifeq3(thing(X1,X2),true,singleton(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_107, plain, (ifeq3(man(X1,X2),true,human_person(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_117, plain, (ifeq3(man(X1,X2),true,male(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_118, plain, (ifeq3(forename(X1,X2),true,relname(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_127, plain, (ifeq3(proposition(X1,X2),true,relation(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_108, plain, (ifeq3(human_person(X1,X2),true,organism(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_115, plain, (ifeq3(human_person(X1,X2),true,human(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_116, plain, (ifeq3(human_person(X1,X2),true,animate(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_109, plain, (ifeq3(organism(X1,X2),true,entity(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_113, plain, (ifeq3(organism(X1,X2),true,impartial(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_114, plain, (ifeq3(organism(X1,X2),true,living(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_110, plain, (ifeq3(entity(X1,X2),true,thing(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_111, plain, (ifeq3(entity(X1,X2),true,specific(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_112, plain, (ifeq3(entity(X1,X2),true,existent(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_119, plain, (ifeq3(relname(X1,X2),true,relation(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_120, plain, (ifeq3(relation(X1,X2),true,abstraction(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_121, plain, (ifeq3(abstraction(X1,X2),true,thing(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_124, plain, (ifeq3(abstraction(X1,X2),true,unisex(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_122, plain, (ifeq3(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_123, plain, (ifeq3(abstraction(X1,X2),true,general(X1,X2),true)=true)).
% 4.12/0.87 cnf(i_0_184, plain, (ifeq2(tuple2(specific(X1,X2),general(X1,X2)),tuple2(true,true),a,b)=b)).
% 4.12/0.87 cnf(i_0_186, plain, (ifeq2(tuple2(nonexistent(X1,X2),existent(X1,X2)),tuple2(true,true),a,b)=b)).
% 4.12/0.87 cnf(i_0_183, plain, (ifeq2(tuple2(unisex(X1,X2),male(X1,X2)),tuple2(true,true),a,b)=b)).
% 4.12/0.87 cnf(i_0_130, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(state(X1,X3),true,state(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_137, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(event(X1,X3),true,event(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_138, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(man(X1,X3),true,man(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_148, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(forename(X1,X3),true,forename(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_154, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(jules_forename(X1,X3),true,jules_forename(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_185, plain, (ifeq2(tuple2(human(X1,X2),nonhuman(X1,X2)),tuple2(true,true),a,b)=b)).
% 4.12/0.87 cnf(i_0_155, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(smoke(X1,X3),true,smoke(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_131, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(eventuality(X1,X3),true,eventuality(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_132, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(thing(X1,X3),true,thing(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_133, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(singleton(X1,X3),true,singleton(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_134, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(specific(X1,X3),true,specific(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_158, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(proposition(X1,X3),true,proposition(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_159, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(vincent_forename(X1,X3),true,vincent_forename(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_156, plain, (ifeq3(present(X1,X2),true,ifeq3(accessible_world(X1,X3),true,present(X3,X2),true),true)=true)).
% 4.12/0.87 cnf(i_0_157, plain, (ifeq3(think_believe_consider(X1,X2),true,ifeq3(accessible_world(X1,X3),true,think_believe_consider(X3,X2),true),true)=true)).
% 4.12/0.87 cnf(i_0_135, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(nonexistent(X1,X3),true,nonexistent(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_136, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(unisex(X1,X3),true,unisex(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_139, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(human_person(X1,X3),true,human_person(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_140, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(organism(X1,X3),true,organism(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_141, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(entity(X1,X3),true,entity(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_142, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(existent(X1,X3),true,existent(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_143, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(impartial(X1,X3),true,impartial(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_144, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(living(X1,X3),true,living(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_145, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(human(X1,X3),true,human(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_146, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(animate(X1,X3),true,animate(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_147, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(male(X1,X3),true,male(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_149, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(relname(X1,X3),true,relname(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_150, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(relation(X1,X3),true,relation(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_151, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(abstraction(X1,X3),true,abstraction(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_152, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(nonhuman(X1,X3),true,nonhuman(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_153, plain, (ifeq3(accessible_world(X1,X2),true,ifeq3(general(X1,X3),true,general(X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_160, plain, (ifeq3(of(X1,X2,X3),true,ifeq3(accessible_world(X1,X4),true,of(X4,X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_161, plain, (ifeq3(agent(X1,X2,X3),true,ifeq3(accessible_world(X1,X4),true,agent(X4,X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_162, plain, (ifeq3(theme(X1,X2,X3),true,ifeq3(accessible_world(X1,X4),true,theme(X4,X2,X3),true),true)=true)).
% 4.12/0.87 cnf(i_0_163, plain, (ifeq3(be(X1,X2,X3,X4),true,ifeq3(accessible_world(X1,X5),true,be(X5,X2,X3,X4),true),true)=true)).
% 4.12/0.87 cnf(i_0_164, plain, (ifeq4(of(X1,X2,X3),true,ifeq4(of(X1,X4,X3),true,ifeq4(forename(X1,X2),true,ifeq4(forename(X1,X4),true,ifeq4(entity(X1,X3),true,X2,X4),X4),X4),X4),X4)=X4)).
% 4.12/0.87 cnf(i_0_165, plain, (ifeq4(theme(X1,X2,X3),true,ifeq4(theme(X1,X4,X5),true,ifeq4(agent(X1,X2,X6),true,ifeq4(agent(X1,X4,X6),true,ifeq4(think_believe_consider(X1,X2),true,ifeq4(think_believe_consider(X1,X4),true,ifeq4(proposition(X1,X3),true,ifeq4(proposition(X1,X5),true,X5,X3),X3),X3),X3),X3),X3),X3),X3)=X3)).
% 4.12/0.87 cnf(i_0_182, negated_conjecture, (ifeq3(actual_world(X1),true,ifeq3(be(X1,X2,X3,X4),true,ifeq3(theme(X1,X5,X6),true,ifeq3(agent(X1,X5,X7),true,ifeq3(of(X1,X8,X3),true,ifeq3(of(X1,X9,X7),true,ifeq3(think_believe_consider(X1,X5),true,ifeq3(present(X1,X5),true,ifeq3(accessible_world(X1,X6),true,ifeq3(vincent_forename(X1,X9),true,ifeq3(proposition(X1,X6),true,ifeq3(jules_forename(X1,X8),true,ifeq3(forename(X1,X8),true,ifeq3(forename(X1,X9),true,ifeq3(man(X1,X3),true,ifeq3(man(X1,X4),true,ifeq3(man(X1,X7),true,ifeq3(event(X1,X5),true,ifeq3(state(X1,X2),true,man(X6,skf4(X6)),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true),true)=true)).
% 4.12/0.87 cnf(i_0_187, negated_conjecture, (ifeq(tuple(state(X1,X2),event(X1,X3),event(X4,X5),man(X1,X6),man(X1,X7),man(X1,X8),forename(X1,X9),forename(X1,X10),jules_forename(X1,X10),smoke(X4,X5),proposition(X1,X4),vincent_forename(X1,X9),accessible_world(X1,X4),present(X1,X3),present(X4,X5),think_believe_consider(X1,X3),of(X1,X9,X6),of(X1,X10,X8),agent(X1,X3,X6),agent(X4,X5,skf4(X4)),theme(X1,X3,X4),be(X1,X2,X8,X7),actual_world(X1)),tuple(true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true),a,b)=b)).
% 4.12/0.87 cnf(i_0_188, negated_conjecture, (a!=b)).
% 4.12/0.87 cnf(i_0_208, plain, (X11=X11)).
% 4.12/0.87 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 4.12/0.87 # Begin printing tableau
% 4.12/0.87 # Found 7 steps
% 4.12/0.87 cnf(i_0_208, plain, (true=true), inference(start_rule)).
% 4.12/0.87 cnf(i_0_350, plain, (true=true), inference(extension_rule, [i_0_212])).
% 4.12/0.87 cnf(i_0_360, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_166])).
% 4.12/0.87 cnf(i_0_361, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_166])).
% 4.12/0.87 cnf(i_0_362, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_166])).
% 4.12/0.87 cnf(i_0_358, plain, (ifeq4(true,actual_world(skc5),actual_world(skc5),actual_world(skc5))=ifeq4(true,true,true,true)), inference(extension_rule, [i_0_211])).
% 4.12/0.87 cnf(i_0_369, plain, (ifeq4(true,true,true,true)!=true), inference(closure_rule, [i_0_95])).
% 4.12/0.87 # End printing tableau
% 4.12/0.87 # SZS output end
% 4.12/0.87 # Branches closed with saturation will be marked with an "s"
% 4.12/0.87 # Creating equality axioms
% 4.12/0.87 # Ran out of tableaux, making start rules for all clauses
% 4.12/0.87 # 30551 Satisfiable branch
% 4.12/0.88 # Child (30552) has found a proof.
% 4.12/0.88
% 4.12/0.88 # Proof search is over...
% 4.12/0.88 # Freeing feature tree
%------------------------------------------------------------------------------