%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NLP003-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 : n024.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:24 EDT 2022 % Result : Satisfiable 0.13s 0.38s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NLP003-10 : TPTP v8.1.0. Released v7.3.0. % 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n024.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Thu Jun 30 18:37:30 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 56 Number of unprocessed: 56 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # 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 # 56 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 15 conjectures. % 0.13/0.37 # There are 15 start rule candidates: % 0.13/0.37 # Found 56 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 15 start rule tableaux created. % 0.13/0.37 # 0 extension rule candidate clauses % 0.13/0.37 # 56 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # 25916 Satisfiable branch % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # 25918 Satisfiable branch % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # 25917 Satisfiable branch % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # 25919 Satisfiable branch % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # 25920 Satisfiable branch % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # 25921 Satisfiable branch % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # 25922 Satisfiable branch % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # 25923 Satisfiable branch % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_91, negated_conjecture, (event(skc6)=true)). % 0.13/0.38 cnf(i_0_90, negated_conjecture, (city(skc7)=true)). % 0.13/0.38 cnf(i_0_89, negated_conjecture, (hollywood(skc7)=true)). % 0.13/0.38 cnf(i_0_98, negated_conjecture, (way(skc4)=true)). % 0.13/0.38 cnf(i_0_99, negated_conjecture, (street(skc4)=true)). % 0.13/0.38 cnf(i_0_93, negated_conjecture, (car(skc5)=true)). % 0.13/0.38 cnf(i_0_92, negated_conjecture, (chevy(skc5)=true)). % 0.13/0.38 cnf(i_0_94, negated_conjecture, (white(skc5)=true)). % 0.13/0.38 cnf(i_0_95, negated_conjecture, (dirty(skc5)=true)). % 0.13/0.38 cnf(i_0_96, negated_conjecture, (old(skc5)=true)). % 0.13/0.38 cnf(i_0_97, negated_conjecture, (lonely(skc4)=true)). % 0.13/0.38 cnf(i_0_100, negated_conjecture, (in(skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_101, negated_conjecture, (down(skc6,skc4)=true)). % 0.13/0.38 cnf(i_0_102, negated_conjecture, (barrel(skc6,skc5)=true)). % 0.13/0.38 cnf(i_0_60, plain, (event(skf1(X1,X2))=true)). % 0.13/0.38 cnf(i_0_57, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_71, plain, (ifeq2(hollywood(X1),true,city(X1),true)=true)). % 0.13/0.38 cnf(i_0_58, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_59, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_72, plain, (ifeq2(event(X1),true,eventuality(X1),true)=true)). % 0.13/0.38 cnf(i_0_61, plain, (ifeq2(nonhuman(X1),true,entity(X1),true)=true)). % 0.13/0.38 cnf(i_0_75, plain, (ifeq2(street(X1),true,way(X1),true)=true)). % 0.13/0.38 cnf(i_0_80, plain, (ifeq2(chevy(X1),true,car(X1),true)=true)). % 0.13/0.38 cnf(i_0_70, plain, (ifeq2(city(X1),true,location(X1),true)=true)). % 0.13/0.38 cnf(i_0_74, plain, (ifeq2(way(X1),true,artifact(X1),true)=true)). % 0.13/0.38 cnf(i_0_79, plain, (ifeq2(car(X1),true,vehicle(X1),true)=true)). % 0.13/0.38 cnf(i_0_62, plain, (ifeq2(drs(X1),true,proposition(X1),true)=true)). % 0.13/0.38 cnf(i_0_63, plain, (ifeq2(proposition(X1),true,drs(X1),true)=true)). % 0.13/0.38 cnf(i_0_64, plain, (ifeq2(woman(X1),true,female(X1),true)=true)). % 0.13/0.38 cnf(i_0_65, plain, (ifeq2(female(X1),true,human(X1),true)=true)). % 0.13/0.38 cnf(i_0_66, plain, (ifeq2(male(X1),true,human(X1),true)=true)). % 0.13/0.38 cnf(i_0_67, plain, (ifeq2(man(X1),true,male(X1),true)=true)). % 0.13/0.38 cnf(i_0_68, plain, (ifeq2(object(X1),true,entity(X1),true)=true)). % 0.13/0.38 cnf(i_0_69, plain, (ifeq2(location(X1),true,object(X1),true)=true)). % 0.13/0.38 cnf(i_0_73, plain, (ifeq2(artifact(X1),true,object(X1),true)=true)). % 0.13/0.38 cnf(i_0_76, plain, (ifeq2(instrumentality(X1),true,artifact(X1),true)=true)). % 0.13/0.38 cnf(i_0_77, plain, (ifeq2(transport(X1),true,instrumentality(X1),true)=true)). % 0.13/0.38 cnf(i_0_78, plain, (ifeq2(vehicle(X1),true,transport(X1),true)=true)). % 0.13/0.38 cnf(i_0_111, plain, (ifeq(tuple(way(X1),instrumentality(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_82, plain, (ifeq2(of(X1,X2),true,have(skf1(X1,X2),X2,X1),true)=true)). % 0.13/0.38 cnf(i_0_103, plain, (ifeq(tuple(nonhuman(X1),human(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_108, plain, (ifeq(tuple(entity(X1),eventuality(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_107, plain, (ifeq(tuple(entity(X1),abstraction(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_109, plain, (ifeq(tuple(old(X1),new(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_104, plain, (ifeq(tuple(woman(X1),man(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_105, plain, (ifeq(tuple(female(X1),male(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_110, plain, (ifeq(tuple(location(X1),artifact(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_106, plain, (ifeq(tuple(eventuality(X1),abstraction(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_81, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,human(X1),true),true)=true)). % 0.13/0.38 cnf(i_0_83, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,owner(X2),true),true)=true)). % 0.13/0.38 cnf(i_0_84, plain, (ifeq3(partof(X1,X2),true,ifeq3(partof(X1,X3),true,X2,X3),X3)=X3)). % 0.13/0.38 cnf(i_0_85, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(event(X1),true,of(X2,X3),true),true)=true)). % 0.13/0.38 cnf(i_0_86, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,of(X2,X3),true),true)=true)). % 0.13/0.38 cnf(i_0_87, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,have(X3,X1,X2),true),true)=true)). % 0.13/0.38 cnf(i_0_88, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(nonhuman(X2),true,ifeq2(nonhuman(X3),true,partof(X3,X2),true),true),true)=true)). % 0.13/0.38 cnf(i_0_112, negated_conjecture, (a!=b)). % 0.13/0.38 cnf(i_0_128, plain, (X4=X4)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 7 steps % 0.13/0.38 cnf(i_0_128, plain, (true=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_229, plain, (true=true), inference(extension_rule, [i_0_132])). % 0.13/0.38 cnf(i_0_239, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_240, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_241, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_237, plain, (ifeq3(true,event(skc6),event(skc6),event(skc6))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_131])). % 0.13/0.38 cnf(i_0_248, plain, (ifeq3(true,true,true,true)!=true), inference(closure_rule, [i_0_57])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_91, negated_conjecture, (event(skc6)=true)). % 0.13/0.38 cnf(i_0_90, negated_conjecture, (city(skc7)=true)). % 0.13/0.38 cnf(i_0_89, negated_conjecture, (hollywood(skc7)=true)). % 0.13/0.38 cnf(i_0_98, negated_conjecture, (way(skc4)=true)). % 0.13/0.38 cnf(i_0_99, negated_conjecture, (street(skc4)=true)). % 0.13/0.38 cnf(i_0_93, negated_conjecture, (car(skc5)=true)). % 0.13/0.38 cnf(i_0_92, negated_conjecture, (chevy(skc5)=true)). % 0.13/0.38 cnf(i_0_94, negated_conjecture, (white(skc5)=true)). % 0.13/0.38 cnf(i_0_95, negated_conjecture, (dirty(skc5)=true)). % 0.13/0.38 cnf(i_0_96, negated_conjecture, (old(skc5)=true)). % 0.13/0.38 cnf(i_0_97, negated_conjecture, (lonely(skc4)=true)). % 0.13/0.38 cnf(i_0_100, negated_conjecture, (in(skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_101, negated_conjecture, (down(skc6,skc4)=true)). % 0.13/0.38 cnf(i_0_102, negated_conjecture, (barrel(skc6,skc5)=true)). % 0.13/0.38 cnf(i_0_60, plain, (event(skf1(X1,X2))=true)). % 0.13/0.38 cnf(i_0_57, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_71, plain, (ifeq2(hollywood(X1),true,city(X1),true)=true)). % 0.13/0.38 cnf(i_0_58, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_59, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_72, plain, (ifeq2(event(X1),true,eventuality(X1),true)=true)). % 0.13/0.38 cnf(i_0_61, plain, (ifeq2(nonhuman(X1),true,entity(X1),true)=true)). % 0.13/0.38 cnf(i_0_75, plain, (ifeq2(street(X1),true,way(X1),true)=true)). % 0.13/0.38 cnf(i_0_80, plain, (ifeq2(chevy(X1),true,car(X1),true)=true)). % 0.13/0.38 cnf(i_0_70, plain, (ifeq2(city(X1),true,location(X1),true)=true)). % 0.13/0.38 cnf(i_0_74, plain, (ifeq2(way(X1),true,artifact(X1),true)=true)). % 0.13/0.38 cnf(i_0_79, plain, (ifeq2(car(X1),true,vehicle(X1),true)=true)). % 0.13/0.38 cnf(i_0_62, plain, (ifeq2(drs(X1),true,proposition(X1),true)=true)). % 0.13/0.38 cnf(i_0_63, plain, (ifeq2(proposition(X1),true,drs(X1),true)=true)). % 0.13/0.38 cnf(i_0_64, plain, (ifeq2(woman(X1),true,female(X1),true)=true)). % 0.13/0.38 cnf(i_0_65, plain, (ifeq2(female(X1),true,human(X1),true)=true)). % 0.13/0.38 cnf(i_0_66, plain, (ifeq2(male(X1),true,human(X1),true)=true)). % 0.13/0.38 cnf(i_0_67, plain, (ifeq2(man(X1),true,male(X1),true)=true)). % 0.13/0.38 cnf(i_0_68, plain, (ifeq2(object(X1),true,entity(X1),true)=true)). % 0.13/0.38 cnf(i_0_69, plain, (ifeq2(location(X1),true,object(X1),true)=true)). % 0.13/0.38 cnf(i_0_73, plain, (ifeq2(artifact(X1),true,object(X1),true)=true)). % 0.13/0.38 cnf(i_0_76, plain, (ifeq2(instrumentality(X1),true,artifact(X1),true)=true)). % 0.13/0.38 cnf(i_0_77, plain, (ifeq2(transport(X1),true,instrumentality(X1),true)=true)). % 0.13/0.38 cnf(i_0_78, plain, (ifeq2(vehicle(X1),true,transport(X1),true)=true)). % 0.13/0.38 cnf(i_0_111, plain, (ifeq(tuple(way(X1),instrumentality(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_82, plain, (ifeq2(of(X1,X2),true,have(skf1(X1,X2),X2,X1),true)=true)). % 0.13/0.38 cnf(i_0_103, plain, (ifeq(tuple(nonhuman(X1),human(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_108, plain, (ifeq(tuple(entity(X1),eventuality(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_107, plain, (ifeq(tuple(entity(X1),abstraction(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_109, plain, (ifeq(tuple(old(X1),new(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_104, plain, (ifeq(tuple(woman(X1),man(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_105, plain, (ifeq(tuple(female(X1),male(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_110, plain, (ifeq(tuple(location(X1),artifact(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_106, plain, (ifeq(tuple(eventuality(X1),abstraction(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_81, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,human(X1),true),true)=true)). % 0.13/0.38 cnf(i_0_83, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,owner(X2),true),true)=true)). % 0.13/0.38 cnf(i_0_84, plain, (ifeq3(partof(X1,X2),true,ifeq3(partof(X1,X3),true,X2,X3),X3)=X3)). % 0.13/0.38 cnf(i_0_85, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(event(X1),true,of(X2,X3),true),true)=true)). % 0.13/0.38 cnf(i_0_86, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,of(X2,X3),true),true)=true)). % 0.13/0.38 cnf(i_0_87, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,have(X3,X1,X2),true),true)=true)). % 0.13/0.38 cnf(i_0_88, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(nonhuman(X2),true,ifeq2(nonhuman(X3),true,partof(X3,X2),true),true),true)=true)). % 0.13/0.38 cnf(i_0_112, negated_conjecture, (a!=b)). % 0.13/0.38 cnf(i_0_128, plain, (X4=X4)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 7 steps % 0.13/0.38 cnf(i_0_128, plain, (true=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_229, plain, (true=true), inference(extension_rule, [i_0_132])). % 0.13/0.38 cnf(i_0_239, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_240, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_241, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_237, plain, (ifeq3(true,event(skc6),event(skc6),event(skc6))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_131])). % 0.13/0.38 cnf(i_0_248, plain, (ifeq3(true,true,true,true)!=true), inference(closure_rule, [i_0_57])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_91, negated_conjecture, (event(skc6)=true)). % 0.13/0.38 cnf(i_0_90, negated_conjecture, (city(skc7)=true)). % 0.13/0.38 cnf(i_0_89, negated_conjecture, (hollywood(skc7)=true)). % 0.13/0.38 cnf(i_0_98, negated_conjecture, (way(skc4)=true)). % 0.13/0.38 cnf(i_0_99, negated_conjecture, (street(skc4)=true)). % 0.13/0.38 cnf(i_0_93, negated_conjecture, (car(skc5)=true)). % 0.13/0.38 cnf(i_0_92, negated_conjecture, (chevy(skc5)=true)). % 0.13/0.38 cnf(i_0_94, negated_conjecture, (white(skc5)=true)). % 0.13/0.38 cnf(i_0_95, negated_conjecture, (dirty(skc5)=true)). % 0.13/0.38 cnf(i_0_96, negated_conjecture, (old(skc5)=true)). % 0.13/0.38 cnf(i_0_97, negated_conjecture, (lonely(skc4)=true)). % 0.13/0.38 cnf(i_0_100, negated_conjecture, (in(skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_101, negated_conjecture, (down(skc6,skc4)=true)). % 0.13/0.38 cnf(i_0_102, negated_conjecture, (barrel(skc6,skc5)=true)). % 0.13/0.38 cnf(i_0_60, plain, (event(skf1(X1,X2))=true)). % 0.13/0.38 cnf(i_0_57, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_71, plain, (ifeq2(hollywood(X1),true,city(X1),true)=true)). % 0.13/0.38 cnf(i_0_58, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_59, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_72, plain, (ifeq2(event(X1),true,eventuality(X1),true)=true)). % 0.13/0.38 cnf(i_0_61, plain, (ifeq2(nonhuman(X1),true,entity(X1),true)=true)). % 0.13/0.38 cnf(i_0_75, plain, (ifeq2(street(X1),true,way(X1),true)=true)). % 0.13/0.38 cnf(i_0_80, plain, (ifeq2(chevy(X1),true,car(X1),true)=true)). % 0.13/0.38 cnf(i_0_70, plain, (ifeq2(city(X1),true,location(X1),true)=true)). % 0.13/0.38 cnf(i_0_74, plain, (ifeq2(way(X1),true,artifact(X1),true)=true)). % 0.13/0.38 cnf(i_0_79, plain, (ifeq2(car(X1),true,vehicle(X1),true)=true)). % 0.13/0.38 cnf(i_0_62, plain, (ifeq2(drs(X1),true,proposition(X1),true)=true)). % 0.13/0.38 cnf(i_0_63, plain, (ifeq2(proposition(X1),true,drs(X1),true)=true)). % 0.13/0.38 cnf(i_0_64, plain, (ifeq2(woman(X1),true,female(X1),true)=true)). % 0.13/0.38 cnf(i_0_65, plain, (ifeq2(female(X1),true,human(X1),true)=true)). % 0.13/0.38 cnf(i_0_66, plain, (ifeq2(male(X1),true,human(X1),true)=true)). % 0.13/0.38 cnf(i_0_67, plain, (ifeq2(man(X1),true,male(X1),true)=true)). % 0.13/0.38 cnf(i_0_68, plain, (ifeq2(object(X1),true,entity(X1),true)=true)). % 0.13/0.38 cnf(i_0_69, plain, (ifeq2(location(X1),true,object(X1),true)=true)). % 0.13/0.38 cnf(i_0_73, plain, (ifeq2(artifact(X1),true,object(X1),true)=true)). % 0.13/0.38 cnf(i_0_76, plain, (ifeq2(instrumentality(X1),true,artifact(X1),true)=true)). % 0.13/0.38 cnf(i_0_77, plain, (ifeq2(transport(X1),true,instrumentality(X1),true)=true)). % 0.13/0.38 cnf(i_0_78, plain, (ifeq2(vehicle(X1),true,transport(X1),true)=true)). % 0.13/0.38 cnf(i_0_111, plain, (ifeq(tuple(way(X1),instrumentality(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_82, plain, (ifeq2(of(X1,X2),true,have(skf1(X1,X2),X2,X1),true)=true)). % 0.13/0.38 cnf(i_0_103, plain, (ifeq(tuple(nonhuman(X1),human(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_108, plain, (ifeq(tuple(entity(X1),eventuality(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_107, plain, (ifeq(tuple(entity(X1),abstraction(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_109, plain, (ifeq(tuple(old(X1),new(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_104, plain, (ifeq(tuple(woman(X1),man(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_105, plain, (ifeq(tuple(female(X1),male(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_110, plain, (ifeq(tuple(location(X1),artifact(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_106, plain, (ifeq(tuple(eventuality(X1),abstraction(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_81, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,human(X1),true),true)=true)). % 0.13/0.38 cnf(i_0_83, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,owner(X2),true),true)=true)). % 0.13/0.38 cnf(i_0_84, plain, (ifeq3(partof(X1,X2),true,ifeq3(partof(X1,X3),true,X2,X3),X3)=X3)). % 0.13/0.38 cnf(i_0_85, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(event(X1),true,of(X2,X3),true),true)=true)). % 0.13/0.38 cnf(i_0_86, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,of(X2,X3),true),true)=true)). % 0.13/0.38 cnf(i_0_87, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,have(X3,X1,X2),true),true)=true)). % 0.13/0.38 cnf(i_0_88, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(nonhuman(X2),true,ifeq2(nonhuman(X3),true,partof(X3,X2),true),true),true)=true)). % 0.13/0.38 cnf(i_0_112, negated_conjecture, (a!=b)). % 0.13/0.38 cnf(i_0_128, plain, (X4=X4)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 7 steps % 0.13/0.38 cnf(i_0_128, plain, (true=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_229, plain, (true=true), inference(extension_rule, [i_0_132])). % 0.13/0.38 cnf(i_0_239, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_240, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_241, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_237, plain, (ifeq3(true,event(skc6),event(skc6),event(skc6))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_131])). % 0.13/0.38 cnf(i_0_248, plain, (ifeq3(true,true,true,true)!=true), inference(closure_rule, [i_0_57])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_91, negated_conjecture, (event(skc6)=true)). % 0.13/0.38 cnf(i_0_90, negated_conjecture, (city(skc7)=true)). % 0.13/0.38 cnf(i_0_89, negated_conjecture, (hollywood(skc7)=true)). % 0.13/0.38 cnf(i_0_98, negated_conjecture, (way(skc4)=true)). % 0.13/0.38 cnf(i_0_99, negated_conjecture, (street(skc4)=true)). % 0.13/0.38 cnf(i_0_93, negated_conjecture, (car(skc5)=true)). % 0.13/0.38 cnf(i_0_92, negated_conjecture, (chevy(skc5)=true)). % 0.13/0.38 cnf(i_0_94, negated_conjecture, (white(skc5)=true)). % 0.13/0.38 cnf(i_0_95, negated_conjecture, (dirty(skc5)=true)). % 0.13/0.38 cnf(i_0_96, negated_conjecture, (old(skc5)=true)). % 0.13/0.38 cnf(i_0_97, negated_conjecture, (lonely(skc4)=true)). % 0.13/0.38 cnf(i_0_100, negated_conjecture, (in(skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_101, negated_conjecture, (down(skc6,skc4)=true)). % 0.13/0.38 cnf(i_0_102, negated_conjecture, (barrel(skc6,skc5)=true)). % 0.13/0.38 cnf(i_0_60, plain, (event(skf1(X1,X2))=true)). % 0.13/0.38 cnf(i_0_57, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_71, plain, (ifeq2(hollywood(X1),true,city(X1),true)=true)). % 0.13/0.38 cnf(i_0_58, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_59, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_72, plain, (ifeq2(event(X1),true,eventuality(X1),true)=true)). % 0.13/0.38 cnf(i_0_61, plain, (ifeq2(nonhuman(X1),true,entity(X1),true)=true)). % 0.13/0.38 cnf(i_0_75, plain, (ifeq2(street(X1),true,way(X1),true)=true)). % 0.13/0.38 cnf(i_0_80, plain, (ifeq2(chevy(X1),true,car(X1),true)=true)). % 0.13/0.38 cnf(i_0_70, plain, (ifeq2(city(X1),true,location(X1),true)=true)). % 0.13/0.38 cnf(i_0_74, plain, (ifeq2(way(X1),true,artifact(X1),true)=true)). % 0.13/0.38 cnf(i_0_79, plain, (ifeq2(car(X1),true,vehicle(X1),true)=true)). % 0.13/0.38 cnf(i_0_62, plain, (ifeq2(drs(X1),true,proposition(X1),true)=true)). % 0.13/0.38 cnf(i_0_63, plain, (ifeq2(proposition(X1),true,drs(X1),true)=true)). % 0.13/0.38 cnf(i_0_64, plain, (ifeq2(woman(X1),true,female(X1),true)=true)). % 0.13/0.38 cnf(i_0_65, plain, (ifeq2(female(X1),true,human(X1),true)=true)). % 0.13/0.38 cnf(i_0_66, plain, (ifeq2(male(X1),true,human(X1),true)=true)). % 0.13/0.38 cnf(i_0_67, plain, (ifeq2(man(X1),true,male(X1),true)=true)). % 0.13/0.38 cnf(i_0_68, plain, (ifeq2(object(X1),true,entity(X1),true)=true)). % 0.13/0.38 cnf(i_0_69, plain, (ifeq2(location(X1),true,object(X1),true)=true)). % 0.13/0.38 cnf(i_0_73, plain, (ifeq2(artifact(X1),true,object(X1),true)=true)). % 0.13/0.38 cnf(i_0_76, plain, (ifeq2(instrumentality(X1),true,artifact(X1),true)=true)). % 0.13/0.38 cnf(i_0_77, plain, (ifeq2(transport(X1),true,instrumentality(X1),true)=true)). % 0.13/0.38 cnf(i_0_78, plain, (ifeq2(vehicle(X1),true,transport(X1),true)=true)). % 0.13/0.38 cnf(i_0_111, plain, (ifeq(tuple(way(X1),instrumentality(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_82, plain, (ifeq2(of(X1,X2),true,have(skf1(X1,X2),X2,X1),true)=true)). % 0.13/0.38 cnf(i_0_103, plain, (ifeq(tuple(nonhuman(X1),human(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_108, plain, (ifeq(tuple(entity(X1),eventuality(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_107, plain, (ifeq(tuple(entity(X1),abstraction(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_109, plain, (ifeq(tuple(old(X1),new(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_104, plain, (ifeq(tuple(woman(X1),man(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_105, plain, (ifeq(tuple(female(X1),male(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_110, plain, (ifeq(tuple(location(X1),artifact(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_106, plain, (ifeq(tuple(eventuality(X1),abstraction(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_81, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,human(X1),true),true)=true)). % 0.13/0.38 cnf(i_0_83, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,owner(X2),true),true)=true)). % 0.13/0.38 cnf(i_0_84, plain, (ifeq3(partof(X1,X2),true,ifeq3(partof(X1,X3),true,X2,X3),X3)=X3)). % 0.13/0.38 cnf(i_0_85, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(event(X1),true,of(X2,X3),true),true)=true)). % 0.13/0.38 cnf(i_0_86, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,of(X2,X3),true),true)=true)). % 0.13/0.38 cnf(i_0_87, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,have(X3,X1,X2),true),true)=true)). % 0.13/0.38 cnf(i_0_88, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(nonhuman(X2),true,ifeq2(nonhuman(X3),true,partof(X3,X2),true),true),true)=true)). % 0.13/0.38 cnf(i_0_112, negated_conjecture, (a!=b)). % 0.13/0.38 cnf(i_0_128, plain, (X4=X4)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 7 steps % 0.13/0.38 cnf(i_0_128, plain, (true=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_229, plain, (true=true), inference(extension_rule, [i_0_132])). % 0.13/0.38 cnf(i_0_239, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_240, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_241, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_237, plain, (ifeq3(true,event(skc6),event(skc6),event(skc6))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_131])). % 0.13/0.38 cnf(i_0_248, plain, (ifeq3(true,true,true,true)!=true), inference(closure_rule, [i_0_57])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_91, negated_conjecture, (event(skc6)=true)). % 0.13/0.38 cnf(i_0_90, negated_conjecture, (city(skc7)=true)). % 0.13/0.38 cnf(i_0_89, negated_conjecture, (hollywood(skc7)=true)). % 0.13/0.38 cnf(i_0_98, negated_conjecture, (way(skc4)=true)). % 0.13/0.38 cnf(i_0_99, negated_conjecture, (street(skc4)=true)). % 0.13/0.38 cnf(i_0_93, negated_conjecture, (car(skc5)=true)). % 0.13/0.38 cnf(i_0_92, negated_conjecture, (chevy(skc5)=true)). % 0.13/0.38 cnf(i_0_94, negated_conjecture, (white(skc5)=true)). % 0.13/0.38 cnf(i_0_95, negated_conjecture, (dirty(skc5)=true)). % 0.13/0.38 cnf(i_0_96, negated_conjecture, (old(skc5)=true)). % 0.13/0.38 cnf(i_0_97, negated_conjecture, (lonely(skc4)=true)). % 0.13/0.38 cnf(i_0_100, negated_conjecture, (in(skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_101, negated_conjecture, (down(skc6,skc4)=true)). % 0.13/0.38 cnf(i_0_102, negated_conjecture, (barrel(skc6,skc5)=true)). % 0.13/0.38 cnf(i_0_60, plain, (event(skf1(X1,X2))=true)). % 0.13/0.38 cnf(i_0_57, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_71, plain, (ifeq2(hollywood(X1),true,city(X1),true)=true)). % 0.13/0.38 cnf(i_0_58, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_59, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_72, plain, (ifeq2(event(X1),true,eventuality(X1),true)=true)). % 0.13/0.38 cnf(i_0_61, plain, (ifeq2(nonhuman(X1),true,entity(X1),true)=true)). % 0.13/0.38 cnf(i_0_75, plain, (ifeq2(street(X1),true,way(X1),true)=true)). % 0.13/0.38 cnf(i_0_80, plain, (ifeq2(chevy(X1),true,car(X1),true)=true)). % 0.13/0.38 cnf(i_0_70, plain, (ifeq2(city(X1),true,location(X1),true)=true)). % 0.13/0.38 cnf(i_0_74, plain, (ifeq2(way(X1),true,artifact(X1),true)=true)). % 0.13/0.38 cnf(i_0_79, plain, (ifeq2(car(X1),true,vehicle(X1),true)=true)). % 0.13/0.38 cnf(i_0_62, plain, (ifeq2(drs(X1),true,proposition(X1),true)=true)). % 0.13/0.38 cnf(i_0_63, plain, (ifeq2(proposition(X1),true,drs(X1),true)=true)). % 0.13/0.38 cnf(i_0_64, plain, (ifeq2(woman(X1),true,female(X1),true)=true)). % 0.13/0.38 cnf(i_0_65, plain, (ifeq2(female(X1),true,human(X1),true)=true)). % 0.13/0.38 cnf(i_0_66, plain, (ifeq2(male(X1),true,human(X1),true)=true)). % 0.13/0.38 cnf(i_0_67, plain, (ifeq2(man(X1),true,male(X1),true)=true)). % 0.13/0.38 cnf(i_0_68, plain, (ifeq2(object(X1),true,entity(X1),true)=true)). % 0.13/0.38 cnf(i_0_69, plain, (ifeq2(location(X1),true,object(X1),true)=true)). % 0.13/0.38 cnf(i_0_73, plain, (ifeq2(artifact(X1),true,object(X1),true)=true)). % 0.13/0.38 cnf(i_0_76, plain, (ifeq2(instrumentality(X1),true,artifact(X1),true)=true)). % 0.13/0.38 cnf(i_0_77, plain, (ifeq2(transport(X1),true,instrumentality(X1),true)=true)). % 0.13/0.38 cnf(i_0_78, plain, (ifeq2(vehicle(X1),true,transport(X1),true)=true)). % 0.13/0.38 cnf(i_0_111, plain, (ifeq(tuple(way(X1),instrumentality(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_82, plain, (ifeq2(of(X1,X2),true,have(skf1(X1,X2),X2,X1),true)=true)). % 0.13/0.38 cnf(i_0_103, plain, (ifeq(tuple(nonhuman(X1),human(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_108, plain, (ifeq(tuple(entity(X1),eventuality(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_107, plain, (ifeq(tuple(entity(X1),abstraction(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_109, plain, (ifeq(tuple(old(X1),new(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_104, plain, (ifeq(tuple(woman(X1),man(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_105, plain, (ifeq(tuple(female(X1),male(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_110, plain, (ifeq(tuple(location(X1),artifact(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_106, plain, (ifeq(tuple(eventuality(X1),abstraction(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_81, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,human(X1),true),true)=true)). % 0.13/0.38 cnf(i_0_83, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,owner(X2),true),true)=true)). % 0.13/0.38 cnf(i_0_84, plain, (ifeq3(partof(X1,X2),true,ifeq3(partof(X1,X3),true,X2,X3),X3)=X3)). % 0.13/0.38 cnf(i_0_85, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(event(X1),true,of(X2,X3),true),true)=true)). % 0.13/0.38 cnf(i_0_86, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,of(X2,X3),true),true)=true)). % 0.13/0.38 cnf(i_0_87, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,have(X3,X1,X2),true),true)=true)). % 0.13/0.38 cnf(i_0_88, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(nonhuman(X2),true,ifeq2(nonhuman(X3),true,partof(X3,X2),true),true),true)=true)). % 0.13/0.38 cnf(i_0_112, negated_conjecture, (a!=b)). % 0.13/0.38 cnf(i_0_128, plain, (X4=X4)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 7 steps % 0.13/0.38 cnf(i_0_128, plain, (true=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_229, plain, (true=true), inference(extension_rule, [i_0_132])). % 0.13/0.38 cnf(i_0_239, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_240, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_241, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_237, plain, (ifeq3(true,event(skc6),event(skc6),event(skc6))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_131])). % 0.13/0.38 cnf(i_0_248, plain, (ifeq3(true,true,true,true)!=true), inference(closure_rule, [i_0_57])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_91, negated_conjecture, (event(skc6)=true)). % 0.13/0.38 cnf(i_0_90, negated_conjecture, (city(skc7)=true)). % 0.13/0.38 cnf(i_0_89, negated_conjecture, (hollywood(skc7)=true)). % 0.13/0.38 cnf(i_0_98, negated_conjecture, (way(skc4)=true)). % 0.13/0.38 cnf(i_0_99, negated_conjecture, (street(skc4)=true)). % 0.13/0.38 cnf(i_0_93, negated_conjecture, (car(skc5)=true)). % 0.13/0.38 cnf(i_0_92, negated_conjecture, (chevy(skc5)=true)). % 0.13/0.38 cnf(i_0_94, negated_conjecture, (white(skc5)=true)). % 0.13/0.38 cnf(i_0_95, negated_conjecture, (dirty(skc5)=true)). % 0.13/0.38 cnf(i_0_96, negated_conjecture, (old(skc5)=true)). % 0.13/0.38 cnf(i_0_97, negated_conjecture, (lonely(skc4)=true)). % 0.13/0.38 cnf(i_0_100, negated_conjecture, (in(skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_101, negated_conjecture, (down(skc6,skc4)=true)). % 0.13/0.38 cnf(i_0_102, negated_conjecture, (barrel(skc6,skc5)=true)). % 0.13/0.38 cnf(i_0_60, plain, (event(skf1(X1,X2))=true)). % 0.13/0.38 cnf(i_0_57, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_71, plain, (ifeq2(hollywood(X1),true,city(X1),true)=true)). % 0.13/0.38 cnf(i_0_58, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_59, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_72, plain, (ifeq2(event(X1),true,eventuality(X1),true)=true)). % 0.13/0.38 cnf(i_0_61, plain, (ifeq2(nonhuman(X1),true,entity(X1),true)=true)). % 0.13/0.38 cnf(i_0_75, plain, (ifeq2(street(X1),true,way(X1),true)=true)). % 0.13/0.38 cnf(i_0_80, plain, (ifeq2(chevy(X1),true,car(X1),true)=true)). % 0.13/0.38 cnf(i_0_70, plain, (ifeq2(city(X1),true,location(X1),true)=true)). % 0.13/0.38 cnf(i_0_74, plain, (ifeq2(way(X1),true,artifact(X1),true)=true)). % 0.13/0.38 cnf(i_0_79, plain, (ifeq2(car(X1),true,vehicle(X1),true)=true)). % 0.13/0.38 cnf(i_0_62, plain, (ifeq2(drs(X1),true,proposition(X1),true)=true)). % 0.13/0.38 cnf(i_0_63, plain, (ifeq2(proposition(X1),true,drs(X1),true)=true)). % 0.13/0.38 cnf(i_0_64, plain, (ifeq2(woman(X1),true,female(X1),true)=true)). % 0.13/0.38 cnf(i_0_65, plain, (ifeq2(female(X1),true,human(X1),true)=true)). % 0.13/0.38 cnf(i_0_66, plain, (ifeq2(male(X1),true,human(X1),true)=true)). % 0.13/0.38 cnf(i_0_67, plain, (ifeq2(man(X1),true,male(X1),true)=true)). % 0.13/0.38 cnf(i_0_68, plain, (ifeq2(object(X1),true,entity(X1),true)=true)). % 0.13/0.38 cnf(i_0_69, plain, (ifeq2(location(X1),true,object(X1),true)=true)). % 0.13/0.38 cnf(i_0_73, plain, (ifeq2(artifact(X1),true,object(X1),true)=true)). % 0.13/0.38 cnf(i_0_76, plain, (ifeq2(instrumentality(X1),true,artifact(X1),true)=true)). % 0.13/0.38 cnf(i_0_77, plain, (ifeq2(transport(X1),true,instrumentality(X1),true)=true)). % 0.13/0.38 cnf(i_0_78, plain, (ifeq2(vehicle(X1),true,transport(X1),true)=true)). % 0.13/0.38 cnf(i_0_111, plain, (ifeq(tuple(way(X1),instrumentality(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_82, plain, (ifeq2(of(X1,X2),true,have(skf1(X1,X2),X2,X1),true)=true)). % 0.13/0.38 cnf(i_0_103, plain, (ifeq(tuple(nonhuman(X1),human(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_108, plain, (ifeq(tuple(entity(X1),eventuality(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_107, plain, (ifeq(tuple(entity(X1),abstraction(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_109, plain, (ifeq(tuple(old(X1),new(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_104, plain, (ifeq(tuple(woman(X1),man(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_105, plain, (ifeq(tuple(female(X1),male(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_110, plain, (ifeq(tuple(location(X1),artifact(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_106, plain, (ifeq(tuple(eventuality(X1),abstraction(X1)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_81, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,human(X1),true),true)=true)). % 0.13/0.38 cnf(i_0_83, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,owner(X2),true),true)=true)). % 0.13/0.38 cnf(i_0_84, plain, (ifeq3(partof(X1,X2),true,ifeq3(partof(X1,X3),true,X2,X3),X3)=X3)). % 0.13/0.38 cnf(i_0_85, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(event(X1),true,of(X2,X3),true),true)=true)). % 0.13/0.38 cnf(i_0_86, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,of(X2,X3),true),true)=true)). % 0.13/0.38 cnf(i_0_87, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,have(X3,X1,X2),true),true)=true)). % 0.13/0.38 cnf(i_0_88, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(nonhuman(X2),true,ifeq2(nonhuman(X3),true,partof(X3,X2),true),true),true)=true)). % 0.13/0.38 cnf(i_0_112, negated_conjecture, (a!=b)). % 0.13/0.38 cnf(i_0_128, plain, (X4=X4)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 7 steps % 0.13/0.38 cnf(i_0_128, plain, (true=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_229, plain, (true=true), inference(extension_rule, [i_0_132])). % 0.13/0.38 cnf(i_0_239, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_240, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_241, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.38 cnf(i_0_237, plain, (ifeq3(true,event(skc6),event(skc6),event(skc6))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_131])). % 0.13/0.38 cnf(i_0_248, plain, (ifeq3(true,true,true,true)!=true), inference(closure_rule, [i_0_57])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_91, negated_conjecture, (event(skc6)=true)). % 0.13/0.38 cnf(i_0_90, negated_conjecture, (city(skc7)=true)). % 0.13/0.39 cnf(i_0_89, negated_conjecture, (hollywood(skc7)=true)). % 0.13/0.39 cnf(i_0_98, negated_conjecture, (way(skc4)=true)). % 0.13/0.39 cnf(i_0_99, negated_conjecture, (street(skc4)=true)). % 0.13/0.39 cnf(i_0_93, negated_conjecture, (car(skc5)=true)). % 0.13/0.39 cnf(i_0_92, negated_conjecture, (chevy(skc5)=true)). % 0.13/0.39 cnf(i_0_94, negated_conjecture, (white(skc5)=true)). % 0.13/0.39 cnf(i_0_95, negated_conjecture, (dirty(skc5)=true)). % 0.13/0.39 cnf(i_0_96, negated_conjecture, (old(skc5)=true)). % 0.13/0.39 cnf(i_0_97, negated_conjecture, (lonely(skc4)=true)). % 0.13/0.39 cnf(i_0_100, negated_conjecture, (in(skc6,skc7)=true)). % 0.13/0.39 cnf(i_0_101, negated_conjecture, (down(skc6,skc4)=true)). % 0.13/0.39 cnf(i_0_102, negated_conjecture, (barrel(skc6,skc5)=true)). % 0.13/0.39 cnf(i_0_60, plain, (event(skf1(X1,X2))=true)). % 0.13/0.39 cnf(i_0_57, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 0.13/0.39 cnf(i_0_71, plain, (ifeq2(hollywood(X1),true,city(X1),true)=true)). % 0.13/0.39 cnf(i_0_58, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.13/0.39 cnf(i_0_59, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.39 cnf(i_0_72, plain, (ifeq2(event(X1),true,eventuality(X1),true)=true)). % 0.13/0.39 cnf(i_0_61, plain, (ifeq2(nonhuman(X1),true,entity(X1),true)=true)). % 0.13/0.39 cnf(i_0_75, plain, (ifeq2(street(X1),true,way(X1),true)=true)). % 0.13/0.39 cnf(i_0_80, plain, (ifeq2(chevy(X1),true,car(X1),true)=true)). % 0.13/0.39 cnf(i_0_70, plain, (ifeq2(city(X1),true,location(X1),true)=true)). % 0.13/0.39 cnf(i_0_74, plain, (ifeq2(way(X1),true,artifact(X1),true)=true)). % 0.13/0.39 cnf(i_0_79, plain, (ifeq2(car(X1),true,vehicle(X1),true)=true)). % 0.13/0.39 cnf(i_0_62, plain, (ifeq2(drs(X1),true,proposition(X1),true)=true)). % 0.13/0.39 cnf(i_0_63, plain, (ifeq2(proposition(X1),true,drs(X1),true)=true)). % 0.13/0.39 cnf(i_0_64, plain, (ifeq2(woman(X1),true,female(X1),true)=true)). % 0.13/0.39 cnf(i_0_65, plain, (ifeq2(female(X1),true,human(X1),true)=true)). % 0.13/0.39 cnf(i_0_66, plain, (ifeq2(male(X1),true,human(X1),true)=true)). % 0.13/0.39 cnf(i_0_67, plain, (ifeq2(man(X1),true,male(X1),true)=true)). % 0.13/0.39 cnf(i_0_68, plain, (ifeq2(object(X1),true,entity(X1),true)=true)). % 0.13/0.39 cnf(i_0_69, plain, (ifeq2(location(X1),true,object(X1),true)=true)). % 0.13/0.39 cnf(i_0_73, plain, (ifeq2(artifact(X1),true,object(X1),true)=true)). % 0.13/0.39 cnf(i_0_76, plain, (ifeq2(instrumentality(X1),true,artifact(X1),true)=true)). % 0.13/0.39 cnf(i_0_77, plain, (ifeq2(transport(X1),true,instrumentality(X1),true)=true)). % 0.13/0.39 cnf(i_0_78, plain, (ifeq2(vehicle(X1),true,transport(X1),true)=true)). % 0.13/0.39 cnf(i_0_111, plain, (ifeq(tuple(way(X1),instrumentality(X1)),tuple(true,true),a,b)=b)). % 0.13/0.39 cnf(i_0_82, plain, (ifeq2(of(X1,X2),true,have(skf1(X1,X2),X2,X1),true)=true)). % 0.13/0.39 cnf(i_0_103, plain, (ifeq(tuple(nonhuman(X1),human(X1)),tuple(true,true),a,b)=b)). % 0.13/0.39 cnf(i_0_108, plain, (ifeq(tuple(entity(X1),eventuality(X1)),tuple(true,true),a,b)=b)). % 0.13/0.39 cnf(i_0_107, plain, (ifeq(tuple(entity(X1),abstraction(X1)),tuple(true,true),a,b)=b)). % 0.13/0.39 cnf(i_0_109, plain, (ifeq(tuple(old(X1),new(X1)),tuple(true,true),a,b)=b)). % 0.13/0.39 cnf(i_0_104, plain, (ifeq(tuple(woman(X1),man(X1)),tuple(true,true),a,b)=b)). % 0.13/0.39 cnf(i_0_105, plain, (ifeq(tuple(female(X1),male(X1)),tuple(true,true),a,b)=b)). % 0.13/0.39 cnf(i_0_110, plain, (ifeq(tuple(location(X1),artifact(X1)),tuple(true,true),a,b)=b)). % 0.13/0.39 cnf(i_0_106, plain, (ifeq(tuple(eventuality(X1),abstraction(X1)),tuple(true,true),a,b)=b)). % 0.13/0.39 cnf(i_0_81, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,human(X1),true),true)=true)). % 0.13/0.39 cnf(i_0_83, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,owner(X2),true),true)=true)). % 0.13/0.39 cnf(i_0_84, plain, (ifeq3(partof(X1,X2),true,ifeq3(partof(X1,X3),true,X2,X3),X3)=X3)). % 0.13/0.39 cnf(i_0_85, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(event(X1),true,of(X2,X3),true),true)=true)). % 0.13/0.39 cnf(i_0_86, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,of(X2,X3),true),true)=true)). % 0.13/0.39 cnf(i_0_87, plain, (ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,have(X3,X1,X2),true),true)=true)). % 0.13/0.39 cnf(i_0_88, plain, (ifeq2(have(X1,X2,X3),true,ifeq2(nonhuman(X2),true,ifeq2(nonhuman(X3),true,partof(X3,X2),true),true),true)=true)). % 0.13/0.39 cnf(i_0_112, negated_conjecture, (a!=b)). % 0.13/0.39 cnf(i_0_128, plain, (X4=X4)). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 7 steps % 0.13/0.39 cnf(i_0_128, plain, (true=true), inference(start_rule)). % 0.13/0.39 cnf(i_0_229, plain, (true=true), inference(extension_rule, [i_0_132])). % 0.13/0.39 cnf(i_0_239, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.39 cnf(i_0_240, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.39 cnf(i_0_241, plain, (event(skc6)!=true), inference(closure_rule, [i_0_91])). % 0.13/0.39 cnf(i_0_237, plain, (ifeq3(true,event(skc6),event(skc6),event(skc6))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_131])). % 0.13/0.39 cnf(i_0_248, plain, (ifeq3(true,true,true,true)!=true), inference(closure_rule, [i_0_57])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # Child (25917) has found a proof. % 0.13/0.39 % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------