TSTP Solution File: NLP080-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP080-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:12:22 EDT 2022
% Result : Unsatisfiable 39.56s 5.37s
% Output : CNFRefutation 39.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NLP080-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.32 % Computer : n026.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jun 30 17:15:34 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.36 # No SInE strategy applied
% 0.11/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.11/0.36 # and selection function SelectCQArNTNpEqFirst.
% 0.11/0.36 #
% 0.11/0.36 # Presaturation interreduction done
% 0.11/0.36 # Number of axioms: 51 Number of unprocessed: 51
% 0.11/0.36 # Tableaux proof search.
% 0.11/0.36 # APR header successfully linked.
% 0.11/0.36 # Hello from C++
% 0.11/0.36 # The folding up rule is enabled...
% 0.11/0.36 # Local unification is enabled...
% 0.11/0.36 # Any saturation attempts will use folding labels...
% 0.11/0.36 # 51 beginning clauses after preprocessing and clausification
% 0.11/0.36 # Creating start rules for all 51 conjectures.
% 0.11/0.36 # There are 51 start rule candidates:
% 0.11/0.36 # Found 2 unit axioms.
% 0.11/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.11/0.36 # 51 start rule tableaux created.
% 0.11/0.36 # 49 extension rule candidate clauses
% 0.11/0.36 # 2 unit axiom clauses
% 0.11/0.36
% 0.11/0.36 # Requested 8, 32 cores available to the main process.
% 9.35/1.57 # Ran out of tableaux, making start rules for all clauses
% 30.80/4.30 # Ran out of tableaux, making start rules for all clauses
% 39.56/5.37 # There were 168 total branch saturation attempts.
% 39.56/5.37 # There were 0 of these attempts blocked.
% 39.56/5.37 # There were 0 deferred branch saturation attempts.
% 39.56/5.37 # There were 37 free duplicated saturations.
% 39.56/5.37 # There were 168 total successful branch saturations.
% 39.56/5.37 # There were 5 successful branch saturations in interreduction.
% 39.56/5.37 # There were 0 successful branch saturations on the branch.
% 39.56/5.37 # There were 126 successful branch saturations after the branch.
% 39.56/5.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 39.56/5.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 39.56/5.37 # Begin clausification derivation
% 39.56/5.37
% 39.56/5.37 # End clausification derivation
% 39.56/5.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 39.56/5.37 cnf(i_0_52, negated_conjecture, (actual_world(skc39))).
% 39.56/5.37 cnf(i_0_53, negated_conjecture, (actual_world(skc14))).
% 39.56/5.37 cnf(i_0_77, negated_conjecture, (revenge(skc14,skc16)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_67, negated_conjecture, (event(skc14,skc15)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_68, negated_conjecture, (present(skc14,skc15)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_54, negated_conjecture, (revenge(skc39,skc45)|ssSkC0)).
% 39.56/5.37 cnf(i_0_55, negated_conjecture, (event(skc39,skc40)|ssSkC0)).
% 39.56/5.37 cnf(i_0_69, negated_conjecture, (nonreflexive(skc14,skc15)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_70, negated_conjecture, (scream(skc14,skc15)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_71, negated_conjecture, (group(skc14,skc17)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_72, negated_conjecture, (six(skc14,skc17)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_56, negated_conjecture, (present(skc39,skc40)|ssSkC0)).
% 39.56/5.37 cnf(i_0_73, negated_conjecture, (male(skc14,skc17)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_76, negated_conjecture, (male(skc14,skc19)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_74, negated_conjecture, (cannon(skc14,skc18)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_75, negated_conjecture, (man(skc14,skc19)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_57, negated_conjecture, (nonreflexive(skc39,skc40)|ssSkC0)).
% 39.56/5.37 cnf(i_0_58, negated_conjecture, (scream(skc39,skc40)|ssSkC0)).
% 39.56/5.37 cnf(i_0_66, negated_conjecture, (cry(skc14,skc20)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_59, negated_conjecture, (group(skc39,skc42)|ssSkC0)).
% 39.56/5.37 cnf(i_0_60, negated_conjecture, (six(skc39,skc42)|ssSkC0)).
% 39.56/5.37 cnf(i_0_61, negated_conjecture, (male(skc39,skc42)|ssSkC0)).
% 39.56/5.37 cnf(i_0_64, negated_conjecture, (male(skc39,skc44)|ssSkC0)).
% 39.56/5.37 cnf(i_0_62, negated_conjecture, (cannon(skc39,skc43)|ssSkC0)).
% 39.56/5.37 cnf(i_0_63, negated_conjecture, (man(skc39,skc44)|ssSkC0)).
% 39.56/5.37 cnf(i_0_65, negated_conjecture, (cry(skc39,skc41)|ssSkC0)).
% 39.56/5.37 cnf(i_0_85, negated_conjecture, (of(skc14,skc15,skc16)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_78, negated_conjecture, (of(skc39,skc40,skc45)|ssSkC0)).
% 39.56/5.37 cnf(i_0_80, negated_conjecture, (of(skc39,skc43,skc44)|ssSkC0)).
% 39.56/5.37 cnf(i_0_89, negated_conjecture, (shot(skc14,X1)|~member(skc14,X1,skc17)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_84, negated_conjecture, (of(skc14,skc18,skc19)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_83, negated_conjecture, (agent(skc14,skc15,skc17)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_82, negated_conjecture, (patient(skc14,skc15,skc20)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_79, negated_conjecture, (agent(skc39,skc40,skc42)|ssSkC0)).
% 39.56/5.37 cnf(i_0_81, negated_conjecture, (patient(skc39,skc40,skc41)|ssSkC0)).
% 39.56/5.37 cnf(i_0_87, negated_conjecture, (ssSkP0(skc18,skc19,skc17,skc14)|~ssSkC0)).
% 39.56/5.37 cnf(i_0_86, negated_conjecture, (ssSkP0(skc43,skc44,skc42,skc39)|ssSkC0)).
% 39.56/5.37 cnf(i_0_88, negated_conjecture, (shot(skc39,X1)|ssSkC0|~member(skc39,X1,skc42))).
% 39.56/5.37 cnf(i_0_90, negated_conjecture, (member(X1,skf9(X2,X1,X3,X4),X2)|ssSkP0(X5,X6,X2,X1))).
% 39.56/5.37 cnf(i_0_91, negated_conjecture, (event(X1,skf7(X1,X2,X3,X4))|~member(X1,X5,X6)|~ssSkP0(X7,X8,X6,X1))).
% 39.56/5.37 cnf(i_0_92, negated_conjecture, (present(X1,skf7(X1,X2,X3,X4))|~member(X1,X5,X6)|~ssSkP0(X7,X8,X6,X1))).
% 39.56/5.37 cnf(i_0_93, negated_conjecture, (nonreflexive(X1,skf7(X1,X2,X3,X4))|~member(X1,X5,X6)|~ssSkP0(X7,X8,X6,X1))).
% 39.56/5.37 cnf(i_0_94, negated_conjecture, (fire(X1,skf7(X1,X2,X3,X4))|~member(X1,X5,X6)|~ssSkP0(X7,X8,X6,X1))).
% 39.56/5.37 cnf(i_0_95, negated_conjecture, (agent(X1,skf7(X1,X2,X3,X4),X4)|~member(X1,X2,X5)|~ssSkP0(X3,X4,X5,X1))).
% 39.56/5.37 cnf(i_0_96, negated_conjecture, (patient(X1,skf7(X1,X2,X3,X4),X2)|~member(X1,X2,X5)|~ssSkP0(X6,X7,X5,X1))).
% 39.56/5.37 cnf(i_0_97, negated_conjecture, (from_loc(X1,skf7(X1,X2,X3,X4),X3)|~member(X1,X2,X5)|~ssSkP0(X3,X6,X5,X1))).
% 39.56/5.37 cnf(i_0_98, negated_conjecture, (ssSkP0(X1,X2,X3,X4)|~from_loc(X4,X5,X1)|~fire(X4,X5)|~patient(X4,X5,skf9(X3,X4,X1,X2))|~agent(X4,X5,X2)|~nonreflexive(X4,X5)|~present(X4,X5)|~event(X4,X5))).
% 39.56/5.37 cnf(i_0_101, negated_conjecture, (~shot(X1,skf6(X1,X2))|~ssSkP0(X3,X4,X5,X1)|~patient(X1,X6,X7)|~agent(X1,X6,X5)|~of(X1,X3,X4)|~of(X1,X6,X8)|~cry(X1,X7)|~man(X1,X4)|~cannon(X1,X3)|~male(X1,X4)|~male(X1,X5)|~six(X1,X5)|~group(X1,X5)|~scream(X1,X6)|~nonreflexive(X1,X6)|~present(X1,X6)|~event(X1,X6)|~revenge(X1,X8)|~ssSkC0|~actual_world(X1))).
% 39.56/5.37 cnf(i_0_99, negated_conjecture, (ssSkC0|~shot(X1,skf12(X1,X2))|~ssSkP0(X3,X4,X5,X1)|~patient(X1,X6,X7)|~agent(X1,X6,X5)|~of(X1,X3,X4)|~of(X1,X6,X8)|~cry(X1,X7)|~man(X1,X4)|~cannon(X1,X3)|~male(X1,X4)|~male(X1,X5)|~six(X1,X5)|~group(X1,X5)|~scream(X1,X6)|~nonreflexive(X1,X6)|~present(X1,X6)|~event(X1,X6)|~revenge(X1,X8)|~actual_world(X1))).
% 39.56/5.37 cnf(i_0_100, negated_conjecture, (member(X1,skf12(X1,X2),X2)|ssSkC0|~ssSkP0(X3,X4,X2,X1)|~patient(X1,X5,X6)|~agent(X1,X5,X2)|~of(X1,X3,X4)|~of(X1,X5,X7)|~cry(X1,X6)|~man(X1,X4)|~cannon(X1,X3)|~male(X1,X4)|~male(X1,X2)|~six(X1,X2)|~group(X1,X2)|~scream(X1,X5)|~nonreflexive(X1,X5)|~present(X1,X5)|~event(X1,X5)|~revenge(X1,X7)|~actual_world(X1))).
% 39.56/5.37 cnf(i_0_102, negated_conjecture, (member(X1,skf6(X1,X2),X2)|~ssSkP0(X3,X4,X2,X1)|~patient(X1,X5,X6)|~agent(X1,X5,X2)|~of(X1,X3,X4)|~of(X1,X5,X7)|~cry(X1,X6)|~man(X1,X4)|~cannon(X1,X3)|~male(X1,X4)|~male(X1,X2)|~six(X1,X2)|~group(X1,X2)|~scream(X1,X5)|~nonreflexive(X1,X5)|~present(X1,X5)|~event(X1,X5)|~revenge(X1,X7)|~ssSkC0|~actual_world(X1))).
% 39.56/5.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 39.56/5.37 # Begin printing tableau
% 39.56/5.37 # Found 6 steps
% 39.56/5.37 cnf(i_0_86, negated_conjecture, (ssSkP0(skc43,skc44,skc42,skc39)|ssSkC0), inference(start_rule)).
% 39.56/5.37 cnf(i_0_114064, plain, (ssSkC0), inference(extension_rule, [i_0_87])).
% 39.56/5.37 cnf(i_0_299357, plain, (ssSkP0(skc18,skc19,skc17,skc14)), inference(extension_rule, [i_0_91])).
% 39.56/5.37 cnf(i_0_114063, plain, (ssSkP0(skc43,skc44,skc42,skc39)), inference(etableau_closure_rule, [i_0_114063, ...])).
% 39.56/5.37 cnf(i_0_299461, plain, (event(skc14,skf7(skc14,X10,X11,X12))), inference(etableau_closure_rule, [i_0_299461, ...])).
% 39.56/5.37 cnf(i_0_299462, plain, (~member(skc14,X13,skc17)), inference(etableau_closure_rule, [i_0_299462, ...])).
% 39.56/5.37 # End printing tableau
% 39.56/5.37 # SZS output end
% 39.56/5.37 # Branches closed with saturation will be marked with an "s"
% 39.56/5.37 # Child (19425) has found a proof.
% 39.56/5.37
% 39.56/5.37 # Proof search is over...
% 39.56/5.37 # Freeing feature tree
%------------------------------------------------------------------------------