TSTP Solution File: NLP222+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP222+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 : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 02:14:03 EDT 2022
% Result : CounterSatisfiable 0.21s 0.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP222+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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 : n026.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 : Fri Jul 1 00:23:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.38 # No SInE strategy applied
% 0.21/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.21/0.38 # and selection function SelectCQArNTNpEqFirst.
% 0.21/0.38 #
% 0.21/0.38 # Presaturation interreduction done
% 0.21/0.38 # Number of axioms: 51 Number of unprocessed: 50
% 0.21/0.38 # Tableaux proof search.
% 0.21/0.38 # APR header successfully linked.
% 0.21/0.38 # Hello from C++
% 0.21/0.38 # The folding up rule is enabled...
% 0.21/0.38 # Local unification is enabled...
% 0.21/0.38 # Any saturation attempts will use folding labels...
% 0.21/0.38 # 50 beginning clauses after preprocessing and clausification
% 0.21/0.38 # Creating start rules for all 1 conjectures.
% 0.21/0.38 # There are 1 start rule candidates:
% 0.21/0.38 # Found 0 unit axioms.
% 0.21/0.38 # 1 start rule tableaux created.
% 0.21/0.38 # 50 extension rule candidate clauses
% 0.21/0.38 # 0 unit axiom clauses
% 0.21/0.38
% 0.21/0.38 # Requested 8, 32 cores available to the main process.
% 0.21/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.38 # Returning from population with 25 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.38 # We now have 25 tableaux to operate on
% 0.21/0.39 # 32698 Satisfiable branch
% 0.21/0.39 # 32704 Satisfiable branch
% 0.21/0.39 # Satisfiable branch found.
% 0.21/0.39 # There were 2 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # 32705 Satisfiable branch
% 0.21/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_1, negated_conjecture, (~epred2_0|~epred1_0)).
% 0.21/0.39 cnf(i_0_26, plain, (epred1_0|actual_world(esk1_0))).
% 0.21/0.39 cnf(i_0_51, plain, (epred2_0|actual_world(esk11_0))).
% 0.21/0.39 cnf(i_0_24, plain, (epred1_0|man(esk1_0,esk2_0))).
% 0.21/0.39 cnf(i_0_6, plain, (epred1_0|man(esk1_0,esk7_0))).
% 0.21/0.39 cnf(i_0_23, plain, (epred1_0|vincent_forename(esk1_0,esk3_0))).
% 0.21/0.39 cnf(i_0_22, plain, (epred1_0|forename(esk1_0,esk3_0))).
% 0.21/0.39 cnf(i_0_7, plain, (epred1_0|forename(esk1_0,esk6_0))).
% 0.21/0.39 cnf(i_0_21, plain, (epred1_0|proposition(esk1_0,esk5_0))).
% 0.21/0.39 cnf(i_0_18, plain, (epred1_0|event(esk1_0,esk4_0))).
% 0.21/0.39 cnf(i_0_17, plain, (epred1_0|present(esk1_0,esk4_0))).
% 0.21/0.39 cnf(i_0_16, plain, (epred1_0|think_believe_consider(esk1_0,esk4_0))).
% 0.21/0.39 cnf(i_0_15, plain, (epred1_0|accessible_world(esk1_0,esk5_0))).
% 0.21/0.39 cnf(i_0_8, plain, (epred1_0|jules_forename(esk1_0,esk6_0))).
% 0.21/0.39 cnf(i_0_5, plain, (epred1_0|state(esk1_0,esk8_0))).
% 0.21/0.39 cnf(i_0_49, plain, (epred2_0|man(esk11_0,esk12_0))).
% 0.21/0.39 cnf(i_0_45, plain, (epred2_0|man(esk11_0,esk14_0))).
% 0.21/0.39 cnf(i_0_31, plain, (epred2_0|man(esk11_0,esk18_0))).
% 0.21/0.39 cnf(i_0_44, plain, (epred2_0|vincent_forename(esk11_0,esk15_0))).
% 0.21/0.39 cnf(i_0_47, plain, (epred2_0|forename(esk11_0,esk13_0))).
% 0.21/0.39 cnf(i_0_43, plain, (epred2_0|forename(esk11_0,esk15_0))).
% 0.21/0.39 cnf(i_0_42, plain, (epred2_0|proposition(esk11_0,esk17_0))).
% 0.21/0.39 cnf(i_0_39, plain, (epred2_0|event(esk11_0,esk16_0))).
% 0.21/0.39 cnf(i_0_38, plain, (epred2_0|present(esk11_0,esk16_0))).
% 0.21/0.39 cnf(i_0_37, plain, (epred2_0|think_believe_consider(esk11_0,esk16_0))).
% 0.21/0.39 cnf(i_0_36, plain, (epred2_0|accessible_world(esk11_0,esk17_0))).
% 0.21/0.39 cnf(i_0_48, plain, (epred2_0|jules_forename(esk11_0,esk13_0))).
% 0.21/0.39 cnf(i_0_30, plain, (epred2_0|state(esk11_0,esk19_0))).
% 0.21/0.39 cnf(i_0_25, plain, (epred1_0|of(esk1_0,esk3_0,esk2_0))).
% 0.21/0.39 cnf(i_0_10, plain, (epred1_0|of(esk1_0,esk6_0,esk7_0))).
% 0.21/0.39 cnf(i_0_20, plain, (epred1_0|agent(esk1_0,esk4_0,esk2_0))).
% 0.21/0.39 cnf(i_0_19, plain, (epred1_0|theme(esk1_0,esk4_0,esk5_0))).
% 0.21/0.39 cnf(i_0_50, plain, (epred2_0|of(esk11_0,esk13_0,esk12_0))).
% 0.21/0.39 cnf(i_0_46, plain, (epred2_0|of(esk11_0,esk15_0,esk14_0))).
% 0.21/0.39 cnf(i_0_41, plain, (epred2_0|agent(esk11_0,esk16_0,esk14_0))).
% 0.21/0.39 cnf(i_0_40, plain, (epred2_0|theme(esk11_0,esk16_0,esk17_0))).
% 0.21/0.39 cnf(i_0_4, plain, (epred1_0|be(esk1_0,esk8_0,esk7_0,esk7_0))).
% 0.21/0.39 cnf(i_0_14, plain, (epred1_0|event(esk5_0,esk9_1(X1))|~man(esk5_0,X1))).
% 0.21/0.39 cnf(i_0_29, plain, (epred2_0|be(esk11_0,esk19_0,esk12_0,esk18_0))).
% 0.21/0.39 cnf(i_0_12, plain, (epred1_0|present(esk5_0,esk9_1(X1))|~man(esk5_0,X1))).
% 0.21/0.39 cnf(i_0_11, plain, (epred1_0|smoke(esk5_0,esk9_1(X1))|~man(esk5_0,X1))).
% 0.21/0.39 cnf(i_0_35, plain, (epred2_0|event(esk17_0,esk20_1(X1))|~man(esk17_0,X1))).
% 0.21/0.39 cnf(i_0_33, plain, (epred2_0|present(esk17_0,esk20_1(X1))|~man(esk17_0,X1))).
% 0.21/0.39 cnf(i_0_32, plain, (epred2_0|smoke(esk17_0,esk20_1(X1))|~man(esk17_0,X1))).
% 0.21/0.39 cnf(i_0_13, plain, (epred1_0|agent(esk5_0,esk9_1(X1),X1)|~man(esk5_0,X1))).
% 0.21/0.39 cnf(i_0_34, plain, (epred2_0|agent(esk17_0,esk20_1(X1),X1)|~man(esk17_0,X1))).
% 0.21/0.39 cnf(i_0_28, plain, (epred2_0|man(X1,esk21_8(X2,X3,X4,X5,X1,X6,X7,X8))|~be(X2,X8,X7,X7)|~state(X2,X8)|~jules_forename(X2,X6)|~accessible_world(X2,X1)|~think_believe_consider(X2,X5)|~present(X2,X5)|~event(X2,X5)|~theme(X2,X5,X1)|~agent(X2,X5,X3)|~proposition(X2,X1)|~forename(X2,X6)|~forename(X2,X4)|~vincent_forename(X2,X4)|~man(X2,X7)|~man(X2,X3)|~of(X2,X6,X7)|~of(X2,X4,X3)|~actual_world(X2))).
% 0.21/0.39 cnf(i_0_27, plain, (epred2_0|~be(X1,X2,X3,X3)|~state(X1,X2)|~jules_forename(X1,X4)|~smoke(X5,X6)|~accessible_world(X1,X5)|~think_believe_consider(X1,X7)|~present(X1,X7)|~present(X5,X6)|~event(X1,X7)|~event(X5,X6)|~theme(X1,X7,X5)|~agent(X5,X6,esk21_8(X1,X8,X9,X7,X5,X4,X3,X2))|~agent(X1,X7,X8)|~proposition(X1,X5)|~forename(X1,X4)|~forename(X1,X9)|~vincent_forename(X1,X9)|~man(X1,X3)|~man(X1,X8)|~of(X1,X4,X3)|~of(X1,X9,X8)|~actual_world(X1))).
% 0.21/0.39 cnf(i_0_3, plain, (epred1_0|man(X1,esk10_9(X2,X3,X4,X5,X6,X7,X1,X8,X9))|~be(X2,X9,X3,X8)|~state(X2,X9)|~jules_forename(X2# 32699 Satisfiable branch
% 0.21/0.39 ,X4)|~accessible_world(X2,X1)|~think_believe_consider(X2,X7)|~present(X2,X7)|~event(X2,X7)|~theme(X2,X7,X1)|~agent(X2,X7,X5)|~proposition(X2,X1)|~forename(X2,X6)|~forename(X2,X4)|~vincent_forename(X2,X6)|~man(X2,X8)|~man(X2,X5)|~man(X2,X3)|~of(X2,X6,X5)|~of(X2,X4,X3)|~actual_world(X2))).
% 0.21/0.39 cnf(i_0_2, plain, (epred1_0|~be(X1,X2,X3,X4)|~state(X1,X2)|~jules_forename(X1,X5)|~smoke(X6,X7)|~accessible_world(X1,X6)|~think_believe_consider(X1,X8)|~present(X1,X8)|~present(X6,X7)|~event(X1,X8)|~event(X6,X7)|~theme(X1,X8,X6)|~agent(X6,X7,esk10_9(X1,X3,X5,X9,X10,X8,X6,X4,X2))|~agent(X1,X8,X9)|~proposition(X1,X6)|~forename(X1,X10)|~forename(X1,X5)|~vincent_forename(X1,X10)|~man(X1,X4)|~man(X1,X9)|~man(X1,X3)|~of(X1,X10,X9)|~of(X1,X5,X3)|~actual_world(X1))).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 4 steps
% 0.21/0.39 cnf(i_0_1, negated_conjecture, (~epred2_0|~epred1_0), inference(start_rule)).
% 0.21/0.39 cnf(i_0_52, plain, (~epred2_0), inference(extension_rule, [i_0_27])).
% 0.21/0.39 cnf(i_0_173, plain, (~be(esk1_0,esk8_0,esk7_0,esk7_0)), inference(extension_rule, [i_0_4])).
% 0.21/0.39 cnf(i_0_53, plain, (~epred1_0), inference(etableau_closure_rule, [i_0_53, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # Satisfiable branch found.
% 0.21/0.39 # There were 2 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_1, negated_conjecture, (~epred2_0|~epred1_0)).
% 0.21/0.39 cnf(i_0_26, plain, (epred1_0|actual_world(esk1_0))).
% 0.21/0.39 cnf(i_0_51, plain, (epred2_0|actual_world(esk11_0))).
% 0.21/0.39 cnf(i_0_24, plain, (epred1_0|man(esk1_0,esk2_0))).
% 0.21/0.39 cnf(i_0_6, plain, (epred1_0|man(esk1_0,esk7_0))).
% 0.21/0.39 cnf(i_0_23, plain, (epred1_0|vincent_forename(esk1_0,esk3_0))).
% 0.21/0.39 cnf(i_0_22, plain, (epred1_0|forename(esk1_0,esk3_0))).
% 0.21/0.39 cnf(i_0_7, plain, (epred1_0|forename(esk1_0,esk6_0))).
% 0.21/0.39 cnf(i_0_21, plain, (epred1_0|proposition(esk1_0,esk5_0))).
% 0.21/0.39 cnf(i_0_18, plain, (epred1_0|event(esk1_0,esk4_0))).
% 0.21/0.39 cnf(i_0_17, plain, (epred1_0|present(esk1_0,esk4_0))).
% 0.21/0.39 cnf(i_0_16, plain, (epred1_0|think_believe_consider(esk1_0,esk4_0))).
% 0.21/0.39 cnf(i_0_15, plain, (epred1_0|accessible_world(esk1_0,esk5_0))).
% 0.21/0.39 cnf(i_0_8, plain, (epred1_0|jules_forename(esk1_0,esk6_0))).
% 0.21/0.39 cnf(i_0_5, plain, (epred1_0|state(esk1_0,esk8_0))).
% 0.21/0.39 cnf(i_0_49, plain, (epred2_0|man(esk11_0,esk12_0))).
% 0.21/0.39 cnf(i_0_45, plain, (epred2_0|man(esk11_0,esk14_0))).
% 0.21/0.39 cnf(i_0_31, plain, (epred2_0|man(esk11_0,esk18_0))).
% 0.21/0.39 cnf(i_0_44, plain, (epred2_0|vincent_forename(esk11_0,esk15_0))).
% 0.21/0.39 cnf(i_0_47, plain, (epred2_0|forename(esk11_0,esk13_0))).
% 0.21/0.39 cnf(i_0_43, plain, (epred2_0|forename(esk11_0,esk15_0))).
% 0.21/0.39 cnf(i_0_42, plain, (epred2_0|proposition(esk11_0,esk17_0))).
% 0.21/0.39 cnf(i_0_39, plain, (epred2_0|event(esk11_0,esk16_0))).
% 0.21/0.39 cnf(i_0_38, plain, (epred2_0|present(esk11_0,esk16_0))).
% 0.21/0.39 cnf(i_0_37, plain, (epred2_0|think_believe_consider(esk11_0,esk16_0))).
% 0.21/0.39 cnf(i_0_36, plain, (epred2_0|accessible_world(esk11_0,esk17_0))).
% 0.21/0.39 cnf(i_0_48, plain, (epred2_0|jules_forename(esk11_0,esk13_0))).
% 0.21/0.39 cnf(i_0_30, plain, (epred2_0|state(esk11_0,esk19_0))).
% 0.21/0.39 cnf(i_0_25, plain, (epred1_0|of(esk1_0,esk3_0,esk2_0))).
% 0.21/0.39 cnf(i_0_10, plain, (epred1_0|of(esk1_0,esk6_0,esk7_0))).
% 0.21/0.39 cnf(i_0_20, plain, (epred1_0|agent(esk1_0,esk4_0,esk2_0))).
% 0.21/0.39 cnf(i_0_19, plain, (epred1_0|theme(esk1_0,esk4_0,esk5_0))).
% 0.21/0.39 cnf(i_0_50, plain, (epred2_0|of(esk11_0,esk13_0,esk12_0))).
% 0.21/0.39 cnf(i_0_46, plain, (epred2_0|of(esk11_0,esk15_0,esk14_0))).
% 0.21/0.39 cnf(i_0_41, plain, (epred2_0|agent(esk11_0,esk16_0,esk14_0))).
% 0.21/0.39 cnf(i_0_40, plain, (epred2_0|theme(esk11_0,esk16_0,esk17_0))).
% 0.21/0.39 cnf(i_0_4, plain, (epred1_0|be(esk1_0,esk8_0,esk7_0,esk7_0))).
% 0.21/0.39 cnf(i_0_14, plain, (epred1_0|event(esk5_0,esk9_1(X1))|~man(esk5_0,X1))).
% 0.21/0.39 cnf(i_0_29, plain, (epred2_0|be(esk11_0,esk19_0,esk12_0,esk18_0))).
% 0.21/0.39 cnf(i_0_12, plain, (epred1_0|present(esk5_0,esk9_1(X1))|~man(esk5_0,X1))).
% 0.21/0.39 cnf(i_0_11, plain, (epred1_0|smoke(esk5_0,esk9_1(X1))|~man(esk5_0,X1))).
% 0.21/0.39 cnf(i_0_35, plain, (epred2_0|event(esk17_0,esk20_1(X1))|~man(esk17_0,X1))).
% 0.21/0.39 cnf(i_0_33, plain, (epred2_0|present(esk17_0,esk20_1(X1))|~man(esk17_0,X1))).
% 0.21/0.39 cnf(i_0_32, plain, (epred2_0|smoke(esk17_0,esk20_1(X1))|~man(esk17_0,X1))).
% 0.21/0.39 cnf(i_0_13, plain, (epred1_0|agent(esk5_0,esk9_1(X1),X1)|~man(esk5_0,X1))).
% 0.21/0.39 cnf(i_0_34, plain, (epred2_0|agent(esk17_0,esk20_1(X1),X1)|~man(esk17_0,X1))).
% 0.21/0.39 cnf(i_0_28, plain, (epred2_0|man(X1,esk21_8(X2,X3,X4,X5,X1,X6,X7,X8))|~be(X2,X8,X7,X7)|~state(X2,X8)|~jules_forename(X2,X6)|~accessible_world(X2,X1)|~think_believe_consider(X2,X5)|~present(X2,X5)|~event(X2,X5)|~theme(X2,X5,X1)|~agent(X2,X5,X3)|~proposition(X2,X1)|~forename(X2,X6)|~forename(X2,X4)|~vincent_forename(X2,X4)|~man(X2,X7)|~man(X2,X3)|~of(X2,X6,X7)|~of(X2,X4,X3)|~actual_world(X2))).
% 0.21/0.39 cnf(i_0_27, plain, (epred2_0|~be(X1,X2,X3,X3)|~state(X1,X2)|~jules_forename(X1,X4)|~smoke(X5,X6)|~accessible_world(X1,X5)|~think_believe_consider(X1,X7)|~present(X1,X7)|~present(X5,X6)|~event(X1,X7)|~event(X5,X6)|~theme(X1,X7,X5)|~agent(X5,X6,esk21_8(X1,X8,X9,X7,X5,X4,X3,X2))|~agent(X1,X7,X8)|~proposition(X1,X5)|~forename(X1,X4)|~forename(X1,X9)|~vincent_forename(X1,X9)|~man(X1,X3)|~man(X1,X8)|~of(X1,X4,X3)|~of(X1,X9,X8)|~actual_world(X1))).
% 0.21/0.39 cnf(i_0_3, plain, (epred1_0|man(X1,esk10_9(X2,X3,X4,X5,X6,X7,X1,X8,X9))|~be(X2,X9,X3,X8)|~state(X2,X9)|~jules_forename(X2# Satisfiable branch found.
% 0.21/0.39 # There were 2 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_1, negated_conjecture, (~epred2_0|~epred1_0)).
% 0.21/0.39 cnf(i_0_26, plain, (epred1_0|actual_world(esk1_0))).
% 0.21/0.39 cnf(i_0_51, plain, (epred2_0|actual_world(esk11_0))).
% 0.21/0.39 cnf(i_0_24, plain, (epred1_0|man(esk1_0,esk2_0))).
% 0.21/0.39 cnf(i_0_6, plain, (epred1_0|man(esk1_0,esk7_0))).
% 0.21/0.39 cnf(i_0_23, plain, (epred1_0|vincent_forename(esk1_0,esk3_0))).
% 0.21/0.39 cnf(i_0_22, plain, (epred1_0|forename(esk1_0,esk3_0))).
% 0.21/0.39 cnf(i_0_7, plain, (epred1_0|forename(esk1_0,esk6_0))).
% 0.21/0.39 cnf(i_0_21, plain, (epred1_0|proposition(esk1_0,esk5_0))).
% 0.21/0.39 cnf(i_0_18, plain, (epred1_0|event(esk1_0,esk4_0))).
% 0.21/0.39 cnf(i_0_17, plain, (epred1_0|present(esk1_0,esk4_0))).
% 0.21/0.39 cnf(i_0_16, plain, (epred1_0|think_believe_consider(esk1_0,esk4_0))).
% 0.21/0.39 cnf(i_0_15, plain, (epred1_0|accessible_world(esk1_0,esk5_0))).
% 0.21/0.39 cnf(i_0_8, plain, (epred1_0|jules_forename(esk1_0,esk6_0))).
% 0.21/0.39 cnf(i_0_5, plain, (epred1_0|state(esk1_0,esk8_0))).
% 0.21/0.39 cnf(i_0_49, plain, (epred2_0|man(esk11_0,esk12_0))).
% 0.21/0.39 cnf(i_0_45, plain, (epred2_0|man(esk11_0,esk14_0))).
% 0.21/0.39 cnf(i_0_31, plain, (epred2_0|man(esk11_0,esk18_0))).
% 0.21/0.39 cnf(i_0_44, plain, (epred2_0|vincent_forename(esk11_0,esk15_0))).
% 0.21/0.39 cnf(i_0_47, plain, (epred2_0|forename(esk11_0,esk13_0))).
% 0.21/0.39 cnf(i_0_43, plain, (epred2_0|forename(esk11_0,esk15_0))).
% 0.21/0.39 cnf(i_0_42, plain, (epred2_0|proposition(esk11_0,esk17_0))).
% 0.21/0.39 cnf(i_0_39, plain, (epred2_0|event(esk11_0,esk16_0))).
% 0.21/0.39 cnf(i_0_38, plain, (epred2_0|present(esk11_0,esk16_0))).
% 0.21/0.39 cnf(i_0_37, plain, (epred2_0|think_believe_consider(esk11_0,esk16_0))).
% 0.21/0.39 cnf(i_0_36, plain, (epred2_0|accessible_world(esk11_0,esk17_0))).
% 0.21/0.39 cnf(i_0_48, plain, (epred2_0|jules_forename(esk11_0,esk13_0))).
% 0.21/0.39 cnf(i_0_30, plain, (epred2_0|state(esk11_0,esk19_0))).
% 0.21/0.39 cnf(i_0_25, plain, (epred1_0|of(esk1_0,esk3_0,esk2_0))).
% 0.21/0.39 cnf(i_0_10, plain, (epred1_0|of(esk1_0,esk6_0,esk7_0))).
% 0.21/0.39 cnf(i_0_20, plain, (epred1_0|agent(esk1_0,esk4_0,esk2_0))).
% 0.21/0.39 cnf(i_0_19, plain, (epred1_0|theme(esk1_0,esk4_0,esk5_0))).
% 0.21/0.39 cnf(i_0_50, plain, (epred2_0|of(esk11_0,esk13_0,esk12_0))).
% 0.21/0.39 cnf(i_0_46, plain, (epred2_0|of(esk11_0,esk15_0,esk14_0))).
% 0.21/0.39 cnf(i_0_41, plain, (epred2_0|agent(esk11_0,esk16_0,esk14_0))).
% 0.21/0.39 cnf(i_0_40, plain, (epred2_0|theme(esk11_0,esk16_0,esk17_0))).
% 0.21/0.39 cnf(i_0_4, plain, (epred1_0|be(esk1_0,esk8_0,esk7_0,esk7_0))).
% 0.21/0.39 cnf(i_0_14, plain, (epred1_0|event(esk5_0,esk9_1(X1))|~man(esk5_0,X1))).
% 0.21/0.39 cnf(i_0_29, plain, (epred2_0|be(esk11_0,esk19_0,esk12_0,esk18_0))).
% 0.21/0.39 cnf(i_0_12, plain, (epred1_0|present(esk5_0,esk9_1(X1))|~man(esk5_0,X1))).
% 0.21/0.39 cnf(i_0_11, plain, (epred1_0|smoke(esk5_0,esk9_1(X1))|~man(esk5_0,X1))).
% 0.21/0.39 cnf(i_0_35, plain, (epred2_0|event(esk17_0,esk20_1(X1))|~man(esk17_0,X1))).
% 0.21/0.39 cnf(i_0_33, plain, (epred2_0|present(esk17_0,esk20_1(X1))|~man(esk17_0,X1))).
% 0.21/0.39 cnf(i_0_32, plain, (epred2_0|smoke(esk17_0,esk20_1(X1))|~man(esk17_0,X1))).
% 0.21/0.39 cnf(i_0_13, plain, (epred1_0|agent(esk5_0,esk9_1(X1),X1)|~man(esk5_0,X1))).
% 0.21/0.39 cnf(i_0_34, plain, (epred2_0|agent(esk17_0,esk20_1(X1),X1)|~man(esk17_0,X1))).
% 0.21/0.39 cnf(i_0_28, plain, (epred2_0|man(X1,esk21_8(X2,X3,X4,X5,X1,X6,X7,X8))|~be(X2,X8,X7,X7)|~state(X2,X8)|~jules_forename(X2,X6)|~accessible_world(X2,X1)|~think_believe_consider(X2,X5)|~present(X2,X5)|~event(X2,X5)|~theme(X2,X5,X1)|~agent(X2,X5,X3)|~proposition(X2,X1)|~forename(X2,X6)|~forename(X2,X4)|~vincent_forename(X2,X4)|~man(X2,X7)|~man(X2,X3)|~of(X2,X6,X7)|~of(X2,X4,X3)|~actual_world(X2))).
% 0.21/0.39 cnf(i_0_27, plain, (epred2_0|~be(X1,X2,X3,X3)|~state(X1,X2)|~jules_forename(X1,X4)|~smoke(X5,X6)|~accessible_world(X1,X5)|~think_believe_consider(X1,X7)|~present(X1,X7)|~present(X5,X6)|~event(X1,X7)|~event(X5,X6)|~theme(X1,X7,X5)|~agent(X5,X6,esk21_8(X1,X8,X9,X7,X5,X4,X3,X2))|~agent(X1,X7,X8)|~proposition(X1,X5)|~forename(X1,X4)|~forename(X1,X9)|~vincent_forename(X1,X9)|~man(X1,X3)|~man(X1,X8)|~of(X1,X4,X3)|~of(X1,X9,X8)|~actual_world(X1))).
% 0.21/0.39 cnf(i_0_3, plain, (epred1_0|man(X1,esk10_9(X2,X3,X4,X5,X6,X7,X1,X8,X9))|~be(X2,X9,X3,X8)|~state(X2,X9)|~jules_forename(X2,X4)|~accessible_world(X2,X1)|~think_believe_consider(X2,X7)|~present(X2,X7)|~event(X2,X7)|~theme(X2,X7,X1)|~agent(X2,X7,X5)|~proposition(X2,X1)|~forename(X2,X6)|~forename(X2,X4)|~vincent_forename(X2,X6)|~man(X2,X8)|~man(X2,X5)|~man(X2,X3)|~of(X2,X6,X5)|~of(X2,X4,X3)|~actual_world(X2))).
% 0.21/0.39 cnf(i_0_2, plain, (epred1_0|~be(X1,X2,X3,X4)|~state(X1,X2)|~jules_forename(X1,X5)|~smoke(X6,X7)|~accessible_world(X1,X6)|~think_believe_consider(X1,X8)|~present(X1,X8)|~present(X6,X7)|~event(X1,X8)|~event(X6,X7)|~theme(X1,X8,X6)|~agent(X6,X7,esk10_9(X1,X3,X5,X9,X10,X8,X6,X4,X2))|~agent(X1,X8,X9)|~proposition(X1,X6)|~forename(X1,X10)|~forename(X1,X5)|~vincent_forename(X1,X10)|~man(X1,X4)|~man(X1,X9)|~man(X1,X3)|~of(X1,X10,X9)|~of(X1,X5,X3)|~actual_world(X1))).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 4 steps
% 0.21/0.39 cnf(i_0_1, negated_conjecture, (~epred2_0|~epred1_0), inference(start_rule)).
% 0.21/0.39 cnf(i_0_52, plain, (~epred2_0), inference(extension_rule, [i_0_40])).
% 0.21/0.39 cnf(i_0_123, plain, (theme(esk11_0,esk16_0,esk17_0)), inference(extension_rule, [i_0_3])).
% 0.21/0.39 cnf(i_0_53, plain, (~epred1_0), inference(etableau_closure_rule, [i_0_53, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # Satisfiable branch found.
% 0.21/0.39 ,X4)|~accessible_world(X2,X1)|~think_believe_consider(X2,X7)|~present(X2,X7)|~event(X2,X7)|~theme(X2,X7,X1)|~agent(X2,X7,X5)|~proposition(X2,X1)|~forename(X2,X6)|~forename(X2,X4)|~vincent_forename(X2,X6)|~man(X2,X8)|~man(X2,X5)|~man(X2,X3)|~of(X2,X6,X5)|~of(X2,X4,X3)|~actual_world(X2))).
% 0.21/0.39 cnf(i_0_2, plain, (epred1_0|~be(X1,X2,X3,X4)|~state(X1,X2)|~jules_forename(X1,X5)|~smoke(X6,X7)|~accessible_world(X1,X6)|~think_believe_consider(X1,X8)|~present(X1,X8)|~present(X6,X7)|~event(X1,X8)|~event(X6,X7)|~theme(X1,X8,X6)|~agent(X6,X7,esk10_9(X1,X3,X5,X9,X10,X8,X6,X4,X2))|~agent(X1,X8,X9)|~proposition(X1,X6)|~forename(X1,X10)|~forename(X1,X5)|~vincent_forename(X1,X10)|~man(X1,X4)|~man(X1,X9)|~man(X1,X3)|~of(X1,X10,X9)|~of(X1,X5,X3)|~actual_world(X1))).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 4 steps
% 0.21/0.39 cnf(i_0_1, negated_conjecture, (~epred2_0|~epred1_0), inference(start_rule)).
% 0.21/0.39 cnf(i_0_52, plain, (~epred2_0), inference(extension_rule, [i_0_29])).
% 0.21/0.39 cnf(i_0_130, plain, (be(esk11_0,esk19_0,esk12_0,esk18_0)), inference(extension_rule, [i_0_3])).
% 0.21/0.39 cnf(i_0_53, plain, (~epred1_0), inference(etableau_closure_rule, [i_0_53, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # There were 2 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.40 # Child (32698) has found a proof.
% 0.21/0.40
% 0.21/0.40 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # Begin clausification derivation
% 0.21/0.40
% 0.21/0.40 # End clausification derivation
% 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.40 cnf(i_0_1, negated_conjecture, (~epred2_0|~epred1_0)).
% 0.21/0.40 cnf(i_0_26, plain, (epred1_0|actual_world(esk1_0))).
% 0.21/0.40 cnf(i_0_51, plain, (epred2_0|actual_world(esk11_0))).
% 0.21/0.40 cnf(i_0_24, plain, (epred1_0|man(esk1_0,esk2_0))).
% 0.21/0.40 cnf(i_0_6, plain, (epred1_0|man(esk1_0,esk7_0))).
% 0.21/0.40 cnf(i_0_23, plain, (epred1_0|vincent_forename(esk1_0,esk3_0))).
% 0.21/0.40 cnf(i_0_22, plain, (epred1_0|forename(esk1_0,esk3_0))).
% 0.21/0.40 cnf(i_0_7, plain, (epred1_0|forename(esk1_0,esk6_0))).
% 0.21/0.40 cnf(i_0_21, plain, (epred1_0|proposition(esk1_0,esk5_0))).
% 0.21/0.40 cnf(i_0_18, plain, (epred1_0|event(esk1_0,esk4_0))).
% 0.21/0.40 cnf(i_0_17, plain, (epred1_0|present(esk1_0,esk4_0))).
% 0.21/0.40 cnf(i_0_16, plain, (epred1_0|think_believe_consider(esk1_0,esk4_0))).
% 0.21/0.40 cnf(i_0_15, plain, (epred1_0|accessible_world(esk1_0,esk5_0))).
% 0.21/0.40 cnf(i_0_8, plain, (epred1_0|jules_forename(esk1_0,esk6_0))).
% 0.21/0.40 cnf(i_0_5, plain, (epred1_0|state(esk1_0,esk8_0))).
% 0.21/0.40 cnf(i_0_49, plain, (epred2_0|man(esk11_0,esk12_0))).
% 0.21/0.40 cnf(i_0_45, plain, (epred2_0|man(esk11_0,esk14_0))).
% 0.21/0.40 cnf(i_0_31, plain, (epred2_0|man(esk11_0,esk18_0))).
% 0.21/0.40 cnf(i_0_44, plain, (epred2_0|vincent_forename(esk11_0,esk15_0))).
% 0.21/0.40 cnf(i_0_47, plain, (epred2_0|forename(esk11_0,esk13_0))).
% 0.21/0.40 cnf(i_0_43, plain, (epred2_0|forename(esk11_0,esk15_0))).
% 0.21/0.40 cnf(i_0_42, plain, (epred2_0|proposition(esk11_0,esk17_0))).
% 0.21/0.40 cnf(i_0_39, plain, (epred2_0|event(esk11_0,esk16_0))).
% 0.21/0.40 cnf(i_0_38, plain, (epred2_0|present(esk11_0,esk16_0))).
% 0.21/0.40 cnf(i_0_37, plain, (epred2_0|think_believe_consider(esk11_0,esk16_0))).
% 0.21/0.40 cnf(i_0_36, plain, (epred2_0|accessible_world(esk11_0,esk17_0))).
% 0.21/0.40 cnf(i_0_48, plain, (epred2_0|jules_forename(esk11_0,esk13_0))).
% 0.21/0.40 cnf(i_0_30, plain, (epred2_0|state(esk11_0,esk19_0))).
% 0.21/0.40 cnf(i_0_25, plain, (epred1_0|of(esk1_0,esk3_0,esk2_0))).
% 0.21/0.40 cnf(i_0_10, plain, (epred1_0|of(esk1_0,esk6_0,esk7_0))).
% 0.21/0.40 cnf(i_0_20, plain, (epred1_0|agent(esk1_0,esk4_0,esk2_0))).
% 0.21/0.40 cnf(i_0_19, plain, (epred1_0|theme(esk1_0,esk4_0,esk5_0))).
% 0.21/0.40 cnf(i_0_50, plain, (epred2_0|of(esk11_0,esk13_0,esk12_0))).
% 0.21/0.40 cnf(i_0_46, plain, (epred2_0|of(esk11_0,esk15_0,esk14_0))).
% 0.21/0.40 cnf(i_0_41, plain, (epred2_0|agent(esk11_0,esk16_0,esk14_0))).
% 0.21/0.40 cnf(i_0_40, plain, (epred2_0|theme(esk11_0,esk16_0,esk17_0))).
% 0.21/0.40 cnf(i_0_4, plain, (epred1_0|be(esk1_0,esk8_0,esk7_0,esk7_0))).
% 0.21/0.40 cnf(i_0_14, plain, (epred1_0|event(esk5_0,esk9_1(X1))|~man(esk5_0,X1))).
% 0.21/0.40 cnf(i_0_29, plain, (epred2_0|be(esk11_0,esk19_0,esk12_0,esk18_0))).
% 0.21/0.40 cnf(i_0_12, plain, (epred1_0|present(esk5_0,esk9_1(X1))|~man(esk5_0,X1))).
% 0.21/0.40 cnf(i_0_11, plain, (epred1_0|smoke(esk5_0,esk9_1(X1))|~man(esk5_0,X1))).
% 0.21/0.40 cnf(i_0_35, plain, (epred2_0|event(esk17_0,esk20_1(X1))|~man(esk17_0,X1))).
% 0.21/0.40 cnf(i_0_33, plain, (epred2_0|present(esk17_0,esk20_1(X1))|~man(esk17_0,X1))).
% 0.21/0.40 cnf(i_0_32, plain, (epred2_0|smoke(esk17_0,esk20_1(X1))|~man(esk17_0,X1))).
% 0.21/0.40 cnf(i_0_13, plain, (epred1_0|agent(esk5_0,esk9_1(X1),X1)|~man(esk5_0,X1))).
% 0.21/0.40 cnf(i_0_34, plain, (epred2_0|agent(esk17_0,esk20_1(X1),X1)|~man(esk17_0,X1))).
% 0.21/0.40 cnf(i_0_28, plain, (epred2_0|man(X1,esk21_8(X2,X3,X4,X5,X1,X6,X7,X8))|~be(X2,X8,X7,X7)|~state(X2,X8)|~jules_forename(X2,X6)|~accessible_world(X2,X1)|~think_believe_consider(X2,X5)|~present(X2,X5)|~event(X2,X5)|~theme(X2,X5,X1)|~agent(X2,X5,X3)|~proposition(X2,X1)|~forename(X2,X6)|~forename(X2,X4)|~vincent_forename(X2,X4)|~man(X2,X7)|~man(X2,X3)|~of(X2,X6,X7)|~of(X2,X4,X3)|~actual_world(X2))).
% 0.21/0.40 cnf(i_0_27, plain, (epred2_0|~be(X1,X2,X3,X3)|~state(X1,X2)|~jules_forename(X1,X4)|~smoke(X5,X6)|~accessible_world(X1,X5)|~think_believe_consider(X1,X7)|~present(X1,X7)|~present(X5,X6)|~event(X1,X7)|~event(X5,X6)|~theme(X1,X7,X5)|~agent(X5,X6,esk21_8(X1,X8,X9,X7,X5,X4,X3,X2))|~agent(X1,X7,X8)|~proposition(X1,X5)|~forename(X1,X4)|~forename(X1,X9)|~vincent_forename(X1,X9)|~man(X1,X3)|~man(X1,X8)|~of(X1,X4,X3)|~of(X1,X9,X8)|~actual_world(X1))).
% 0.21/0.40 cnf(i_0_3, plain, (epred1_0|man(X1,esk10_9(X2,X3,X4,X5,X6,X7,X1,X8,X9))|~be(X2,X9,X3,X8)|~state(X2,X9)|~jules_forename(X2# Proof search is over...
% 0.21/0.40 # Freeing feature tree
%------------------------------------------------------------------------------