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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : NLP079-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:21 EDT 2022

% Result   : Unsatisfiable 41.95s 5.86s
% Output   : CNFRefutation 41.95s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.25  % Problem  : NLP079-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.26  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.48  % Computer : n011.cluster.edu
% 0.12/0.48  % Model    : x86_64 x86_64
% 0.12/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.48  % Memory   : 8042.1875MB
% 0.12/0.48  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.48  % CPULimit : 300
% 0.12/0.48  % WCLimit  : 600
% 0.12/0.48  % DateTime : Thu Jun 30 21:03:19 EDT 2022
% 0.12/0.48  % CPUTime  : 
% 0.18/0.51  # No SInE strategy applied
% 0.18/0.51  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.18/0.51  # and selection function SelectCQArNTNpEqFirst.
% 0.18/0.51  #
% 0.18/0.51  # Presaturation interreduction done
% 0.18/0.51  # Number of axioms: 51 Number of unprocessed: 51
% 0.18/0.51  # Tableaux proof search.
% 0.18/0.51  # APR header successfully linked.
% 0.18/0.51  # Hello from C++
% 0.18/0.51  # The folding up rule is enabled...
% 0.18/0.51  # Local unification is enabled...
% 0.18/0.51  # Any saturation attempts will use folding labels...
% 0.18/0.51  # 51 beginning clauses after preprocessing and clausification
% 0.18/0.51  # Creating start rules for all 51 conjectures.
% 0.18/0.51  # There are 51 start rule candidates:
% 0.18/0.51  # Found 2 unit axioms.
% 0.18/0.51  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.51  # 51 start rule tableaux created.
% 0.18/0.51  # 49 extension rule candidate clauses
% 0.18/0.51  # 2 unit axiom clauses
% 0.18/0.51  
% 0.18/0.51  # Requested 8, 32 cores available to the main process.
% 9.37/1.76  # Ran out of tableaux, making start rules for all clauses
% 32.61/4.72  # Ran out of tableaux, making start rules for all clauses
% 41.95/5.86  # There were 266 total branch saturation attempts.
% 41.95/5.86  # There were 0 of these attempts blocked.
% 41.95/5.86  # There were 0 deferred branch saturation attempts.
% 41.95/5.86  # There were 99 free duplicated saturations.
% 41.95/5.86  # There were 266 total successful branch saturations.
% 41.95/5.86  # There were 15 successful branch saturations in interreduction.
% 41.95/5.86  # There were 0 successful branch saturations on the branch.
% 41.95/5.86  # There were 152 successful branch saturations after the branch.
% 41.95/5.86  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 41.95/5.86  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 41.95/5.86  # Begin clausification derivation
% 41.95/5.86  
% 41.95/5.86  # End clausification derivation
% 41.95/5.86  # Begin listing active clauses obtained from FOF to CNF conversion
% 41.95/5.86  cnf(i_0_52, negated_conjecture, (actual_world(skc42))).
% 41.95/5.86  cnf(i_0_53, negated_conjecture, (actual_world(skc16))).
% 41.95/5.86  cnf(i_0_66, negated_conjecture, (six(skc16,skc21)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_67, negated_conjecture, (group(skc16,skc21)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_68, negated_conjecture, (cannon(skc16,skc22)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_54, negated_conjecture, (six(skc42,skc47)|ssSkC0)).
% 41.95/5.86  cnf(i_0_55, negated_conjecture, (group(skc42,skc47)|ssSkC0)).
% 41.95/5.86  cnf(i_0_69, negated_conjecture, (male(skc16,skc23)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_72, negated_conjecture, (male(skc16,skc19)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_70, negated_conjecture, (man(skc16,skc23)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_77, negated_conjecture, (revenge(skc16,skc18)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_56, negated_conjecture, (cannon(skc42,skc48)|ssSkC0)).
% 41.95/5.86  cnf(i_0_73, negated_conjecture, (scream(skc16,skc17)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_74, negated_conjecture, (nonreflexive(skc16,skc17)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_75, negated_conjecture, (present(skc16,skc17)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_76, negated_conjecture, (event(skc16,skc17)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_57, negated_conjecture, (male(skc42,skc49)|ssSkC0)).
% 41.95/5.86  cnf(i_0_60, negated_conjecture, (male(skc42,skc45)|ssSkC0)).
% 41.95/5.86  cnf(i_0_71, negated_conjecture, (cry(skc16,skc20)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_58, negated_conjecture, (man(skc42,skc49)|ssSkC0)).
% 41.95/5.86  cnf(i_0_59, negated_conjecture, (revenge(skc42,skc46)|ssSkC0)).
% 41.95/5.86  cnf(i_0_61, negated_conjecture, (scream(skc42,skc43)|ssSkC0)).
% 41.95/5.86  cnf(i_0_62, negated_conjecture, (nonreflexive(skc42,skc43)|ssSkC0)).
% 41.95/5.86  cnf(i_0_63, negated_conjecture, (present(skc42,skc43)|ssSkC0)).
% 41.95/5.86  cnf(i_0_64, negated_conjecture, (event(skc42,skc43)|ssSkC0)).
% 41.95/5.86  cnf(i_0_65, negated_conjecture, (cry(skc42,skc44)|ssSkC0)).
% 41.95/5.86  cnf(i_0_82, negated_conjecture, (of(skc16,skc22,skc23)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_78, negated_conjecture, (of(skc42,skc48,skc49)|ssSkC0)).
% 41.95/5.86  cnf(i_0_79, negated_conjecture, (of(skc42,skc43,skc46)|ssSkC0)).
% 41.95/5.86  cnf(i_0_89, negated_conjecture, (shot(skc16,X1)|~member(skc16,X1,skc21)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_85, negated_conjecture, (of(skc16,skc17,skc18)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_84, negated_conjecture, (agent(skc16,skc17,skc19)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_83, negated_conjecture, (patient(skc16,skc17,skc20)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_80, negated_conjecture, (agent(skc42,skc43,skc45)|ssSkC0)).
% 41.95/5.86  cnf(i_0_81, negated_conjecture, (patient(skc42,skc43,skc44)|ssSkC0)).
% 41.95/5.86  cnf(i_0_87, negated_conjecture, (ssSkP0(skc22,skc23,skc21,skc16)|~ssSkC0)).
% 41.95/5.86  cnf(i_0_86, negated_conjecture, (ssSkP0(skc48,skc49,skc47,skc42)|ssSkC0)).
% 41.95/5.86  cnf(i_0_88, negated_conjecture, (shot(skc42,X1)|ssSkC0|~member(skc42,X1,skc47))).
% 41.95/5.86  cnf(i_0_90, negated_conjecture, (member(X1,skf8(X2,X1,X3,X4),X2)|ssSkP0(X5,X6,X2,X1))).
% 41.95/5.86  cnf(i_0_93, negated_conjecture, (nonreflexive(X1,skf6(X1,X2,X3,X4))|~member(X1,X5,X6)|~ssSkP0(X7,X8,X6,X1))).
% 41.95/5.86  cnf(i_0_92, negated_conjecture, (present(X1,skf6(X1,X2,X3,X4))|~member(X1,X5,X6)|~ssSkP0(X7,X8,X6,X1))).
% 41.95/5.86  cnf(i_0_91, negated_conjecture, (event(X1,skf6(X1,X2,X3,X4))|~member(X1,X5,X6)|~ssSkP0(X7,X8,X6,X1))).
% 41.95/5.86  cnf(i_0_94, negated_conjecture, (fire(X1,skf6(X1,X2,X3,X4))|~member(X1,X5,X6)|~ssSkP0(X7,X8,X6,X1))).
% 41.95/5.86  cnf(i_0_95, negated_conjecture, (agent(X1,skf6(X1,X2,X3,X4),X4)|~member(X1,X2,X5)|~ssSkP0(X3,X4,X5,X1))).
% 41.95/5.86  cnf(i_0_96, negated_conjecture, (patient(X1,skf6(X1,X2,X3,X4),X2)|~member(X1,X2,X5)|~ssSkP0(X6,X7,X5,X1))).
% 41.95/5.86  cnf(i_0_97, negated_conjecture, (from_loc(X1,skf6(X1,X2,X3,X4),X3)|~member(X1,X2,X5)|~ssSkP0(X3,X6,X5,X1))).
% 41.95/5.86  cnf(i_0_98, negated_conjecture, (ssSkP0(X1,X2,X3,X4)|~from_loc(X4,X5,X1)|~fire(X4,X5)|~patient(X4,X5,skf8(X3,X4,X1,X2))|~agent(X4,X5,X2)|~event(X4,X5)|~present(X4,X5)|~nonreflexive(X4,X5))).
% 41.95/5.86  cnf(i_0_101, negated_conjecture, (~shot(X1,skf5(X1,X2))|~ssSkP0(X3,X4,X5,X1)|~patient(X1,X6,X7)|~agent(X1,X6,X8)|~of(X1,X6,X9)|~of(X1,X3,X4)|~cry(X1,X7)|~event(X1,X6)|~present(X1,X6)|~nonreflexive(X1,X6)|~scream(X1,X6)|~revenge(X1,X9)|~man(X1,X4)|~male(X1,X8)|~male(X1,X4)|~cannon(X1,X3)|~group(X1,X5)|~six(X1,X5)|~ssSkC0|~actual_world(X1))).
% 41.95/5.86  cnf(i_0_99, negated_conjecture, (ssSkC0|~shot(X1,skf10(X1,X2))|~ssSkP0(X3,X4,X5,X1)|~patient(X1,X6,X7)|~agent(X1,X6,X8)|~of(X1,X6,X9)|~of(X1,X3,X4)|~cry(X1,X7)|~event(X1,X6)|~present(X1,X6)|~nonreflexive(X1,X6)|~scream(X1,X6)|~revenge(X1,X9)|~man(X1,X4)|~male(X1,X8)|~male(X1,X4)|~cannon(X1,X3)|~group(X1,X5)|~six(X1,X5)|~actual_world(X1))).
% 41.95/5.86  cnf(i_0_100, negated_conjecture, (member(X1,skf10(X1,X2),X2)|ssSkC0|~ssSkP0(X3,X4,X2,X1)|~patient(X1,X5,X6)|~agent(X1,X5,X7)|~of(X1,X5,X8)|~of(X1,X3,X4)|~cry(X1,X6)|~event(X1,X5)|~present(X1,X5)|~nonreflexive(X1,X5)|~scream(X1,X5)|~revenge(X1,X8)|~man(X1,X4)|~male(X1,X7)|~male(X1,X4)|~cannon(X1,X3)|~group(X1,X2)|~six(X1,X2)|~actual_world(X1))).
% 41.95/5.86  cnf(i_0_102, negated_conjecture, (member(X1,skf5(X1,X2),X2)|~ssSkP0(X3,X4,X2,X1)|~patient(X1,X5,X6)|~agent(X1,X5,X7)|~of(X1,X5,X8)|~of(X1,X3,X4)|~cry(X1,X6)|~event(X1,X5)|~present(X1,X5)|~nonreflexive(X1,X5)|~scream(X1,X5)|~revenge(X1,X8)|~man(X1,X4)|~male(X1,X7)|~male(X1,X4)|~cannon(X1,X3)|~group(X1,X2)|~six(X1,X2)|~ssSkC0|~actual_world(X1))).
% 41.95/5.86  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 41.95/5.86  # Begin printing tableau
% 41.95/5.86  # Found 27 steps
% 41.95/5.86  cnf(i_0_86, negated_conjecture, (ssSkP0(skc48,skc49,skc47,skc42)|ssSkC0), inference(start_rule)).
% 41.95/5.86  cnf(i_0_115469, plain, (ssSkP0(skc48,skc49,skc47,skc42)), inference(extension_rule, [i_0_97])).
% 41.95/5.86  cnf(i_0_283700, plain, (from_loc(skc42,skf6(skc42,skf8(skc47,skc42,skc48,skc49),skc48,skc49),skc48)), inference(extension_rule, [i_0_98])).
% 41.95/5.86  cnf(i_0_115470, plain, (ssSkC0), inference(etableau_closure_rule, [i_0_115470, ...])).
% 41.95/5.86  cnf(i_0_283769, plain, (ssSkP0(skc48,skc49,skc47,skc42)), inference(extension_rule, [i_0_92])).
% 41.95/5.86  cnf(i_0_283771, plain, (~fire(skc42,skf6(skc42,skf8(skc47,skc42,skc48,skc49),skc48,skc49))), inference(extension_rule, [i_0_94])).
% 41.95/5.86  cnf(i_0_283957, plain, (~ssSkP0(skc48,skc49,skc47,skc42)), inference(closure_rule, [i_0_115469])).
% 41.95/5.86  cnf(i_0_283772, plain, (~patient(skc42,skf6(skc42,skf8(skc47,skc42,skc48,skc49),skc48,skc49),skf8(skc47,skc42,skc48,skc49))), inference(extension_rule, [i_0_96])).
% 41.95/5.86  cnf(i_0_284100, plain, (~ssSkP0(skc48,skc49,skc47,skc42)), inference(closure_rule, [i_0_115469])).
% 41.95/5.86  cnf(i_0_283773, plain, (~agent(skc42,skf6(skc42,skf8(skc47,skc42,skc48,skc49),skc48,skc49),skc49)), inference(extension_rule, [i_0_95])).
% 41.95/5.86  cnf(i_0_284243, plain, (~ssSkP0(skc48,skc49,skc47,skc42)), inference(closure_rule, [i_0_115469])).
% 41.95/5.86  cnf(i_0_283774, plain, (~event(skc42,skf6(skc42,skf8(skc47,skc42,skc48,skc49),skc48,skc49))), inference(extension_rule, [i_0_91])).
% 41.95/5.86  cnf(i_0_284318, plain, (~ssSkP0(skc48,skc49,skc47,skc42)), inference(closure_rule, [i_0_115469])).
% 41.95/5.86  cnf(i_0_283775, plain, (~present(skc42,skf6(skc42,skf8(skc47,skc42,skc48,skc49),skc48,skc49))), inference(extension_rule, [i_0_92])).
% 41.95/5.86  cnf(i_0_284491, plain, (~ssSkP0(skc48,skc49,skc47,skc42)), inference(closure_rule, [i_0_115469])).
% 41.95/5.86  cnf(i_0_283776, plain, (~nonreflexive(skc42,skf6(skc42,skf8(skc47,skc42,skc48,skc49),skc48,skc49))), inference(extension_rule, [i_0_93])).
% 41.95/5.86  cnf(i_0_284586, plain, (~ssSkP0(skc48,skc49,skc47,skc42)), inference(closure_rule, [i_0_115469])).
% 41.95/5.86  cnf(i_0_283701, plain, (~member(skc42,skf8(skc47,skc42,skc48,skc49),skc47)), inference(extension_rule, [i_0_90])).
% 41.95/5.86  cnf(i_0_283882, plain, (present(skc42,skf6(skc42,X11,X12,X14))), inference(etableau_closure_rule, [i_0_283882, ...])).
% 41.95/5.86  cnf(i_0_283883, plain, (~member(skc42,X15,skc47)), inference(etableau_closure_rule, [i_0_283883, ...])).
% 41.95/5.86  cnf(i_0_283956, plain, (~member(skc42,X20,skc47)), inference(etableau_closure_rule, [i_0_283956, ...])).
% 41.95/5.86  cnf(i_0_284099, plain, (~member(skc42,skf8(skc47,skc42,skc48,skc49),skc47)), inference(etableau_closure_rule, [i_0_284099, ...])).
% 41.95/5.86  cnf(i_0_284242, plain, (~member(skc42,skf8(skc47,skc42,skc48,skc49),skc47)), inference(etableau_closure_rule, [i_0_284242, ...])).
% 41.95/5.86  cnf(i_0_284317, plain, (~member(skc42,X18,skc47)), inference(etableau_closure_rule, [i_0_284317, ...])).
% 41.95/5.86  cnf(i_0_284490, plain, (~member(skc42,X19,skc47)), inference(etableau_closure_rule, [i_0_284490, ...])).
% 41.95/5.86  cnf(i_0_284585, plain, (~member(skc42,X21,skc47)), inference(etableau_closure_rule, [i_0_284585, ...])).
% 41.95/5.86  cnf(i_0_284722, plain, (ssSkP0(X13,X17,skc47,skc42)), inference(etableau_closure_rule, [i_0_284722, ...])).
% 41.95/5.86  # End printing tableau
% 41.95/5.86  # SZS output end
% 41.95/5.86  # Branches closed with saturation will be marked with an "s"
% 41.95/5.87  # Child (28467) has found a proof.
% 41.95/5.87  
% 41.95/5.87  # Proof search is over...
% 41.95/5.87  # Freeing feature tree
%------------------------------------------------------------------------------