TSTP Solution File: NLP068-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NLP068-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 : n015.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:13 EDT 2022
% Result : Satisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP068-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/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 : n015.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 05:25:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.37 # No SInE strategy applied
% 0.21/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.21/0.37 # and selection function SelectNewComplexAHP.
% 0.21/0.37 #
% 0.21/0.37 # Presaturation interreduction done
% 0.21/0.37 # Number of axioms: 40 Number of unprocessed: 40
% 0.21/0.37 # Tableaux proof search.
% 0.21/0.37 # APR header successfully linked.
% 0.21/0.37 # Hello from C++
% 0.21/0.37 # The folding up rule is enabled...
% 0.21/0.37 # Local unification is enabled...
% 0.21/0.37 # Any saturation attempts will use folding labels...
% 0.21/0.37 # 40 beginning clauses after preprocessing and clausification
% 0.21/0.37 # Creating start rules for all 40 conjectures.
% 0.21/0.37 # There are 40 start rule candidates:
% 0.21/0.37 # Found 2 unit axioms.
% 0.21/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.21/0.37 # 40 start rule tableaux created.
% 0.21/0.37 # 38 extension rule candidate clauses
% 0.21/0.37 # 2 unit axiom clauses
% 0.21/0.37
% 0.21/0.37 # Requested 8, 32 cores available to the main process.
% 0.21/0.52 # 30111 Satisfiable branch
% 0.21/0.52 # Satisfiable branch found.
% 0.21/0.52 # There were 1 total branch saturation attempts.
% 0.21/0.52 # There were 0 of these attempts blocked.
% 0.21/0.52 # There were 0 deferred branch saturation attempts.
% 0.21/0.52 # There were 0 free duplicated saturations.
% 0.21/0.52 # There were 0 total successful branch saturations.
% 0.21/0.52 # There were 0 successful branch saturations in interreduction.
% 0.21/0.52 # There were 0 successful branch saturations on the branch.
% 0.21/0.52 # There were 0 successful branch saturations after the branch.
% 0.21/0.52 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.52 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.52 # Begin clausification derivation
% 0.21/0.52
% 0.21/0.52 # End clausification derivation
% 0.21/0.52 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.52 cnf(i_0_41, negated_conjecture, (actual_world(skc47))).
% 0.21/0.52 cnf(i_0_42, negated_conjecture, (actual_world(skc4))).
% 0.21/0.52 cnf(i_0_49, negated_conjecture, (ssSkP0(skc5,skc4)|~ssSkC0)).
% 0.21/0.52 cnf(i_0_45, negated_conjecture, (ssSkP1(skc48,skc47)|ssSkC0)).
% 0.21/0.52 cnf(i_0_47, negated_conjecture, (group(skc4,skc5)|~ssSkC0)).
% 0.21/0.52 cnf(i_0_43, negated_conjecture, (group(skc47,skc48)|ssSkC0)).
% 0.21/0.52 cnf(i_0_44, negated_conjecture, (six(skc47,skc48)|ssSkC0)).
% 0.21/0.52 cnf(i_0_48, negated_conjecture, (six(skc4,skc5)|~ssSkC0)).
% 0.21/0.52 cnf(i_0_46, negated_conjecture, (male(skc47,skc48)|ssSkC0)).
% 0.21/0.52 cnf(i_0_58, negated_conjecture, (shot(skc4,X1)|~member(skc4,X1,skc5)|~ssSkC0)).
% 0.21/0.52 cnf(i_0_57, negated_conjecture, (shot(skc47,X1)|ssSkC0|~member(skc47,X1,skc48))).
% 0.21/0.52 cnf(i_0_53, negated_conjecture, (cannon(X1,skf19(X1,X2))|ssSkP1(X3,X1))).
% 0.21/0.52 cnf(i_0_50, negated_conjecture, (cannon(X1,skf12(X1,X2))|ssSkP0(X3,X1))).
% 0.21/0.52 cnf(i_0_52, negated_conjecture, (ssSkP0(X1,X2)|male(X2,skf14(X2,X3)))).
% 0.21/0.52 cnf(i_0_51, negated_conjecture, (man(X1,skf14(X1,X2))|ssSkP0(X3,X1))).
% 0.21/0.52 cnf(i_0_55, negated_conjecture, (member(X1,skf19(X1,X2),X2)|ssSkP1(X2,X1))).
% 0.21/0.52 cnf(i_0_56, negated_conjecture, (of(X1,skf19(X1,X2),X2)|ssSkP1(X2,X1))).
% 0.21/0.52 cnf(i_0_54, negated_conjecture, (member(X1,skf12(X1,X2),X2)|ssSkP0(X2,X1))).
% 0.21/0.52 cnf(i_0_60, negated_conjecture, (ssSkC0|~shot(X1,skf21(X1,X2))|~ssSkP0(X3,X1)|~six(X1,X3)|~group(X1,X3)|~actual_world(X1))).
% 0.21/0.52 cnf(i_0_70, negated_conjecture, (~shot(X1,skf9(X1,X2))|~male(X1,X3)|~ssSkP1(X3,X1)|~six(X1,X3)|~group(X1,X3)|~ssSkC0|~actual_world(X1))).
% 0.21/0.52 cnf(i_0_59, negated_conjecture, (of(X1,skf12(X1,X2),skf14(X1,X2))|ssSkP0(X3,X1))).
% 0.21/0.52 cnf(i_0_61, negated_conjecture, (member(X1,skf21(X1,X2),X2)|ssSkC0|~ssSkP0(X2,X1)|~six(X1,X2)|~group(X1,X2)|~actual_world(X1))).
% 0.21/0.52 cnf(i_0_65, negated_conjecture, (man(X1,skf16(X1,X2))|~of(X1,X3,X4)|~member(X1,X3,X4)|~cannon(X1,X3)|~ssSkP1(X4,X1))).
% 0.21/0.52 cnf(i_0_71, negated_conjecture, (member(X1,skf9(X1,X2),X2)|~male(X1,X2)|~ssSkP1(X2,X1)|~six(X1,X2)|~group(X1,X2)|~ssSkC0|~actual_world(X1))).
% 0.21/0.52 cnf(i_0_62, negated_conjecture, (nonreflexive(X1,skf15(X1,X2))|~of(X1,X3,X4)|~member(X1,X3,X4)|~cannon(X1,X3)|~ssSkP1(X4,X1))).
% 0.21/0.52 cnf(i_0_63, negated_conjecture, (present(X1,skf15(X1,X2))|~of(X1,X3,X4)|~member(X1,X3,X4)|~cannon(X1,X3)|~ssSkP1(X4,X1))).
% 0.21/0.52 cnf(i_0_64, negated_conjecture, (event(X1,skf15(X1,X2))|~of(X1,X3,X4)|~member(X1,X3,X4)|~cannon(X1,X3)|~ssSkP1(X4,X1))).
% 0.21/0.52 cnf(i_0_66, negated_conjecture, (fire(X1,skf15(X1,X2))|~of(X1,X3,X4)|~member(X1,X3,X4)|~cannon(X1,X3)|~ssSkP1(X4,X1))).
% 0.21/0.52 cnf(i_0_67, negated_conjecture, (patient(X1,skf15(X1,X2),X2)|~of(X1,X2,X3)|~member(X1,X2,X3)|~cannon(X1,X2)|~ssSkP1(X3,X1))).
% 0.21/0.52 cnf(i_0_68, negated_conjecture, (from_loc(X1,skf15(X1,X2),X2)|~of(X1,X2,X3)|~member(X1,X2,X3)|~cannon(X1,X2)|~ssSkP1(X3,X1))).
% 0.21/0.52 cnf(i_0_69, negated_conjecture, (agent(X1,skf15(X1,X2),skf16(X1,X2))|~of(X1,X3,X4)|~member(X1,X3,X4)|~cannon(X1,X3)|~ssSkP1(X4,X1))).
% 0.21/0.52 cnf(i_0_74, negated_conjecture, (nonreflexive(X1,skf10(X1,X2,X3))|~of(X1,X4,X5)|~member(X1,X4,X6)|~man(X1,X5)|~cannon(X1,X4)|~ssSkP0(X6,X1)|~male(X1,X5))).
% 0.21/0.52 cnf(i_0_73, negated_conjecture, (present(X1,skf10(X1,X2,X3))|~of(X1,X4,X5)|~member(X1,X4,X6)|~man(X1,X5)|~cannon(X1,X4)|~ssSkP0(X6,X1)|~male(X1,X5))).
% 0.21/0.52 cnf(i_0_72, negated_conjecture, (event(X1,skf10(X1,X2,X3))|~of(X1,X4,X5)|~member(X1,X4,X6)|~man(X1,X5)|~cannon(X1,X4)|~ssSkP0(X6,X1)|~male(X1,X5))).
% 0.21/0.52 cnf(i_0_75, negated_conjecture, (fire(X1,skf10(X1,X2,X3))|~of(X1,X4,X5)|~member(X1,X4,X6)|~man(X1,X5)|~cannon(X1,X4)|~ssSkP0(X6,X1)|~male(X1,X5))).
% 0.21/0.52 cnf(i_0_76, negated_conjecture, (patient(X1,skf10(X1,X2,X3),X3)|~of(X1,X3,X2)|~member(X1,X3,X4)|~man(X1,X2)|~cannon(X1,X3)|~ssSkP0(X4,X1)|~male(X1,X2))).
% 0.21/0.52 cnf(i_0_77, negated_conjecture, (from_loc(X1,skf10(X1,X2,X3),X3)|~of(X1,X3,X2)|~member(X1,X3,X4)|~man(X1,X2)|~cannon(X1,X3)|~ssSkP0(X4,X1)|~male(X1,X2))).
% 0.21/0.52 cnf(i_0_78, negated_conjecture, (agent(X1,skf10(X1,X2,X3),X2)|~of(X1,X4,X2)|~member(X1,X4,X5)|~man(X1,X2)|~cannon(X1,X4)|~ssSkP0(X5,X1)|~male(X1,X2))).
% 0.21/0.52 cnf(i_0_80, negated_conjecture, (ssSkP1(X1,X2)|~agent(X2,X3,X4)|~from_loc(X2,X3,skf19(X2,X5))|~patient(X2,X3,skf19(X2,X5))|~fire(X2,X3)|~event(X2,X3)|~present(X2,X3)|~nonreflexive(X2,X3)|~man(X2,X4))).
% 0.21/0.52 cnf(i_0_79, negated_conjecture, (ssSkP0(X1,X2)|~agent(X2,X3,skf14(X2,X4))|~from_loc(X2,X3,skf12(X2,X4))|~patient(X2,X3,skf12(X2,X4))|~fire(X2,X3)|~event(X2,X3)|~present(X2,X3)|~nonreflexive(X2,X3))).
% 0.21/0.52 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.52 # Begin printing tableau
% 0.21/0.52 # Found 10 steps
% 0.21/0.52 cnf(i_0_56, negated_conjecture, (of(skc4,skf19(skc4,skc5),skc5)|ssSkP1(skc5,skc4)), inference(start_rule)).
% 0.21/0.52 cnf(i_0_56806, plain, (patient(skc4,skf10(skc4,skc5,skf19(skc4,skc5)),skf19(skc4,skc5))), inference(closure_rule, [i_0_0])).
% 0.21/0.52 cnf(i_0_56809, plain, (~man(skc4,skc5)), inference(closure_rule, [i_0_0])).
% 0.21/0.52 cnf(i_0_217, plain, (of(skc4,skf19(skc4,skc5),skc5)), inference(extension_rule, [i_0_76])).
% 0.21/0.52 cnf(i_0_56808, plain, (~member(skc4,skf19(skc4,skc5),skc5)), inference(extension_rule, [i_0_55])).
% 0.21/0.52 cnf(i_0_57594, plain, (ssSkP1(skc5,skc4)), inference(extension_rule, [i_0_70])).
% 0.21/0.52 cnf(i_0_57612, plain, (~actual_world(skc4)), inference(closure_rule, [i_0_42])).
% 0.21/0.52 cnf(i_0_56810, plain, (~cannon(skc4,skf19(skc4,skc5))), inference(extension_rule, [i_0_53])).
% 0.21/0.52 cnf(i_0_60496, plain, (ssSkP1(X11,skc4)), inference(extension_rule, [i_0_69])).
% 0.21/0.52 cnf(i_0_56811, plain, (~ssSkP0(skc5,skc4)), inference(extension_rule, [i_0_49])).
% 0.21/0.52 # End printing tableau
% 0.21/0.52 # SZS output end
% 0.21/0.52 # Branches closed with saturation will be marked with an "s"
% 0.21/0.53 # Child (30111) has found a proof.
% 0.21/0.53
% 0.21/0.53 # Proof search is over...
% 0.21/0.53 # Freeing feature tree
%------------------------------------------------------------------------------