TSTP Solution File: NLP062-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP062-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 : n008.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:10 EDT 2022
% Result : Satisfiable 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NLP062-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.12/0.33 % Computer : n008.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 : Thu Jun 30 17:13:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.12/0.36 # and selection function SelectCQArNTNpEqFirst.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 40 Number of unprocessed: 40
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 40 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 40 conjectures.
% 0.12/0.37 # There are 40 start rule candidates:
% 0.12/0.37 # Found 2 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 40 start rule tableaux created.
% 0.12/0.37 # 38 extension rule candidate clauses
% 0.12/0.37 # 2 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.50 # 18414 Satisfiable branch
% 0.19/0.50 # Satisfiable branch found.
% 0.19/0.50 # There were 1 total branch saturation attempts.
% 0.19/0.50 # There were 0 of these attempts blocked.
% 0.19/0.50 # There were 0 deferred branch saturation attempts.
% 0.19/0.50 # There were 0 free duplicated saturations.
% 0.19/0.50 # There were 0 total successful branch saturations.
% 0.19/0.50 # There were 0 successful branch saturations in interreduction.
% 0.19/0.50 # There were 0 successful branch saturations on the branch.
% 0.19/0.50 # There were 0 successful branch saturations after the branch.
% 0.19/0.50 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.50 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.50 # Begin clausification derivation
% 0.19/0.50
% 0.19/0.50 # End clausification derivation
% 0.19/0.50 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.50 cnf(i_0_41, negated_conjecture, (actual_world(skc60))).
% 0.19/0.50 cnf(i_0_42, negated_conjecture, (actual_world(skc6))).
% 0.19/0.50 cnf(i_0_50, negated_conjecture, (ssSkP1(skc8,skc7,skc6)|~ssSkC0)).
% 0.19/0.50 cnf(i_0_46, negated_conjecture, (six(skc6,skc7)|~ssSkC0)).
% 0.19/0.50 cnf(i_0_47, negated_conjecture, (group(skc6,skc7)|~ssSkC0)).
% 0.19/0.50 cnf(i_0_43, negated_conjecture, (six(skc60,skc61)|ssSkC0)).
% 0.19/0.50 cnf(i_0_44, negated_conjecture, (group(skc60,skc61)|ssSkC0)).
% 0.19/0.50 cnf(i_0_48, negated_conjecture, (male(skc6,skc8)|~ssSkC0)).
% 0.19/0.50 cnf(i_0_45, negated_conjecture, (male(skc60,skc62)|ssSkC0)).
% 0.19/0.50 cnf(i_0_49, negated_conjecture, (ssSkP0(skc61,skc62,skc60)|ssSkC0)).
% 0.19/0.50 cnf(i_0_52, negated_conjecture, (shot(skc6,X1)|~member(skc6,X1,skc7)|~ssSkC0)).
% 0.19/0.50 cnf(i_0_51, negated_conjecture, (shot(skc60,X1)|ssSkC0|~member(skc60,X1,skc61))).
% 0.19/0.50 cnf(i_0_53, negated_conjecture, (cannon(X1,skf19(X1,X2,X3))|ssSkP0(X4,X5,X1))).
% 0.19/0.50 cnf(i_0_54, negated_conjecture, (man(X1,skf27(X1,X2,X3))|ssSkP1(X4,X5,X1))).
% 0.19/0.50 cnf(i_0_55, negated_conjecture, (member(X1,skf16(X2,X1,X3),X2)|ssSkP0(X2,X4,X1))).
% 0.19/0.50 cnf(i_0_57, negated_conjecture, (member(X1,skf24(X2,X1,X3),X2)|ssSkP1(X4,X2,X1))).
% 0.19/0.50 cnf(i_0_56, negated_conjecture, (of(X1,skf19(X1,X2,X3),X2)|ssSkP0(X4,X2,X1))).
% 0.19/0.50 cnf(i_0_62, negated_conjecture, (cannon(X1,skf21(X1,X2,X3,X4))|~man(X1,X5)|~member(X1,X6,X7)|~ssSkP1(X8,X7,X1))).
% 0.19/0.50 cnf(i_0_76, negated_conjecture, (~shot(X1,skf11(X1,X2))|~ssSkP0(X3,X4,X1)|~male(X1,X4)|~group(X1,X3)|~six(X1,X3)|~ssSkC0|~actual_world(X1))).
% 0.19/0.50 cnf(i_0_74, negated_conjecture, (ssSkC0|~shot(X1,skf29(X1,X2))|~ssSkP1(X3,X4,X1)|~male(X1,X3)|~group(X1,X4)|~six(X1,X4)|~actual_world(X1))).
% 0.19/0.50 cnf(i_0_67, negated_conjecture, (man(X1,skf13(X1,X2,X3))|~of(X1,X4,X5)|~cannon(X1,X4)|~member(X1,X6,X7)|~ssSkP0(X7,X5,X1))).
% 0.19/0.50 cnf(i_0_77, negated_conjecture, (member(X1,skf11(X1,X2),X2)|~ssSkP0(X2,X3,X1)|~male(X1,X3)|~group(X1,X2)|~six(X1,X2)|~ssSkC0|~actual_world(X1))).
% 0.19/0.50 cnf(i_0_58, negated_conjecture, (event(X1,skf20(X1,X2,X3,X4))|~man(X1,X5)|~member(X1,X6,X7)|~ssSkP1(X8,X7,X1))).
% 0.19/0.50 cnf(i_0_75, negated_conjecture, (member(X1,skf29(X1,X2),X2)|ssSkC0|~ssSkP1(X3,X2,X1)|~male(X1,X3)|~group(X1,X2)|~six(X1,X2)|~actual_world(X1))).
% 0.19/0.50 cnf(i_0_59, negated_conjecture, (present(X1,skf20(X1,X2,X3,X4))|~man(X1,X5)|~member(X1,X6,X7)|~ssSkP1(X8,X7,X1))).
% 0.19/0.50 cnf(i_0_60, negated_conjecture, (nonreflexive(X1,skf20(X1,X2,X3,X4))|~man(X1,X5)|~member(X1,X6,X7)|~ssSkP1(X8,X7,X1))).
% 0.19/0.50 cnf(i_0_61, negated_conjecture, (fire(X1,skf20(X1,X2,X3,X4))|~man(X1,X5)|~member(X1,X6,X7)|~ssSkP1(X8,X7,X1))).
% 0.19/0.50 cnf(i_0_68, negated_conjecture, (event(X1,skf12(X1,X2,X3))|~of(X1,X4,X5)|~cannon(X1,X4)|~member(X1,X6,X7)|~ssSkP0(X7,X5,X1))).
% 0.19/0.50 cnf(i_0_63, negated_conjecture, (of(X1,skf21(X1,X2,X3,X4),X2)|~man(X1,X5)|~member(X1,X6,X7)|~ssSkP1(X2,X7,X1))).
% 0.19/0.50 cnf(i_0_69, negated_conjecture, (present(X1,skf12(X1,X2,X3))|~of(X1,X4,X5)|~cannon(X1,X4)|~member(X1,X6,X7)|~ssSkP0(X7,X5,X1))).
% 0.19/0.50 cnf(i_0_70, negated_conjecture, (nonreflexive(X1,skf12(X1,X2,X3))|~of(X1,X4,X5)|~cannon(X1,X4)|~member(X1,X6,X7)|~ssSkP0(X7,X5,X1))).
% 0.19/0.50 cnf(i_0_66, negated_conjecture, (fire(X1,skf12(X1,X2,X3))|~of(X1,X4,X5)|~cannon(X1,X4)|~member(X1,X6,X7)|~ssSkP0(X7,X5,X1))).
% 0.19/0.50 cnf(i_0_64, negated_conjecture, (agent(X1,skf20(X1,X2,X3,X4),X2)|~man(X1,X2)|~member(X1,X5,X6)|~ssSkP1(X7,X6,X1))).
% 0.19/0.50 cnf(i_0_65, negated_conjecture, (patient(X1,skf20(X1,X2,X3,X4),X3)|~man(X1,X2)|~member(X1,X3,X5)|~ssSkP1(X6,X5,X1))).
% 0.19/0.50 cnf(i_0_73, negated_conjecture, (patient(X1,skf12(X1,X2,X3),X3)|~of(X1,X2,X4)|~cannon(X1,X2)|~member(X1,X3,X5)|~ssSkP0(X5,X4,X1))).
% 0.19/0.50 cnf(i_0_71, negated_conjecture, (from_loc(X1,skf12(X1,X2,X3),X2)|~of(X1,X2,X4)|~cannon(X1,X2)|~member(X1,X5,X6)|~ssSkP0(X6,X4,X1))).
% 0.19/0.50 cnf(i_0_78, negated_conjecture, (agent(X1,skf12(X1,X2,X3),skf13(X1,X3,X2))|~of(X1,X4,X5)|~cannon(X1,X4)|~member(X1,X6,X7)|~ssSkP0(X7,X5,X1))).
% 0.19/0.50 cnf(i_0_72, negated_conjecture, (from_loc(X1,skf20(X1,X2,X3,X4),skf21(X1,X4,X3,X2))|~man(X1,X2)|~member(X1,X3,X5)|~ssSkP1(X4,X5,X1))).
% 0.19/0.50 cnf(i_0_79, negated_conjecture, (ssSkP0(X1,X2,X3)|~from_loc(X3,X4,skf19(X3,X2,X1))|~patient(X3,X4,skf16(X1,X3,X2))|~agent(X3,X4,X5)|~fire(X3,X4)|~nonreflexive(X3,X4)|~present(X3,X4)|~event(X3,X4)|~man(X3,X5))).
% 0.19/0.50 cnf(i_0_80, negated_conjecture, (ssSkP1(X1,X2,X3)|~from_loc(X3,X4,X5)|~patient(X3,X4,skf24(X2,X3,X1))|~agent(X3,X4,skf27(X3,X2,X1))|~fire(X3,X4)|~nonreflexive(X3,X4)|~present(X3,X4)|~event(X3,X4)|~of(X3,X5,X1)|~cannon(X3,X5))).
% 0.19/0.50 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.50 # Begin printing tableau
% 0.19/0.50 # Found 22 steps
% 0.19/0.50 cnf(i_0_79, negated_conjecture, (ssSkP0(skc61,skc62,skc60)|~from_loc(skc60,skf12(skc60,skf19(skc60,skc62,skc61),skf16(skc61,skc60,skc62)),skf19(skc60,skc62,skc61))|~patient(skc60,skf12(skc60,skf19(skc60,skc62,skc61),skf16(skc61,skc60,skc62)),skf16(skc61,skc60,skc62))|~agent(skc60,skf12(skc60,skf19(skc60,skc62,skc61),skf16(skc61,skc60,skc62)),skf13(skc60,skf16(skc61,skc60,skc62),skf19(skc60,skc62,skc61)))|~fire(skc60,skf12(skc60,skf19(skc60,skc62,skc61),skf16(skc61,skc60,skc62)))|~nonreflexive(skc60,skf12(skc60,skf19(skc60,skc62,skc61),skf16(skc61,skc60,skc62)))|~present(skc60,skf12(skc60,skf19(skc60,skc62,skc61),skf16(skc61,skc60,skc62)))|~event(skc60,skf12(skc60,skf19(skc60,skc62,skc61),skf16(skc61,skc60,skc62)))|~man(skc60,skf13(skc60,skf16(skc61,skc60,skc62),skf19(skc60,skc62,skc61)))), inference(start_rule)).
% 0.19/0.50 cnf(i_0_91, plain, (ssSkP0(skc61,skc62,skc60)), inference(closure_rule, [i_0_0])).
% 0.19/0.50 cnf(i_0_92, plain, (~from_loc(skc60,skf12(skc60,skf19(skc60,skc62,skc61),skf16(skc61,skc60,skc62)),skf19(skc60,skc62,skc61))), inference(extension_rule, [i_0_71])).
% 0.19/0.50 cnf(i_0_445, plain, (~of(skc60,skf19(skc60,skc62,skc61),skc62)), inference(extension_rule, [i_0_56])).
% 0.19/0.50 cnf(i_0_563, plain, (ssSkP0(X17,skc62,skc60)), inference(extension_rule, [i_0_73])).
% 0.19/0.50 cnf(i_0_446, plain, (~cannon(skc60,skf19(skc60,skc62,skc61))), inference(extension_rule, [i_0_53])).
% 0.19/0.50 cnf(i_0_707, plain, (ssSkP0(X24,X22,skc60)), inference(extension_rule, [i_0_66])).
% 0.19/0.50 cnf(i_0_447, plain, (~member(skc60,skf24(X29,skc60,X18),X29)), inference(extension_rule, [i_0_57])).
% 0.19/0.50 cnf(i_0_1906, plain, (ssSkP1(X25,X29,skc60)), inference(extension_rule, [i_0_72])).
% 0.19/0.50 cnf(i_0_448, plain, (~ssSkP0(X29,skc62,skc60)), inference(extension_rule, [i_0_55])).
% 0.19/0.50 cnf(i_0_1977, plain, (member(skc60,skf16(X29,skc60,X32),X29)), inference(extension_rule, [i_0_65])).
% 0.19/0.50 cnf(i_0_93, plain, (~patient(skc60,skf12(skc60,skf19(skc60,skc62,skc61),skf16(skc61,skc60,skc62)),skf16(skc61,skc60,skc62))), inference(extension_rule, [i_0_73])).
% 0.19/0.50 cnf(i_0_2082, plain, (~of(skc60,skf19(skc60,skc62,skc61),skc62)), inference(extension_rule, [i_0_56])).
% 0.19/0.50 cnf(i_0_2183, plain, (ssSkP0(X36,skc62,skc60)), inference(extension_rule, [i_0_70])).
% 0.19/0.50 cnf(i_0_2083, plain, (~cannon(skc60,skf19(skc60,skc62,skc61))), inference(extension_rule, [i_0_53])).
% 0.19/0.50 cnf(i_0_2285, plain, (ssSkP0(X41,X39,skc60)), inference(extension_rule, [i_0_69])).
% 0.19/0.50 cnf(i_0_2084, plain, (~member(skc60,skf16(skc61,skc60,skc62),skc61)), inference(extension_rule, [i_0_55])).
% 0.19/0.50 cnf(i_0_2426, plain, (ssSkP0(skc61,X44,skc60)), inference(extension_rule, [i_0_68])).
% 0.19/0.50 cnf(i_0_2085, plain, (~ssSkP0(skc61,skc62,skc60)), inference(extension_rule, [i_0_49])).
% 0.19/0.50 cnf(i_0_2496, plain, (ssSkC0), inference(extension_rule, [i_0_76])).
% 0.19/0.50 cnf(i_0_2539, plain, (~actual_world(skc6)), inference(closure_rule, [i_0_42])).
% 0.19/0.50 cnf(i_0_94, plain, (~agent(skc60,skf12(skc60,skf19(skc60,skc62,skc61),skf16(skc61,skc60,skc62)),skf13(skc60,skf16(skc61,skc60,skc62),skf19(skc60,skc62,skc61)))), inference(extension_rule, [i_0_78])).
% 0.19/0.50 # End printing tableau
% 0.19/0.50 # SZS output end
% 0.19/0.50 # Branches closed with saturation will be marked with an "s"
% 0.19/0.51 # Child (18414) has found a proof.
% 0.19/0.51
% 0.19/0.51 # Proof search is over...
% 0.19/0.51 # Freeing feature tree
%------------------------------------------------------------------------------