TSTP Solution File: SWV482+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV482+1 : TPTP v8.1.0. Released v4.0.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 : n024.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 : Wed Jul 20 18:21:20 EDT 2022
% Result : CounterSatisfiable 2.00s 0.66s
% Output : CNFRefutation 2.00s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV482+1 : TPTP v8.1.0. Released v4.0.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.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 15:49:18 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.39 # No SInE strategy applied
% 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.14/0.39 # and selection function SelectCQIPrecWNTNp.
% 0.14/0.39 #
% 0.14/0.39 # Presaturation interreduction done
% 0.14/0.39 # Number of axioms: 77 Number of unprocessed: 70
% 0.14/0.39 # Tableaux proof search.
% 0.14/0.39 # APR header successfully linked.
% 0.14/0.39 # Hello from C++
% 0.14/0.39 # The folding up rule is enabled...
% 0.14/0.39 # Local unification is enabled...
% 0.14/0.39 # Any saturation attempts will use folding labels...
% 0.14/0.39 # 70 beginning clauses after preprocessing and clausification
% 0.14/0.39 # Creating start rules for all 1 conjectures.
% 0.14/0.39 # There are 1 start rule candidates:
% 0.14/0.39 # Found 5 unit axioms.
% 0.14/0.39 # 1 start rule tableaux created.
% 0.14/0.39 # 65 extension rule candidate clauses
% 0.14/0.39 # 5 unit axiom clauses
% 0.14/0.39
% 0.14/0.39 # Requested 8, 32 cores available to the main process.
% 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.39 # Returning from population with 24 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.39 # We now have 24 tableaux to operate on
% 2.00/0.65 # 24235 Satisfiable branch
% 2.00/0.66 # Satisfiable branch found.
% 2.00/0.66 # There were 1 total branch saturation attempts.
% 2.00/0.66 # There were 0 of these attempts blocked.
% 2.00/0.66 # There were 0 deferred branch saturation attempts.
% 2.00/0.66 # There were 0 free duplicated saturations.
% 2.00/0.66 # There were 0 total successful branch saturations.
% 2.00/0.66 # There were 0 successful branch saturations in interreduction.
% 2.00/0.66 # There were 0 successful branch saturations on the branch.
% 2.00/0.66 # There were 0 successful branch saturations after the branch.
% 2.00/0.66 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.00/0.66 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.00/0.66 # Begin clausification derivation
% 2.00/0.66
% 2.00/0.66 # End clausification derivation
% 2.00/0.66 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.00/0.66 cnf(i_0_1, plain, (p(state(h(n1,n0,n0,n0,n0,n0,n1),h(n1,n0,n0,n0,n0,n0,n0)),iknows(atoms(n0,n0),enc(n0,n0,n0,n0))))).
% 2.00/0.66 cnf(i_0_39, negated_conjecture, (~p(X1,iknows(atoms(n1,X2),X3)))).
% 2.00/0.66 cnf(i_0_36, plain, (~p(state(X1,X2),iknows(atoms(n0,n1),enc(X3,n1,X4,X5))))).
% 2.00/0.66 cnf(i_0_24, plain, (~p(state(X1,h(n1,X2,X3,X4,n1,X5,X6)),iknows(atoms(n0,X7),enc(X8,n1,X9,X10))))).
% 2.00/0.66 cnf(i_0_22, plain, (~p(state(h(n1,X1,X2,X3,n1,X4,X5),X6),iknows(atoms(n0,X7),enc(n1,X8,X9,X10))))).
% 2.00/0.66 cnf(i_0_33, plain, (p(state(X1,X2),iknows(atoms(X3,n1),enc(X4,X5,X6,n1)))|~p(state(X1,X2),iknows(atoms(X3,n1),enc(X4,X5,X6,n0))))).
% 2.00/0.66 cnf(i_0_15, plain, (p(state(X1,h(n1,n1,n0,X2,n0,X3,X4)),X5)|~p(state(X1,h(n1,n0,n0,X2,n0,X3,X4)),X5))).
% 2.00/0.66 cnf(i_0_79, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,n1))).
% 2.00/0.66 cnf(i_0_77, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,n1,X19))).
% 2.00/0.66 cnf(i_0_16, plain, (p(state(X1,h(n1,n0,n1,n0,X2,X3,X4)),X5)|~p(state(X1,h(n1,n0,n0,n0,X2,X3,X4)),X5))).
% 2.00/0.66 cnf(i_0_17, plain, (p(state(X1,h(n1,n0,n0,n1,X2,X3,X4)),X5)|~p(state(X1,h(n1,n0,n0,n0,X2,X3,X4)),X5))).
% 2.00/0.66 cnf(i_0_10, plain, (p(state(h(n1,n1,n0,X1,n0,X2,X3),X4),X5)|~p(state(h(n1,n0,n0,X1,n0,X2,X3),X4),X5))).
% 2.00/0.66 cnf(i_0_11, plain, (p(state(h(n1,n0,n1,n0,X1,X2,X3),X4),X5)|~p(state(h(n1,n0,n0,n0,X1,X2,X3),X4),X5))).
% 2.00/0.66 cnf(i_0_12, plain, (p(state(h(n1,n0,n0,n1,X1,X2,X3),X4),X5)|~p(state(h(n1,n0,n0,n0,X1,X2,X3),X4),X5))).
% 2.00/0.66 cnf(i_0_18, plain, (p(state(X1,h(n1,n0,X2,X3,n1,X4,X5)),X6)|~p(state(X1,h(n1,n0,X2,X3,n0,X4,X5)),X6))).
% 2.00/0.66 cnf(i_0_75, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,n1,X18,X19))).
% 2.00/0.66 cnf(i_0_73, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,n1,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_13, plain, (p(state(h(n1,n0,X1,X2,n1,X3,X4),X5),X6)|~p(state(h(n1,n0,X1,X2,n0,X3,X4),X5),X6))).
% 2.00/0.66 cnf(i_0_19, plain, (p(state(X1,h(n1,X2,X3,X4,X5,n1,X6)),X7)|~p(state(X1,h(n1,X2,X3,X4,X5,n0,X6)),X7))).
% 2.00/0.66 cnf(i_0_14, plain, (p(state(h(n1,X1,X2,X3,X4,n1,X5),X6),X7)|~p(state(h(n1,X1,X2,X3,X4,n0,X5),X6),X7))).
% 2.00/0.66 cnf(i_0_21, plain, (p(state(X1,h(n1,X2,X3,X4,X5,X6,n0)),X7)|~p(state(X1,h(n1,X2,X3,X4,X5,X6,n1)),X7))).
% 2.00/0.66 cnf(i_0_20, plain, (p(state(h(n1,X1,X2,X3,X4,X5,n0),X6),X7)|~p(state(h(n1,X1,X2,X3,X4,X5,n1),X6),X7))).
% 2.00/0.66 cnf(i_0_78, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20,X1))).
% 2.00/0.66 cnf(i_0_71, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,n1,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_69, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,n1,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_76, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X1,X20))).
% 2.00/0.66 cnf(i_0_67, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,n1,X14,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_65, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,n1,X13,X14,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_5, plain, (p(state(X1,h(n1,n1,X2,X3,X4,X5,n1)),iknows(X6,enc(X7,X8,X9,n1)))|~p(state(X1,h(n1,n1,X2,X3,X4,X5,n1)),iknows(X6,enc(X7,X8,X9,n0))))).
% 2.00/0.66 cnf(i_0_74, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X1,X19,X20))).
% 2.00/0.66 cnf(i_0_63, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,n1,X12,X13,X14,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_61, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,n1,X11,X12,X13,X14,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_72, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X1,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_59, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,X6,X7,X8,X9,n1,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_57, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,X6,X7,X8,n1,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_2, plain, (p(state(h(n1,n1,X1,X2,X3,X4,n1),X5),iknows(X6,enc(n1,X7,X8,X9)))|~p(state(h(n1,n1,X1,X2,X3,X4,n1),X5),iknows(X6,enc(n0,X7,X8,X9))))).
% 2.00/0.66 cnf(i_0_70, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X1,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_55, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,X6,X7,n1,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_53, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,X6,n1,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_68, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X1,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_51, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,X5,n1,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_49, plain, (n0!=n1|~epred1_20(X1,X2,X3,X4,n1,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_9, plain, (p(state(X1,h(n1,X2,n1,X3,X4,X5,n1)),iknows(X6,enc(X7,X8,X9,n1)))|~p(state(X1,h(n1,X2,n1,X3,X4,X5,X10)),iknows(X6,enc(X7,X8,X9,n1))))).
% 2.00/0.66 cnf(i_0_66, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X1,X15,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_47, plain, (n0!=n1|~epred1_20(X1,X2,X3,n1,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_45, plain, (n0!=n1|~epred1_20(X1,X2,n1,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_64, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X1,X14,X15,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_43, plain, (n0!=n1|~epred1_20(X1,n1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_41, plain, (n0!=n1|~epred1_20(n1,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19))).
% 2.00/0.66 cnf(i_0_6, plain, (p(state(h(n1,X1,n1,X2,X3,X4,n1),X5),iknows(X6,enc(n1,X7,X8,X9)))|~p(state(h(n1,X1,n1,X2,X3,X4,X10),X5),iknows(X6,enc(n1,X7,X8,X9))))).
% 2.00/0.66 cnf(i_0_62, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X1,X13,X14,X15,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_60, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X1,X12,X13,X14,X15,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_58, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X7,X8,X9,X10,X1,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_56, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X7,X8,X9,X1,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_54, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X7,X8,X1,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_52, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X7,X1,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_50, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X6,X1,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_48, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X5,X1,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_46, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X4,X1,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_44, plain, (X1=n0|X1=n1|~epred1_20(X2,X3,X1,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_25, plain, (p(state(X1,h(n1,X2,X3,X4,n1,X5,X6)),iknows(atoms(X7,n1),enc(X8,X9,X10,n1)))|~p(state(X1,h(n1,X2,X3,X4,n1,X5,X6)),iknows(atoms(X7,n0),enc(X8,X9,X10,n1))))).
% 2.00/0.66 cnf(i_0_42, plain, (X1=n0|X1=n1|~epred1_20(X2,X1,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_40, plain, (X1=n0|X1=n1|~epred1_20(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20))).
% 2.00/0.66 cnf(i_0_23, plain, (p(state(h(n1,X1,X2,X3,n1,X4,X5),X6),iknows(atoms(X7,n1),enc(X8,X9,n1,X10)))|~p(state(h(n1,X1,X2,X3,n1,X4,X5),X6),iknows(atoms(X7,n0),enc(X8,X9,n1,X10))))).
% 2.00/0.66 cnf(i_0_27, plain, (p(state(h(n1,X1,X2,n1,X3,X4,X5),X6),iknows(atoms(X7,n1),enc(X8,X9,n1,X10)))|~p(state(h(n1,X1,X2,n1,X3,X4,X5),X6),iknows(atoms(X7,n1),enc(X8,X9,n0,X10))))).
% 2.00/0.66 cnf(i_0_4, plain, (p(state(h(n1,X1,X2,X3,X4,X5,n1),h(n1,n1,X6,X7,X8,X9,X10)),iknows(X11,enc(X12,n1,X13,X14)))|~p(state(h(n1,X1,X2,X3,X4,X5,n1),h(n1,n1,X6,X7,X8,X9,X10)),iknows(X11,enc(X12,n0,X13,X14))))).
% 2.00/0.66 cnf(i_0_3, plain, (p(state(h(n1,n1,X1,X2,X3,X4,X5),h(n1,X6,X7,X8,X9,X10,n1)),iknows(X11,enc(X12,X13,n1,X14)))|~p(state(h(n1,n1,X1,X2,X3,X4,X5),h(n1,X6,X7,X8,X9,X10,n1)),iknows(X11,enc(X12,X13,n0,X14))))).
% 2.00/0.66 cnf(i_0_8, plain, (p(state(h(n1,X1,X2,X3,X4,X5,n1),h(n1,X6,n1,X7,X8,X9,X10)),iknows(X11,enc(X12,n1,X13,X14)))|~p(state(h(n0,X1,X2,X3,X4,X5,X15),h(n1,X6,n1,X7,X8,X9,X10)),iknows(X11,enc(X12,n1,X13,X14))))).
% 2.00/0.66 cnf(i_0_38, plain, (epred1_20(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20)|~p(state(h(X20,X19,X18,X17,X16,X15,X14),h(X13,X12,X11,X10,X9,X8,X7)),iknows(atoms(X6,X5),enc(X4,X3,X2,X1))))).
% 2.00/0.66 cnf(i_0_7, plain, (p(state(h(n1,X1,n1,X2,X3,X4,X5),h(n1,X6,X7,X8,X9,X10,n1)),iknows(X11,enc(X12,X13,n1,X14)))|~p(state(h(n1,X1,n1,X2,X3,X4,X5),h(n0,X6,X7,X8,X9,X10,X15)),iknows(X11,enc(X12,X13,n1,X14))))).
% 2.00/0.66 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.00/0.66 # Begin printing tableau
% 2.00/0.66 # Found 3 steps
% 2.00/0.66 cnf(i_0_39, negated_conjecture, (~p(state(X6,h(n1,n0,n1,n0,n1,X8,X9)),iknows(atoms(n1,n1),enc(X22,X21,X17,n1)))), inference(start_rule)).
% 2.00/0.66 cnf(i_0_100, plain, (~p(state(X6,h(n1,n0,n1,n0,n1,X8,X9)),iknows(atoms(n1,n1),enc(X22,X21,X17,n1)))), inference(extension_rule, [i_0_25])).
% 2.00/0.66 cnf(i_0_230, plain, (~p(state(X6,h(n1,n0,n1,n0,n1,X8,X9)),iknows(atoms(n1,n0),enc(X22,X21,X17,n1)))), inference(extension_rule, [i_0_16])).
% 2.00/0.66 # End printing tableau
% 2.00/0.66 # SZS output end
% 2.00/0.66 # Branches closed with saturation will be marked with an "s"
% 2.00/0.66 # Child (24235) has found a proof.
% 2.00/0.66
% 2.00/0.66 # Proof search is over...
% 2.00/0.66 # Freeing feature tree
%------------------------------------------------------------------------------