TSTP Solution File: NLP111-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP111-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 : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 02:12:43 EDT 2022
% Result : Satisfiable 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NLP111-10 : TPTP v8.1.0. Released v7.5.0.
% 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Thu Jun 30 20:34:45 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.35 # No SInE strategy applied
% 0.12/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.35 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.35 #
% 0.12/0.35 # Presaturation interreduction done
% 0.12/0.35 # Number of axioms: 54 Number of unprocessed: 54
% 0.12/0.35 # Tableaux proof search.
% 0.12/0.35 # APR header successfully linked.
% 0.12/0.35 # Hello from C++
% 0.12/0.35 # The folding up rule is enabled...
% 0.12/0.35 # Local unification is enabled...
% 0.12/0.35 # Any saturation attempts will use folding labels...
% 0.12/0.35 # 54 beginning clauses after preprocessing and clausification
% 0.12/0.35 # Creating start rules for all 17 conjectures.
% 0.12/0.35 # There are 17 start rule candidates:
% 0.12/0.35 # Found 54 unit axioms.
% 0.12/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.35 # 17 start rule tableaux created.
% 0.12/0.35 # 0 extension rule candidate clauses
% 0.12/0.35 # 54 unit axiom clauses
% 0.12/0.35
% 0.12/0.35 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # 25194 Satisfiable branch
% 0.12/0.36 # Satisfiable branch found.
% 0.12/0.36 # There were 1 total branch saturation attempts.
% 0.12/0.36 # There were 0 of these attempts blocked.
% 0.12/0.36 # There were 0 deferred branch saturation attempts.
% 0.12/0.36 # There were 0 free duplicated saturations.
% 0.12/0.36 # There were 0 total successful branch saturations.
% 0.12/0.36 # There were 0 successful branch saturations in interreduction.
% 0.12/0.36 # There were 0 successful branch saturations on the branch.
% 0.12/0.36 # There were 0 successful branch saturations after the branch.
% 0.12/0.36 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # Begin clausification derivation
% 0.12/0.36
% 0.12/0.36 # End clausification derivation
% 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.36 cnf(i_0_88, negated_conjecture, (actual_world(skc5)=true)).
% 0.12/0.36 cnf(i_0_94, negated_conjecture, (event(skc5,skc6)=true)).
% 0.12/0.36 cnf(i_0_91, negated_conjecture, (drink(skc5,skc6)=true)).
% 0.12/0.36 cnf(i_0_95, negated_conjecture, (coffee(skc5,skc10)=true)).
% 0.12/0.36 cnf(i_0_90, negated_conjecture, (human_person(skc5,skc7)=true)).
% 0.12/0.36 cnf(i_0_89, negated_conjecture, (restaurant(skc5,skc8)=true)).
% 0.12/0.36 cnf(i_0_92, negated_conjecture, (nonreflexive(skc5,skc6)=true)).
% 0.12/0.36 cnf(i_0_93, negated_conjecture, (past(skc5,skc6)=true)).
% 0.12/0.36 cnf(i_0_55, plain, (ifeq3(X1,X1,X2,X3)=X2)).
% 0.12/0.36 cnf(i_0_56, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.36 cnf(i_0_97, negated_conjecture, (agent(skc5,skc6,skc7)=true)).
% 0.12/0.36 cnf(i_0_96, negated_conjecture, (patient(skc5,skc6,skc10)=true)).
% 0.12/0.36 cnf(i_0_98, negated_conjecture, (ifeq3(in(skc5,X1,skc8),true,ifeq3(customer(skc5,X1),true,see(skc5,skf1(X2)),true),true)=true)).
% 0.12/0.36 cnf(i_0_101, negated_conjecture, (ifeq3(in(skc5,X1,skc8),true,ifeq3(customer(skc5,X1),true,event(skc5,skf1(X2)),true),true)=true)).
% 0.12/0.36 cnf(i_0_99, negated_conjecture, (ifeq3(in(skc5,X1,skc8),true,ifeq3(customer(skc5,X1),true,nonreflexive(skc5,skf1(X2)),true),true)=true)).
% 0.12/0.36 cnf(i_0_57, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.36 cnf(i_0_58, plain, (ifeq3(see(X1,X2),true,event(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_59, plain, (ifeq3(event(X1,X2),true,eventuality(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_60, plain, (ifeq3(eventuality(X1,X2),true,thing(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_62, plain, (ifeq3(eventuality(X1,X2),true,specific(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_63, plain, (ifeq3(eventuality(X1,X2),true,nonexistent(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_65, plain, (ifeq3(drink(X1,X2),true,event(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_100, negated_conjecture, (ifeq3(in(skc5,X1,skc8),true,ifeq3(customer(skc5,X1),true,past(skc5,skf1(X2)),true),true)=true)).
% 0.12/0.36 cnf(i_0_83, plain, (ifeq3(customer(X1,X2),true,human_person(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_102, negated_conjecture, (ifeq3(in(skc5,X1,skc8),true,ifeq3(customer(skc5,X1),true,patient(skc5,skf1(X2),skc7),true),true)=true)).
% 0.12/0.36 cnf(i_0_66, plain, (ifeq3(coffee(X1,X2),true,beverage(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_64, plain, (ifeq3(eventuality(X1,X2),true,unisex(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_77, plain, (ifeq3(human_person(X1,X2),true,organism(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_61, plain, (ifeq3(thing(X1,X2),true,singleton(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_67, plain, (ifeq3(beverage(X1,X2),true,food(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_68, plain, (ifeq3(food(X1,X2),true,substance_matter(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_69, plain, (ifeq3(substance_matter(X1,X2),true,object(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_81, plain, (ifeq3(human_person(X1,X2),true,human(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_82, plain, (ifeq3(human_person(X1,X2),true,animate(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_84, plain, (ifeq3(restaurant(X1,X2),true,building(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_103, negated_conjecture, (ifeq3(in(skc5,X1,skc8),true,ifeq3(customer(skc5,X1),true,agent(skc5,skf1(X1),X1),true),true)=true)).
% 0.12/0.36 cnf(i_0_76, plain, (ifeq3(object(X1,X2),true,unisex(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_70, plain, (ifeq3(object(X1,X2),true,entity(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_74, plain, (ifeq3(object(X1,X2),true,nonliving(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_75, plain, (ifeq3(object(X1,X2),true,impartial(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_71, plain, (ifeq3(entity(X1,X2),true,thing(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_72, plain, (ifeq3(entity(X1,X2),true,specific(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_73, plain, (ifeq3(entity(X1,X2),true,existent(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_78, plain, (ifeq3(organism(X1,X2),true,entity(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_79, plain, (ifeq3(organism(X1,X2),true,impartial(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_80, plain, (ifeq3(organism(X1,X2),true,living(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_85, plain, (ifeq3(building(X1,X2),true,artifact(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_86, plain, (ifeq3(artifact(X1,X2),true,object(X1,X2),true)=true)).
% 0.12/0.36 cnf(i_0_105, plain, (ifeq2(tuple2(nonexistent(X1,X2),existent(X1,X2)),tuple2(true,true),a,b)=b)).
% 0.12/0.36 cnf(i_0_104, plain, (ifeq2(tuple2(nonliving(X1,X2),living(X1,X2)),tuple2(true,true),a,b)=b)).
% 0.12/0.36 cnf(i_0_106, plain, (ifeq2(tuple2(nonliving(X1,X2),animate(X1,X2)),tuple2(true,true),a,b)=b)).
% 0.12/0.36 cnf(i_0_107, plain, (ifeq(tuple(patient(X1,X2,X3),nonreflexive(X1,X2),agent(X1,X2,X3)),tuple(true,true,true),a,b)=b)).
% 0.12/0.36 cnf(i_0_87, plain, (ifeq3(agent(X1,X2,X3),true,ifeq3(patient(X1,X2,X4),true,ifeq3(drink(X1,X2),true,beverage(X1,X4),true),true),true)=true)).
% 0.12/0.36 cnf(i_0_108, negated_conjecture, (a!=b)).
% 0.12/0.36 cnf(i_0_126, plain, (X5=X5)).
% 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.36 # Begin printing tableau
% 0.12/0.36 # Found 9 steps
% 0.12/0.36 cnf(i_0_126, plain, (actual_world(skc5)=actual_world(skc5)), inference(start_rule)).
% 0.12/0.36 cnf(i_0_223, plain, (actual_world(skc5)=actual_world(skc5)), inference(extension_rule, [i_0_130])).
% 0.12/0.36 cnf(i_0_233, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_88])).
% 0.12/0.36 cnf(i_0_234, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_88])).
% 0.12/0.36 cnf(i_0_235, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_88])).
% 0.12/0.36 cnf(i_0_231, plain, (ifeq3(actual_world(skc5),actual_world(skc5),actual_world(skc5),actual_world(skc5))=ifeq3(actual_world(skc5),true,true,true)), inference(extension_rule, [i_0_131])).
% 0.12/0.36 cnf(i_0_763, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_88])).
% 0.12/0.36 cnf(i_0_764, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_88])).
% 0.12/0.36 cnf(i_0_765, plain, (actual_world(skc5)!=true), inference(closure_rule, [i_0_88])).
% 0.12/0.36 # End printing tableau
% 0.12/0.36 # SZS output end
% 0.12/0.36 # Branches closed with saturation will be marked with an "s"
% 0.12/0.36 # Child (25194) has found a proof.
% 0.12/0.36
% 0.12/0.36 # Proof search is over...
% 0.12/0.36 # Freeing feature tree
%------------------------------------------------------------------------------