TSTP Solution File: NLP103-1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : NLP103-1 : TPTP v8.1.0. Released v2.4.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 : n011.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:37 EDT 2022

% Result   : Satisfiable 0.18s 0.38s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NLP103-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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.33  % Computer : n011.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Fri Jul  1 02:29:48 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.36  # No SInE strategy applied
% 0.18/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.36  #
% 0.18/0.36  # Presaturation interreduction done
% 0.18/0.36  # Number of axioms: 38 Number of unprocessed: 38
% 0.18/0.36  # Tableaux proof search.
% 0.18/0.36  # APR header successfully linked.
% 0.18/0.36  # Hello from C++
% 0.18/0.37  # The folding up rule is enabled...
% 0.18/0.37  # Local unification is enabled...
% 0.18/0.37  # Any saturation attempts will use folding labels...
% 0.18/0.37  # 38 beginning clauses after preprocessing and clausification
% 0.18/0.37  # Creating start rules for all 38 conjectures.
% 0.18/0.37  # There are 38 start rule candidates:
% 0.18/0.37  # Found 2 unit axioms.
% 0.18/0.37  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.37  # 38 start rule tableaux created.
% 0.18/0.37  # 36 extension rule candidate clauses
% 0.18/0.37  # 2 unit axiom clauses
% 0.18/0.37  
% 0.18/0.37  # Requested 8, 32 cores available to the main process.
% 0.18/0.38  # Ran out of tableaux, making start rules for all clauses
% 0.18/0.38  # 17990 Satisfiable branch
% 0.18/0.38  # Satisfiable branch found.
% 0.18/0.38  # There were 1 total branch saturation attempts.
% 0.18/0.38  # There were 0 of these attempts blocked.
% 0.18/0.38  # There were 0 deferred branch saturation attempts.
% 0.18/0.38  # There were 0 free duplicated saturations.
% 0.18/0.38  # There were 0 total successful branch saturations.
% 0.18/0.38  # There were 0 successful branch saturations in interreduction.
% 0.18/0.38  # There were 0 successful branch saturations on the branch.
% 0.18/0.38  # There were 0 successful branch saturations after the branch.
% 0.18/0.38  # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.38  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.38  # Begin clausification derivation
% 0.18/0.38  
% 0.18/0.38  # End clausification derivation
% 0.18/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.38  cnf(i_0_39, negated_conjecture, (actual_world(skc20))).
% 0.18/0.38  cnf(i_0_40, negated_conjecture, (actual_world(skc8))).
% 0.18/0.38  cnf(i_0_48, negated_conjecture, (coffee(skc8,skc9)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_49, negated_conjecture, (restaurant(skc8,skc10)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_41, negated_conjecture, (event(skc20,skc21)|ssSkC0)).
% 0.18/0.38  cnf(i_0_42, negated_conjecture, (past(skc20,skc21)|ssSkC0)).
% 0.18/0.38  cnf(i_0_43, negated_conjecture, (nonreflexive(skc20,skc21)|ssSkC0)).
% 0.18/0.38  cnf(i_0_44, negated_conjecture, (drink(skc20,skc21)|ssSkC0)).
% 0.18/0.38  cnf(i_0_45, negated_conjecture, (coffee(skc20,skc25)|ssSkC0)).
% 0.18/0.38  cnf(i_0_46, negated_conjecture, (human_person(skc20,skc22)|ssSkC0)).
% 0.18/0.38  cnf(i_0_47, negated_conjecture, (restaurant(skc20,skc23)|ssSkC0)).
% 0.18/0.38  cnf(i_0_50, negated_conjecture, (patient(skc20,skc21,skc25)|ssSkC0)).
% 0.18/0.38  cnf(i_0_51, negated_conjecture, (agent(skc20,skc21,skc22)|ssSkC0)).
% 0.18/0.38  cnf(i_0_60, negated_conjecture, (event(skc8,skf9(X1))|~customer(skc8,X2)|~in(skc8,X2,skc10)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_61, negated_conjecture, (event(skc8,skf8(X1))|~customer(skc8,X2)|~in(skc8,X2,skc10)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_59, negated_conjecture, (past(skc8,skf9(X1))|~customer(skc8,X2)|~in(skc8,X2,skc10)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_52, negated_conjecture, (event(skc20,skf16(X1))|ssSkC0|~customer(skc20,X2)|~in(skc20,X2,skc23))).
% 0.18/0.38  cnf(i_0_53, negated_conjecture, (past(skc20,skf16(X1))|ssSkC0|~customer(skc20,X2)|~in(skc20,X2,skc23))).
% 0.18/0.38  cnf(i_0_62, negated_conjecture, (past(skc8,skf8(X1))|~customer(skc8,X2)|~in(skc8,X2,skc10)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_58, negated_conjecture, (nonreflexive(skc8,skf9(X1))|~customer(skc8,X2)|~in(skc8,X2,skc10)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_63, negated_conjecture, (nonreflexive(skc8,skf8(X1))|~customer(skc8,X2)|~in(skc8,X2,skc10)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_57, negated_conjecture, (drink(skc8,skf9(X1))|~customer(skc8,X2)|~in(skc8,X2,skc10)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_54, negated_conjecture, (nonreflexive(skc20,skf16(X1))|ssSkC0|~customer(skc20,X2)|~in(skc20,X2,skc23))).
% 0.18/0.38  cnf(i_0_56, negated_conjecture, (human_person(skc8,skf10(X1))|~customer(skc8,X2)|~in(skc8,X2,skc10)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_64, negated_conjecture, (see(skc8,skf8(X1))|~customer(skc8,X2)|~in(skc8,X2,skc10)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_55, negated_conjecture, (see(skc20,skf16(X1))|ssSkC0|~customer(skc20,X2)|~in(skc20,X2,skc23))).
% 0.18/0.38  cnf(i_0_67, negated_conjecture, (patient(skc8,skf9(X1),skc9)|~customer(skc8,X2)|~in(skc8,X2,skc10)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_66, negated_conjecture, (patient(skc20,skf16(X1),skc22)|ssSkC0|~customer(skc20,X2)|~in(skc20,X2,skc23))).
% 0.18/0.38  cnf(i_0_65, negated_conjecture, (agent(skc20,skf16(X1),X1)|ssSkC0|~customer(skc20,X1)|~in(skc20,X1,skc23))).
% 0.18/0.38  cnf(i_0_68, negated_conjecture, (agent(skc8,skf8(X1),X1)|~customer(skc8,X1)|~in(skc8,X1,skc10)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_71, negated_conjecture, (customer(X1,skf20(X1,X2,X3))|ssSkC0|~restaurant(X1,X4)|~coffee(X1,X5)|~actual_world(X1))).
% 0.18/0.38  cnf(i_0_70, negated_conjecture, (patient(skc8,skf8(X1),skf10(X1))|~customer(skc8,X2)|~in(skc8,X2,skc10)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_69, negated_conjecture, (agent(skc8,skf9(X1),skf10(X1))|~customer(skc8,X2)|~in(skc8,X2,skc10)|~ssSkC0)).
% 0.18/0.38  cnf(i_0_72, negated_conjecture, (in(X1,skf20(X1,X2,X3),X2)|ssSkC0|~restaurant(X1,X2)|~coffee(X1,X4)|~actual_world(X1))).
% 0.18/0.38  cnf(i_0_73, negated_conjecture, (customer(X1,skf12(X1,X2,X3))|~agent(X1,X4,X5)|~patient(X1,X4,X6)|~restaurant(X1,X7)|~human_person(X1,X5)|~coffee(X1,X6)|~drink(X1,X4)|~nonreflexive(X1,X4)|~past(X1,X4)|~event(X1,X4)|~ssSkC0|~actual_world(X1))).
% 0.18/0.38  cnf(i_0_74, negated_conjecture, (in(X1,skf12(X1,X2,X3),X2)|~agent(X1,X4,X5)|~patient(X1,X4,X6)|~restaurant(X1,X2)|~human_person(X1,X5)|~coffee(X1,X6)|~drink(X1,X4)|~nonreflexive(X1,X4)|~past(X1,X4)|~event(X1,X4)|~ssSkC0|~actual_world(X1))).
% 0.18/0.38  cnf(i_0_76, negated_conjecture, (~see(X1,X2)|~agent(X1,X2,skf12(X1,X3,X4))|~agent(X1,X5,X4)|~patient(X1,X2,X4)|~patient(X1,X5,X6)|~restaurant(X1,X3)|~human_person(X1,X4)|~coffee(X1,X6)|~drink(X1,X5)|~nonreflexive(X1,X2)|~nonreflexive(X1,X5)|~past(X1,X2)|~past(X1,X5)|~event(X1,X2)|~event(X1,X5)|~ssSkC0|~actual_world(X1))).
% 0.18/0.38  cnf(i_0_75, negated_conjecture, (ssSkC0|~see(X1,X2)|~agent(X1,X2,skf20(X1,X3,X4))|~agent(X1,X5,X6)|~patient(X1,X5,X4)|~patient(X1,X2,X6)|~restaurant(X1,X3)|~human_person(X1,X6)|~coffee(X1,X4)|~drink(X1,X5)|~nonreflexive(X1,X5)|~nonreflexive(X1,X2)|~past(X1,X5)|~past(X1,X2)|~event(X1,X5)|~event(X1,X2)|~actual_world(X1))).
% 0.18/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.18/0.38  # Begin printing tableau
% 0.18/0.38  # Found 4 steps
% 0.18/0.38  cnf(i_0_40, negated_conjecture, (actual_world(skc8)), inference(start_rule)).
% 0.18/0.38  cnf(i_0_1442, plain, (actual_world(skc8)), inference(extension_rule, [i_0_75])).
% 0.18/0.38  cnf(i_0_2634, plain, (ssSkC0), inference(extension_rule, [i_0_73])).
% 0.18/0.38  cnf(i_0_2662, plain, (~actual_world(skc20)), inference(closure_rule, [i_0_39])).
% 0.18/0.38  # End printing tableau
% 0.18/0.38  # SZS output end
% 0.18/0.38  # Branches closed with saturation will be marked with an "s"
% 0.18/0.38  # Child (17990) has found a proof.
% 0.18/0.38  
% 0.18/0.38  # Proof search is over...
% 0.18/0.38  # Freeing feature tree
%------------------------------------------------------------------------------