%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NLP126-10 : TPTP v8.1.0. Released v7.5.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 : n015.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:12:55 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.07/0.12 % Problem : NLP126-10 : TPTP v8.1.0. Released v7.5.0. % 0.07/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 : n015.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 16:54:57 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 18 conjectures. % 0.13/0.37 # There are 18 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 # 18 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 # 24610 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 # 24611 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 # 24612 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 # 24613 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 # 24614 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 # 24615 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 # 24616 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 # 24617 Satisfiable branch % 0.13/0.38 # Satisfiable branch found. % 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 # 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_93, negated_conjecture, (actual_world(skc5)=true)). % 0.13/0.38 cnf(i_0_103, negated_conjecture, (barrel(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_105, negated_conjecture, (event(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_94, negated_conjecture, (street(skc5,skc9)=true)). % 0.13/0.38 cnf(i_0_95, negated_conjecture, (placename(skc5,skc8)=true)). % 0.13/0.38 cnf(i_0_96, negated_conjecture, (hollywood_placename(skc5,skc8)=true)). % 0.13/0.38 cnf(i_0_97, negated_conjecture, (city(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_98, negated_conjecture, (chevy(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_99, negated_conjecture, (white(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_100, negated_conjecture, (dirty(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_101, negated_conjecture, (old(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_102, negated_conjecture, (lonely(skc5,skc9)=true)). % 0.13/0.38 cnf(i_0_104, negated_conjecture, (present(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_106, negated_conjecture, (of(skc5,skc8,skc7)=true)). % 0.13/0.38 cnf(i_0_107, negated_conjecture, (agent(skc5,skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_108, negated_conjecture, (in(skc5,skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_109, negated_conjecture, (down(skc5,skc6,skc9)=true)). % 0.13/0.38 cnf(i_0_57, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 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_60, plain, (ifeq2(barrel(X1,X2),true,event(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_84, plain, (ifeq2(hollywood_placename(X1,X2),true,placename(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_61, plain, (ifeq2(event(X1,X2),true,eventuality(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_67, plain, (ifeq2(street(X1,X2),true,way(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_77, plain, (ifeq2(placename(X1,X2),true,relname(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_85, plain, (ifeq2(city(X1,X2),true,location(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_62, plain, (ifeq2(eventuality(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_87, plain, (ifeq2(chevy(X1,X2),true,car(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_64, plain, (ifeq2(eventuality(X1,X2),true,specific(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_65, plain, (ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_66, plain, (ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_63, plain, (ifeq2(thing(X1,X2),true,singleton(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_68, plain, (ifeq2(way(X1,X2),true,artifact(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_69, plain, (ifeq2(artifact(X1,X2),true,object(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_76, plain, (ifeq2(object(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_70, plain, (ifeq2(object(X1,X2),true,entity(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_74, plain, (ifeq2(object(X1,X2),true,nonliving(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_75, plain, (ifeq2(object(X1,X2),true,impartial(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_71, plain, (ifeq2(entity(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_72, plain, (ifeq2(entity(X1,X2),true,specific(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_73, plain, (ifeq2(entity(X1,X2),true,existent(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_78, plain, (ifeq2(relname(X1,X2),true,relation(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_79, plain, (ifeq2(relation(X1,X2),true,abstraction(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_80, plain, (ifeq2(abstraction(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_83, plain, (ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_81, plain, (ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_82, plain, (ifeq2(abstraction(X1,X2),true,general(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_86, plain, (ifeq2(location(X1,X2),true,object(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_88, plain, (ifeq2(car(X1,X2),true,vehicle(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_89, plain, (ifeq2(vehicle(X1,X2),true,transport(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_90, plain, (ifeq2(transport(X1,X2),true,instrumentality(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_91, plain, (ifeq2(instrumentality(X1,X2),true,artifact(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_110, plain, (ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_111, plain, (ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_92, plain, (ifeq3(of(X1,X2,X3),true,ifeq3(of(X1,X4,X3),true,ifeq3(placename(X1,X2),true,ifeq3(placename(X1,X4),true,ifeq3(entity(X1,X3),true,X2,X4),X4),X4),X4),X4)=X4)). % 0.13/0.38 cnf(i_0_112, negated_conjecture, (a!=b)). % 0.13/0.38 cnf(i_0_131, plain, (X5=X5)). % 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_131, plain, (true=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_235, plain, (true=true), inference(extension_rule, [i_0_135])). % 0.13/0.38 cnf(i_0_245, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_246, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_247, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_243, plain, (ifeq3(true,actual_world(skc5),actual_world(skc5),actual_world(skc5))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_134])). % 0.13/0.38 cnf(i_0_254, 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_93, negated_conjecture, (actual_world(skc5)=true)). % 0.13/0.38 cnf(i_0_103, negated_conjecture, (barrel(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_105, negated_conjecture, (event(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_94, negated_conjecture, (street(skc5,skc9)=true)). % 0.13/0.38 cnf(i_0_95, negated_conjecture, (placename(skc5,skc8)=true)). % 0.13/0.38 cnf(i_0_96, negated_conjecture, (hollywood_placename(skc5,skc8)=true)). % 0.13/0.38 cnf(i_0_97, negated_conjecture, (city(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_98, negated_conjecture, (chevy(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_99, negated_conjecture, (white(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_100, negated_conjecture, (dirty(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_101, negated_conjecture, (old(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_102, negated_conjecture, (lonely(skc5,skc9)=true)). % 0.13/0.38 cnf(i_0_104, negated_conjecture, (present(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_106, negated_conjecture, (of(skc5,skc8,skc7)=true)). % 0.13/0.38 cnf(i_0_107, negated_conjecture, (agent(skc5,skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_108, negated_conjecture, (in(skc5,skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_109, negated_conjecture, (down(skc5,skc6,skc9)=true)). % 0.13/0.38 cnf(i_0_57, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 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_60, plain, (ifeq2(barrel(X1,X2),true,event(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_84, plain, (ifeq2(hollywood_placename(X1,X2),true,placename(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_61, plain, (ifeq2(event(X1,X2),true,eventuality(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_67, plain, (ifeq2(street(X1,X2),true,way(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_77, plain, (ifeq2(placename(X1,X2),true,relname(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_85, plain, (ifeq2(city(X1,X2),true,location(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_62, plain, (ifeq2(eventuality(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_87, plain, (ifeq2(chevy(X1,X2),true,car(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_64, plain, (ifeq2(eventuality(X1,X2),true,specific(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_65, plain, (ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_66, plain, (ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_63, plain, (ifeq2(thing(X1,X2),true,singleton(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_68, plain, (ifeq2(way(X1,X2),true,artifact(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_69, plain, (ifeq2(artifact(X1,X2),true,object(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_76, plain, (ifeq2(object(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_70, plain, (ifeq2(object(X1,X2),true,entity(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_74, plain, (ifeq2(object(X1,X2),true,nonliving(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_75, plain, (ifeq2(object(X1,X2),true,impartial(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_71, plain, (ifeq2(entity(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_72, plain, (ifeq2(entity(X1,X2),true,specific(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_73, plain, (ifeq2(entity(X1,X2),true,existent(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_78, plain, (ifeq2(relname(X1,X2),true,relation(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_79, plain, (ifeq2(relation(X1,X2),true,abstraction(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_80, plain, (ifeq2(abstraction(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_83, plain, (ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_81, plain, (ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_82, plain, (ifeq2(abstraction(X1,X2),true,general(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_86, plain, (ifeq2(location(X1,X2),true,object(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_88, plain, (ifeq2(car(X1,X2),true,vehicle(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_89, plain, (ifeq2(vehicle(X1,X2),true,transport(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_90, plain, (ifeq2(transport(X1,X2),true,instrumentality(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_91, plain, (ifeq2(instrumentality(X1,X2),true,artifact(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_110, plain, (ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_111, plain, (ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_92, plain, (ifeq3(of(X1,X2,X3),true,ifeq3(of(X1,X4,X3),true,ifeq3(placename(X1,X2),true,ifeq3(placename(X1,X4),true,ifeq3(entity(X1,X3),true,X2,X4),X4),X4),X4),X4)=X4)). % 0.13/0.38 cnf(i_0_112, negated_conjecture, (a!=b)). % 0.13/0.38 cnf(i_0_131, plain, (X5=X5)). % 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_131, plain, (true=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_235, plain, (true=true), inference(extension_rule, [i_0_135])). % 0.13/0.38 cnf(i_0_245, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_246, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_247, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_243, plain, (ifeq3(true,actual_world(skc5),actual_world(skc5),actual_world(skc5))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_134])). % 0.13/0.38 cnf(i_0_254, 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_93, negated_conjecture, (actual_world(skc5)=true)). % 0.13/0.38 cnf(i_0_103, negated_conjecture, (barrel(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_105, negated_conjecture, (event(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_94, negated_conjecture, (street(skc5,skc9)=true)). % 0.13/0.38 cnf(i_0_95, negated_conjecture, (placename(skc5,skc8)=true)). % 0.13/0.38 cnf(i_0_96, negated_conjecture, (hollywood_placename(skc5,skc8)=true)). % 0.13/0.38 cnf(i_0_97, negated_conjecture, (city(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_98, negated_conjecture, (chevy(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_99, negated_conjecture, (white(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_100, negated_conjecture, (dirty(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_101, negated_conjecture, (old(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_102, negated_conjecture, (lonely(skc5,skc9)=true)). % 0.13/0.38 cnf(i_0_104, negated_conjecture, (present(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_106, negated_conjecture, (of(skc5,skc8,skc7)=true)). % 0.13/0.38 cnf(i_0_107, negated_conjecture, (agent(skc5,skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_108, negated_conjecture, (in(skc5,skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_109, negated_conjecture, (down(skc5,skc6,skc9)=true)). % 0.13/0.38 cnf(i_0_57, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 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_60, plain, (ifeq2(barrel(X1,X2),true,event(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_84, plain, (ifeq2(hollywood_placename(X1,X2),true,placename(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_61, plain, (ifeq2(event(X1,X2),true,eventuality(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_67, plain, (ifeq2(street(X1,X2),true,way(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_77, plain, (ifeq2(placename(X1,X2),true,relname(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_85, plain, (ifeq2(city(X1,X2),true,location(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_62, plain, (ifeq2(eventuality(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_87, plain, (ifeq2(chevy(X1,X2),true,car(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_64, plain, (ifeq2(eventuality(X1,X2),true,specific(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_65, plain, (ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_66, plain, (ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_63, plain, (ifeq2(thing(X1,X2),true,singleton(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_68, plain, (ifeq2(way(X1,X2),true,artifact(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_69, plain, (ifeq2(artifact(X1,X2),true,object(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_76, plain, (ifeq2(object(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_70, plain, (ifeq2(object(X1,X2),true,entity(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_74, plain, (ifeq2(object(X1,X2),true,nonliving(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_75, plain, (ifeq2(object(X1,X2),true,impartial(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_71, plain, (ifeq2(entity(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_72, plain, (ifeq2(entity(X1,X2),true,specific(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_73, plain, (ifeq2(entity(X1,X2),true,existent(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_78, plain, (ifeq2(relname(X1,X2),true,relation(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_79, plain, (ifeq2(relation(X1,X2),true,abstraction(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_80, plain, (ifeq2(abstraction(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_83, plain, (ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_81, plain, (ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_82, plain, (ifeq2(abstraction(X1,X2),true,general(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_86, plain, (ifeq2(location(X1,X2),true,object(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_88, plain, (ifeq2(car(X1,X2),true,vehicle(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_89, plain, (ifeq2(vehicle(X1,X2),true,transport(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_90, plain, (ifeq2(transport(X1,X2),true,instrumentality(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_91, plain, (ifeq2(instrumentality(X1,X2),true,artifact(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_110, plain, (ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_111, plain, (ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_92, plain, (ifeq3(of(X1,X2,X3),true,ifeq3(of(X1,X4,X3),true,ifeq3(placename(X1,X2),true,ifeq3(placename(X1,X4),true,ifeq3(entity(X1,X3),true,X2,X4),X4),X4),X4),X4)=X4)). % 0.13/0.38 cnf(i_0_112, negated_conjecture, (a!=b)). % 0.13/0.38 cnf(i_0_131, plain, (X5=X5)). % 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_131, plain, (true=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_235, plain, (true=true), inference(extension_rule, [i_0_135])). % 0.13/0.38 cnf(i_0_245, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_246, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_247, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_243, plain, (ifeq3(true,actual_world(skc5),actual_world(skc5),actual_world(skc5))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_134])). % 0.13/0.38 cnf(i_0_254, 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_93, negated_conjecture, (actual_world(skc5)=true)). % 0.13/0.38 cnf(i_0_103, negated_conjecture, (barrel(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_105, negated_conjecture, (event(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_94, negated_conjecture, (street(skc5,skc9)=true)). % 0.13/0.38 cnf(i_0_95, negated_conjecture, (placename(skc5,skc8)=true)). % 0.13/0.38 cnf(i_0_96, negated_conjecture, (hollywood_placename(skc5,skc8)=true)). % 0.13/0.38 cnf(i_0_97, negated_conjecture, (city(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_98, negated_conjecture, (chevy(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_99, negated_conjecture, (white(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_100, negated_conjecture, (dirty(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_101, negated_conjecture, (old(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_102, negated_conjecture, (lonely(skc5,skc9)=true)). % 0.13/0.38 cnf(i_0_104, negated_conjecture, (present(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_106, negated_conjecture, (of(skc5,skc8,skc7)=true)). % 0.13/0.38 cnf(i_0_107, negated_conjecture, (agent(skc5,skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_108, negated_conjecture, (in(skc5,skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_109, negated_conjecture, (down(skc5,skc6,skc9)=true)). % 0.13/0.38 cnf(i_0_57, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 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_60, plain, (ifeq2(barrel(X1,X2),true,event(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_84, plain, (ifeq2(hollywood_placename(X1,X2),true,placename(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_61, plain, (ifeq2(event(X1,X2),true,eventuality(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_67, plain, (ifeq2(street(X1,X2),true,way(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_77, plain, (ifeq2(placename(X1,X2),true,relname(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_85, plain, (ifeq2(city(X1,X2),true,location(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_62, plain, (ifeq2(eventuality(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_87, plain, (ifeq2(chevy(X1,X2),true,car(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_64, plain, (ifeq2(eventuality(X1,X2),true,specific(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_65, plain, (ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_66, plain, (ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_63, plain, (ifeq2(thing(X1,X2),true,singleton(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_68, plain, (ifeq2(way(X1,X2),true,artifact(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_69, plain, (ifeq2(artifact(X1,X2),true,object(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_76, plain, (ifeq2(object(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_70, plain, (ifeq2(object(X1,X2),true,entity(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_74, plain, (ifeq2(object(X1,X2),true,nonliving(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_75, plain, (ifeq2(object(X1,X2),true,impartial(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_71, plain, (ifeq2(entity(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_72, plain, (ifeq2(entity(X1,X2),true,specific(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_73, plain, (ifeq2(entity(X1,X2),true,existent(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_78, plain, (ifeq2(relname(X1,X2),true,relation(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_79, plain, (ifeq2(relation(X1,X2),true,abstraction(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_80, plain, (ifeq2(abstraction(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_83, plain, (ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_81, plain, (ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_82, plain, (ifeq2(abstraction(X1,X2),true,general(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_86, plain, (ifeq2(location(X1,X2),true,object(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_88, plain, (ifeq2(car(X1,X2),true,vehicle(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_89, plain, (ifeq2(vehicle(X1,X2),true,transport(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_90, plain, (ifeq2(transport(X1,X2),true,instrumentality(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_91, plain, (ifeq2(instrumentality(X1,X2),true,artifact(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_110, plain, (ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_111, plain, (ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_92, plain, (ifeq3(of(X1,X2,X3),true,ifeq3(of(X1,X4,X3),true,ifeq3(placename(X1,X2),true,ifeq3(placename(X1,X4),true,ifeq3(entity(X1,X3),true,X2,X4),X4),X4),X4),X4)=X4)). % 0.13/0.38 cnf(i_0_112, negated_conjecture, (a!=b)). % 0.13/0.38 cnf(i_0_131, plain, (X5=X5)). % 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_131, plain, (true=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_235, plain, (true=true), inference(extension_rule, [i_0_135])). % 0.13/0.38 cnf(i_0_245, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_246, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_247, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_243, plain, (ifeq3(true,actual_world(skc5),actual_world(skc5),actual_world(skc5))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_134])). % 0.13/0.38 cnf(i_0_254, 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_93, negated_conjecture, (actual_world(skc5)=true)). % 0.13/0.38 cnf(i_0_103, negated_conjecture, (barrel(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_105, negated_conjecture, (event(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_94, negated_conjecture, (street(skc5,skc9)=true)). % 0.13/0.38 cnf(i_0_95, negated_conjecture, (placename(skc5,skc8)=true)). % 0.13/0.38 cnf(i_0_96, negated_conjecture, (hollywood_placename(skc5,skc8)=true)). % 0.13/0.38 cnf(i_0_97, negated_conjecture, (city(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_98, negated_conjecture, (chevy(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_99, negated_conjecture, (white(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_100, negated_conjecture, (dirty(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_101, negated_conjecture, (old(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_102, negated_conjecture, (lonely(skc5,skc9)=true)). % 0.13/0.38 cnf(i_0_104, negated_conjecture, (present(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_106, negated_conjecture, (of(skc5,skc8,skc7)=true)). % 0.13/0.38 cnf(i_0_107, negated_conjecture, (agent(skc5,skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_108, negated_conjecture, (in(skc5,skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_109, negated_conjecture, (down(skc5,skc6,skc9)=true)). % 0.13/0.38 cnf(i_0_57, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 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_60, plain, (ifeq2(barrel(X1,X2),true,event(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_84, plain, (ifeq2(hollywood_placename(X1,X2),true,placename(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_61, plain, (ifeq2(event(X1,X2),true,eventuality(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_67, plain, (ifeq2(street(X1,X2),true,way(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_77, plain, (ifeq2(placename(X1,X2),true,relname(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_85, plain, (ifeq2(city(X1,X2),true,location(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_62, plain, (ifeq2(eventuality(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_87, plain, (ifeq2(chevy(X1,X2),true,car(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_64, plain, (ifeq2(eventuality(X1,X2),true,specific(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_65, plain, (ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_66, plain, (ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_63, plain, (ifeq2(thing(X1,X2),true,singleton(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_68, plain, (ifeq2(way(X1,X2),true,artifact(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_69, plain, (ifeq2(artifact(X1,X2),true,object(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_76, plain, (ifeq2(object(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_70, plain, (ifeq2(object(X1,X2),true,entity(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_74, plain, (ifeq2(object(X1,X2),true,nonliving(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_75, plain, (ifeq2(object(X1,X2),true,impartial(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_71, plain, (ifeq2(entity(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_72, plain, (ifeq2(entity(X1,X2),true,specific(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_73, plain, (ifeq2(entity(X1,X2),true,existent(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_78, plain, (ifeq2(relname(X1,X2),true,relation(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_79, plain, (ifeq2(relation(X1,X2),true,abstraction(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_80, plain, (ifeq2(abstraction(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_83, plain, (ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_81, plain, (ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_82, plain, (ifeq2(abstraction(X1,X2),true,general(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_86, plain, (ifeq2(location(X1,X2),true,object(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_88, plain, (ifeq2(car(X1,X2),true,vehicle(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_89, plain, (ifeq2(vehicle(X1,X2),true,transport(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_90, plain, (ifeq2(transport(X1,X2),true,instrumentality(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_91, plain, (ifeq2(instrumentality(X1,X2),true,artifact(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_110, plain, (ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_111, plain, (ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b)=b)). % 0.13/0.38 cnf(i_0_92, plain, (ifeq3(of(X1,X2,X3),true,ifeq3(of(X1,X4,X3),true,ifeq3(placename(X1,X2),true,ifeq3(placename(X1,X4),true,ifeq3(entity(X1,X3),true,X2,X4),X4),X4),X4),X4)=X4)). % 0.13/0.38 cnf(i_0_112, negated_conjecture, (a!=b)). % 0.13/0.38 cnf(i_0_131, plain, (X5=X5)). % 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_131, plain, (true=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_235, plain, (true=true), inference(extension_rule, [i_0_135])). % 0.13/0.38 cnf(i_0_245, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_246, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_247, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.38 cnf(i_0_243, plain, (ifeq3(true,actual_world(skc5),actual_world(skc5),actual_world(skc5))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_134])). % 0.13/0.38 cnf(i_0_254, 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_93, negated_conjecture, (actual_world(skc5)=true)). % 0.13/0.38 cnf(i_0_103, negated_conjecture, (barrel(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_105, negated_conjecture, (event(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_94, negated_conjecture, (street(skc5,skc9)=true)). % 0.13/0.38 cnf(i_0_95, negated_conjecture, (placename(skc5,skc8)=true)). % 0.13/0.38 cnf(i_0_96, negated_conjecture, (hollywood_placename(skc5,skc8)=true)). % 0.13/0.38 cnf(i_0_97, negated_conjecture, (city(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_98, negated_conjecture, (chevy(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_99, negated_conjecture, (white(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_100, negated_conjecture, (dirty(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_101, negated_conjecture, (old(skc5,skc7)=true)). % 0.13/0.38 cnf(i_0_102, negated_conjecture, (lonely(skc5,skc9)=true)). % 0.13/0.38 cnf(i_0_104, negated_conjecture, (present(skc5,skc6)=true)). % 0.13/0.38 cnf(i_0_106, negated_conjecture, (of(skc5,skc8,skc7)=true)). % 0.13/0.38 cnf(i_0_107, negated_conjecture, (agent(skc5,skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_108, negated_conjecture, (in(skc5,skc6,skc7)=true)). % 0.13/0.38 cnf(i_0_109, negated_conjecture, (down(skc5,skc6,skc9)=true)). % 0.13/0.38 cnf(i_0_57, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 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_60, plain, (ifeq2(barrel(X1,X2),true,event(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_84, plain, (ifeq2(hollywood_placename(X1,X2),true,placename(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_61, plain, (ifeq2(event(X1,X2),true,eventuality(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_67, plain, (ifeq2(street(X1,X2),true,way(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_77, plain, (ifeq2(placename(X1,X2),true,relname(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_85, plain, (ifeq2(city(X1,X2),true,location(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_62, plain, (ifeq2(eventuality(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_87, plain, (ifeq2(chevy(X1,X2),true,car(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_64, plain, (ifeq2(eventuality(X1,X2),true,specific(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_65, plain, (ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_66, plain, (ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_63, plain, (ifeq2(thing(X1,X2),true,singleton(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_68, plain, (ifeq2(way(X1,X2),true,artifact(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_69, plain, (ifeq2(artifact(X1,X2),true,object(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_76, plain, (ifeq2(object(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_70, plain, (ifeq2(object(X1,X2),true,entity(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_74, plain, (ifeq2(object(X1,X2),true,nonliving(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_75, plain, (ifeq2(object(X1,X2),true,impartial(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_71, plain, (ifeq2(entity(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_72, plain, (ifeq2(entity(X1,X2),true,specific(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_73, plain, (ifeq2(entity(X1,X2),true,existent(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_78, plain, (ifeq2(relname(X1,X2),true,relation(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_79, plain, (ifeq2(relation(X1,X2),true,abstraction(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_80, plain, (ifeq2(abstraction(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_83, plain, (ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_81, plain, (ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_82, plain, (ifeq2(abstraction(X1,X2),true,general(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_86, plain, (ifeq2(location(X1,X2),true,object(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_88, plain, (ifeq2(car(X1,X2),true,vehicle(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_89, plain, (ifeq2(vehicle(X1,X2),true,transport(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_90, plain, (ifeq2(transport(X1,X2),true,instrumentality(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_91, plain, (ifeq2(instrumentality(X1,X2),true,artifact(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_110, plain, (ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b)=b)). % 0.13/0.39 cnf(i_0_111, plain, (ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b)=b)). % 0.13/0.39 cnf(i_0_92, plain, (ifeq3(of(X1,X2,X3),true,ifeq3(of(X1,X4,X3),true,ifeq3(placename(X1,X2),true,ifeq3(placename(X1,X4),true,ifeq3(entity(X1,X3),true,X2,X4),X4),X4),X4),X4)=X4)). % 0.13/0.39 cnf(i_0_112, negated_conjecture, (a!=b)). % 0.13/0.39 cnf(i_0_131, plain, (X5=X5)). % 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_131, plain, (true=true), inference(start_rule)). % 0.13/0.39 cnf(i_0_235, plain, (true=true), inference(extension_rule, [i_0_135])). % 0.13/0.39 cnf(i_0_245, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.39 cnf(i_0_246, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.39 cnf(i_0_247, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.39 cnf(i_0_243, plain, (ifeq3(true,actual_world(skc5),actual_world(skc5),actual_world(skc5))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_134])). % 0.13/0.39 cnf(i_0_254, 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 # Satisfiable branch found. % 0.13/0.39 # There were 1 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 0 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 0 successful branch saturations after the branch. % 0.13/0.39 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_93, negated_conjecture, (actual_world(skc5)=true)). % 0.13/0.39 cnf(i_0_103, negated_conjecture, (barrel(skc5,skc6)=true)). % 0.13/0.39 cnf(i_0_105, negated_conjecture, (event(skc5,skc6)=true)). % 0.13/0.39 cnf(i_0_94, negated_conjecture, (street(skc5,skc9)=true)). % 0.13/0.39 cnf(i_0_95, negated_conjecture, (placename(skc5,skc8)=true)). % 0.13/0.39 cnf(i_0_96, negated_conjecture, (hollywood_placename(skc5,skc8)=true)). % 0.13/0.39 cnf(i_0_97, negated_conjecture, (city(skc5,skc7)=true)). % 0.13/0.39 cnf(i_0_98, negated_conjecture, (chevy(skc5,skc7)=true)). % 0.13/0.39 cnf(i_0_99, negated_conjecture, (white(skc5,skc7)=true)). % 0.13/0.39 cnf(i_0_100, negated_conjecture, (dirty(skc5,skc7)=true)). % 0.13/0.39 cnf(i_0_101, negated_conjecture, (old(skc5,skc7)=true)). % 0.13/0.39 cnf(i_0_102, negated_conjecture, (lonely(skc5,skc9)=true)). % 0.13/0.39 cnf(i_0_104, negated_conjecture, (present(skc5,skc6)=true)). % 0.13/0.39 cnf(i_0_106, negated_conjecture, (of(skc5,skc8,skc7)=true)). % 0.13/0.39 cnf(i_0_107, negated_conjecture, (agent(skc5,skc6,skc7)=true)). % 0.13/0.39 cnf(i_0_108, negated_conjecture, (in(skc5,skc6,skc7)=true)). % 0.13/0.39 cnf(i_0_109, negated_conjecture, (down(skc5,skc6,skc9)=true)). % 0.13/0.39 cnf(i_0_57, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 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_60, plain, (ifeq2(barrel(X1,X2),true,event(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_84, plain, (ifeq2(hollywood_placename(X1,X2),true,placename(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_61, plain, (ifeq2(event(X1,X2),true,eventuality(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_67, plain, (ifeq2(street(X1,X2),true,way(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_77, plain, (ifeq2(placename(X1,X2),true,relname(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_85, plain, (ifeq2(city(X1,X2),true,location(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_62, plain, (ifeq2(eventuality(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_87, plain, (ifeq2(chevy(X1,X2),true,car(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_64, plain, (ifeq2(eventuality(X1,X2),true,specific(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_65, plain, (ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_66, plain, (ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_63, plain, (ifeq2(thing(X1,X2),true,singleton(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_68, plain, (ifeq2(way(X1,X2),true,artifact(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_69, plain, (ifeq2(artifact(X1,X2),true,object(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_76, plain, (ifeq2(object(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_70, plain, (ifeq2(object(X1,X2),true,entity(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_74, plain, (ifeq2(object(X1,X2),true,nonliving(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_75, plain, (ifeq2(object(X1,X2),true,impartial(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_71, plain, (ifeq2(entity(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_72, plain, (ifeq2(entity(X1,X2),true,specific(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_73, plain, (ifeq2(entity(X1,X2),true,existent(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_78, plain, (ifeq2(relname(X1,X2),true,relation(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_79, plain, (ifeq2(relation(X1,X2),true,abstraction(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_80, plain, (ifeq2(abstraction(X1,X2),true,thing(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_83, plain, (ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_81, plain, (ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_82, plain, (ifeq2(abstraction(X1,X2),true,general(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_86, plain, (ifeq2(location(X1,X2),true,object(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_88, plain, (ifeq2(car(X1,X2),true,vehicle(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_89, plain, (ifeq2(vehicle(X1,X2),true,transport(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_90, plain, (ifeq2(transport(X1,X2),true,instrumentality(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_91, plain, (ifeq2(instrumentality(X1,X2),true,artifact(X1,X2),true)=true)). % 0.13/0.39 cnf(i_0_110, plain, (ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b)=b)). % 0.13/0.39 cnf(i_0_111, plain, (ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b)=b)). % 0.13/0.39 cnf(i_0_92, plain, (ifeq3(of(X1,X2,X3),true,ifeq3(of(X1,X4,X3),true,ifeq3(placename(X1,X2),true,ifeq3(placename(X1,X4),true,ifeq3(entity(X1,X3),true,X2,X4),X4),X4),X4),X4)=X4)). % 0.13/0.39 cnf(i_0_112, negated_conjecture, (a!=b)). % 0.13/0.39 cnf(i_0_131, plain, (X5=X5)). % 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_131, plain, (true=true), inference(start_rule)). % 0.13/0.39 cnf(i_0_235, plain, (true=true), inference(extension_rule, [i_0_135])). % 0.13/0.39 cnf(i_0_245, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.39 cnf(i_0_246, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.39 cnf(i_0_247, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_93])). % 0.13/0.39 cnf(i_0_243, plain, (ifeq3(true,actual_world(skc5),actual_world(skc5),actual_world(skc5))=ifeq3(true,true,true,true)), inference(extension_rule, [i_0_134])). % 0.13/0.39 cnf(i_0_254, 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 (24610) has found a proof. % 0.13/0.39 % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------