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