TSTP Solution File: NLP017-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP017-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 : n026.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:11:37 EDT 2022
% Result : Satisfiable 0.19s 0.38s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP017-10 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jul 1 05:08:49 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 78 Number of unprocessed: 78
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 78 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 27 conjectures.
% 0.13/0.37 # There are 27 start rule candidates:
% 0.13/0.37 # Found 78 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 27 start rule tableaux created.
% 0.13/0.37 # 0 extension rule candidate clauses
% 0.13/0.37 # 78 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.38 # Creating equality axioms
% 0.19/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.38 # 12456 Satisfiable branch
% 0.19/0.38 # Satisfiable branch found.
% 0.19/0.38 # There were 1 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 0 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 0 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_121, negated_conjecture, (event(skc12)=true)).
% 0.19/0.38 cnf(i_0_131, negated_conjecture, (man(skc8)=true)).
% 0.19/0.38 cnf(i_0_134, negated_conjecture, (man(skc7)=true)).
% 0.19/0.38 cnf(i_0_120, negated_conjecture, (city(skc13)=true)).
% 0.19/0.38 cnf(i_0_119, negated_conjecture, (hollywood(skc13)=true)).
% 0.19/0.38 cnf(i_0_123, negated_conjecture, (car(skc11)=true)).
% 0.19/0.38 cnf(i_0_122, negated_conjecture, (chevy(skc11)=true)).
% 0.19/0.38 cnf(i_0_137, negated_conjecture, (way(skc10)=true)).
% 0.19/0.38 cnf(i_0_138, negated_conjecture, (street(skc10)=true)).
% 0.19/0.38 cnf(i_0_128, negated_conjecture, (furniture(skc9)=true)).
% 0.19/0.38 cnf(i_0_127, negated_conjecture, (seat(skc9)=true)).
% 0.19/0.38 cnf(i_0_129, negated_conjecture, (front(skc9)=true)).
% 0.19/0.38 cnf(i_0_132, negated_conjecture, (fellow(skc8)=true)).
% 0.19/0.38 cnf(i_0_133, negated_conjecture, (fellow(skc7)=true)).
% 0.19/0.38 cnf(i_0_124, negated_conjecture, (white(skc11)=true)).
% 0.19/0.38 cnf(i_0_125, negated_conjecture, (dirty(skc11)=true)).
% 0.19/0.38 cnf(i_0_126, negated_conjecture, (old(skc11)=true)).
% 0.19/0.38 cnf(i_0_130, negated_conjecture, (young(skc8)=true)).
% 0.19/0.38 cnf(i_0_135, negated_conjecture, (young(skc7)=true)).
% 0.19/0.38 cnf(i_0_136, negated_conjecture, (lonely(skc10)=true)).
% 0.19/0.38 cnf(i_0_139, negated_conjecture, (in(skc12,skc13)=true)).
% 0.19/0.38 cnf(i_0_142, negated_conjecture, (in(skc8,skc9)=true)).
% 0.19/0.38 cnf(i_0_143, negated_conjecture, (in(skc7,skc9)=true)).
% 0.19/0.38 cnf(i_0_140, negated_conjecture, (down(skc12,skc10)=true)).
% 0.19/0.38 cnf(i_0_141, negated_conjecture, (barrel(skc12,skc11)=true)).
% 0.19/0.38 cnf(i_0_155, negated_conjecture, (ifeq4(skc8,skc7,a,b)=b)).
% 0.19/0.38 cnf(i_0_83, plain, (event(skf1(X1,X2))=true)).
% 0.19/0.38 cnf(i_0_79, plain, (ifeq4(X1,X1,X2,X3)=X2)).
% 0.19/0.38 cnf(i_0_80, plain, (ifeq3(X1,X1,X2,X3)=X2)).
% 0.19/0.38 cnf(i_0_81, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.19/0.38 cnf(i_0_82, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.19/0.38 cnf(i_0_95, plain, (ifeq2(event(X1),true,eventuality(X1),true)=true)).
% 0.19/0.38 cnf(i_0_94, plain, (ifeq2(hollywood(X1),true,city(X1),true)=true)).
% 0.19/0.38 cnf(i_0_101, plain, (ifeq2(chevy(X1),true,car(X1),true)=true)).
% 0.19/0.38 cnf(i_0_103, plain, (ifeq2(street(X1),true,way(X1),true)=true)).
% 0.19/0.38 cnf(i_0_105, plain, (ifeq2(seat(X1),true,furniture(X1),true)=true)).
% 0.19/0.38 cnf(i_0_110, plain, (ifeq2(fellow(X1),true,man(X1),true)=true)).
% 0.19/0.38 cnf(i_0_84, plain, (ifeq2(nonhuman(X1),true,entity(X1),true)=true)).
% 0.19/0.38 cnf(i_0_109, plain, (ifeq2(man(X1),true,human(X1),true)=true)).
% 0.19/0.38 cnf(i_0_85, plain, (ifeq2(drs(X1),true,proposition(X1),true)=true)).
% 0.19/0.38 cnf(i_0_86, plain, (ifeq2(proposition(X1),true,drs(X1),true)=true)).
% 0.19/0.38 cnf(i_0_87, plain, (ifeq2(woman(X1),true,female(X1),true)=true)).
% 0.19/0.38 cnf(i_0_88, plain, (ifeq2(female(X1),true,human(X1),true)=true)).
% 0.19/0.38 cnf(i_0_90, plain, (ifeq2(man(X1),true,male(X1),true)=true)).
% 0.19/0.38 cnf(i_0_93, plain, (ifeq2(city(X1),true,location(X1),true)=true)).
% 0.19/0.38 cnf(i_0_100, plain, (ifeq2(car(X1),true,vehicle(X1),true)=true)).
% 0.19/0.38 cnf(i_0_102, plain, (ifeq2(way(X1),true,artifact(X1),true)=true)).
% 0.19/0.38 cnf(i_0_104, plain, (ifeq2(furniture(X1),true,instrumentality(X1),true)=true)).
% 0.19/0.38 cnf(i_0_108, plain, (ifeq2(human(X1),true,organism(X1),true)=true)).
% 0.19/0.38 cnf(i_0_106, plain, (ifeq2(front(X1),true,nonhuman(X1),true)=true)).
% 0.19/0.38 cnf(i_0_89, plain, (ifeq2(male(X1),true,human(X1),true)=true)).
% 0.19/0.38 cnf(i_0_91, plain, (ifeq2(object(X1),true,entity(X1),true)=true)).
% 0.19/0.38 cnf(i_0_92, plain, (ifeq2(location(X1),true,object(X1),true)=true)).
% 0.19/0.38 cnf(i_0_96, plain, (ifeq2(artifact(X1),true,object(X1),true)=true)).
% 0.19/0.38 cnf(i_0_97, plain, (ifeq2(instrumentality(X1),true,artifact(X1),true)=true)).
% 0.19/0.38 cnf(i_0_98, plain, (ifeq2(transport(X1),true,instrumentality(X1),true)=true)).
% 0.19/0.38 cnf(i_0_99, plain, (ifeq2(vehicle(X1),true,transport(X1),true)=true)).
% 0.19/0.38 cnf(i_0_107, plain, (ifeq2(organism(X1),true,entity(X1),true)=true)).
% 0.19/0.38 cnf(i_0_145, plain, (ifeq(tuple(woman(X1),man(X1)),tuple(true,true),a,b)=b)).
% 0.19/0.38 cnf(i_0_144, plain, (ifeq(tuple(nonhuman(X1),human(X1)),tuple(true,true),a,b)=b)).
% 0.19/0.38 cnf(i_0_152, plain, (ifeq(tuple(instrumentality(X1),way(X1)),tuple(true,true),a,b)=b)).
% 0.19/0.38 cnf(i_0_112, plain, (ifeq2(of(X1,X2),true,have(skf1(X1,X2),X2,X1),true)=true)).
% 0.19/0.38 cnf(i_0_149, plain, (ifeq(tuple(entity(X1),eventuality(X1)),tuple(true,true),a,b)=b)).
% 0.19/0.38 cnf(i_0_148, plain, (ifeq(tuple(entity(X1),abstraction(X1)),tuple(true,true),a,b)=b)).
% 0.19/0.38 cnf(i_0_146, plain, (ifeq(tuple(female(X1),male(X1)),tuple(true,true),a,b)=b)).
% 0.19/0.38 cnf(i_0_153, plain, (ifeq(tuple(transport(X1),furniture(X1)),tuple(true,true),a,b)=b)).
% 0.19/0.38 cnf(i_0_150, plain, (ifeq(tuple(old(X1),new(X1)),tuple(true,true),a,b)=b)).
% 0.19/0.38 cnf(i_0_154, plain, (ifeq(tuple(object(X1),organism(X1)),tuple(true,true),a,b)=b)).
% 0.19/0.38 cnf(i_0_151, plain, (ifeq(tuple(location(X1),artifact(X1)),tuple(true,true),a,b)=b)).
% 0.19/0.38 cnf(i_0_147, plain, (ifeq(tuple(eventuality(X1),abstraction(X1)),tuple(true,true),a,b)=b)).
% 0.19/0.38 cnf(i_0_111, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,human(X1),true),true)=true)).
% 0.19/0.38 cnf(i_0_113, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,owner(X2),true),true)=true)).
% 0.19/0.38 cnf(i_0_114, plain, (ifeq3(partof(X1,X2),true,ifeq3(partof(X1,X3),true,X2,X3),X3)=X3)).
% 0.19/0.38 cnf(i_0_115, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(event(X1),true,of(X2,X3),true),true)=true)).
% 0.19/0.38 cnf(i_0_116, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,of(X2,X3),true),true)=true)).
% 0.19/0.38 cnf(i_0_117, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,have(X3,X1,X2),true),true)=true)).
% 0.19/0.38 cnf(i_0_118, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(nonhuman(X2),true,ifeq2(nonhuman(X3),true,partof(X3,X2),true),true),true)=true)).
% 0.19/0.38 cnf(i_0_156, negated_conjecture, (a!=b)).
% 0.19/0.38 cnf(i_0_184, plain, (X4=X4)).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 7 steps
% 0.19/0.38 cnf(i_0_184, plain, (true=true), inference(start_rule)).
% 0.19/0.38 cnf(i_0_314, plain, (true=true), inference(extension_rule, [i_0_188])).
% 0.19/0.38 cnf(i_0_324, plain, (event(skc12)!=true), inference(closure_rule, [i_0_121])).
% 0.19/0.38 cnf(i_0_325, plain, (event(skc12)!=true), inference(closure_rule, [i_0_121])).
% 0.19/0.38 cnf(i_0_326, plain, (event(skc12)!=true), inference(closure_rule, [i_0_121])).
% 0.19/0.38 cnf(i_0_322, plain, (ifeq4(true,event(skc12),event(skc12),event(skc12))=ifeq4(true,true,true,true)), inference(extension_rule, [i_0_187])).
% 0.19/0.38 cnf(i_0_333, plain, (ifeq4(true,true,true,true)!=true), inference(closure_rule, [i_0_79])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # Creating equality axioms
% 0.19/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.38 # 12457 Satisfiable branch
% 0.19/0.38 # Creating equality axioms
% 0.19/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.38 # 12454 Satisfiable branch
% 0.19/0.38 # Creating equality axioms
% 0.19/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.38 # 12455 Satisfiable branch
% 0.19/0.38 # Child (12456) has found a proof.
% 0.19/0.38
% 0.19/0.39 # Proof search is over...
% 0.19/0.39 # Freeing feature tree
%------------------------------------------------------------------------------