%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV234+2 : TPTP v8.1.0. Released v3.2.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 : Wed Jul 20 18:19:43 EDT 2022 % Result : Theorem 0.17s 0.38s % Output : CNFRefutation 0.17s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : SWV234+2 : TPTP v8.1.0. Released v3.2.0. % 0.10/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.31 % Computer : n008.cluster.edu % 0.11/0.31 % Model : x86_64 x86_64 % 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.31 % Memory : 8042.1875MB % 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.31 % CPULimit : 300 % 0.11/0.31 % WCLimit : 600 % 0.11/0.31 % DateTime : Wed Jun 15 00:59:22 EDT 2022 % 0.11/0.32 % CPUTime : % 0.17/0.35 # No SInE strategy applied % 0.17/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.17/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.17/0.35 # % 0.17/0.35 # Presaturation interreduction done % 0.17/0.35 # Number of axioms: 22 Number of unprocessed: 22 % 0.17/0.35 # Tableaux proof search. % 0.17/0.35 # APR header successfully linked. % 0.17/0.35 # Hello from C++ % 0.17/0.35 # The folding up rule is enabled... % 0.17/0.35 # Local unification is enabled... % 0.17/0.35 # Any saturation attempts will use folding labels... % 0.17/0.35 # 22 beginning clauses after preprocessing and clausification % 0.17/0.35 # Creating start rules for all 1 conjectures. % 0.17/0.35 # There are 1 start rule candidates: % 0.17/0.35 # Found 15 unit axioms. % 0.17/0.35 # 1 start rule tableaux created. % 0.17/0.35 # 7 extension rule candidate clauses % 0.17/0.35 # 15 unit axiom clauses % 0.17/0.35 % 0.17/0.35 # Requested 8, 32 cores available to the main process. % 0.17/0.35 # There are not enough tableaux to fork, creating more from the initial 1 % 0.17/0.35 # Creating equality axioms % 0.17/0.35 # Ran out of tableaux, making start rules for all clauses % 0.17/0.35 # Returning from population with 34 new_tableaux and 0 remaining starting tableaux. % 0.17/0.35 # We now have 34 tableaux to operate on % 0.17/0.38 # There were 1 total branch saturation attempts. % 0.17/0.38 # There were 0 of these attempts blocked. % 0.17/0.38 # There were 0 deferred branch saturation attempts. % 0.17/0.38 # There were 0 free duplicated saturations. % 0.17/0.38 # There were 1 total successful branch saturations. % 0.17/0.38 # There were 0 successful branch saturations in interreduction. % 0.17/0.38 # There were 0 successful branch saturations on the branch. % 0.17/0.38 # There were 1 successful branch saturations after the branch. % 0.17/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.17/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.17/0.38 # Begin clausification derivation % 0.17/0.38 % 0.17/0.38 # End clausification derivation % 0.17/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.17/0.38 cnf(i_0_20, plain, (public(a))). % 0.17/0.38 cnf(i_0_14, plain, (public(data))). % 0.17/0.38 cnf(i_0_13, plain, (public(imp))). % 0.17/0.38 cnf(i_0_15, plain, (public(z))). % 0.17/0.38 cnf(i_0_16, plain, (public(pin))). % 0.17/0.38 cnf(i_0_18, plain, (public(k3))). % 0.17/0.38 cnf(i_0_11, plain, (xor(X1,X1)=z)). % 0.17/0.38 cnf(i_0_12, plain, (xor(X1,z)=X1)). % 0.17/0.38 cnf(i_0_8, plain, (enc(X1,enc(inv(X1),X2))=X2)). % 0.17/0.38 cnf(i_0_17, plain, (public(enc(xor(pin,kek),pp)))). % 0.17/0.38 cnf(i_0_10, plain, (xor(xor(X1,X2),X3)=xor(X1,xor(X2,X3)))). % 0.17/0.38 cnf(i_0_19, plain, (public(enc(xor(km,kp(imp)),xor(kek,k3))))). % 0.17/0.38 cnf(i_0_21, plain, (public(enc(xor(km,imp),xor(kek,xor(data,pin)))))). % 0.17/0.38 cnf(i_0_9, plain, (xor(X1,X2)=xor(X2,X1))). % 0.17/0.38 cnf(i_0_22, negated_conjecture, (~public(enc(pp,a)))). % 0.17/0.38 cnf(i_0_2, plain, (public(kp(X1))|~public(X1))). % 0.17/0.38 cnf(i_0_1, plain, (public(xor(X1,X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_3, plain, (public(enc(X1,X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_4, plain, (public(enc(inv(X1),X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_5, plain, (public(enc(enc(inv(xor(km,data)),X1),X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_6, plain, (public(enc(xor(km,X1),X2))|~public(enc(xor(km,imp),X3))|~public(enc(xor(X3,X1),X2))|~public(X1))). % 0.17/0.38 cnf(i_0_7, plain, (public(enc(xor(km,X1),xor(X2,X3)))|~public(enc(xor(km,kp(X1)),X2))|~public(kp(X1))|~public(X3))). % 0.17/0.38 cnf(i_0_68, plain, (X28=X28)). % 0.17/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.17/0.38 # Begin printing tableau % 0.17/0.38 # Found 5 steps % 0.17/0.38 cnf(i_0_20, plain, (public(a)), inference(start_rule)). % 0.17/0.38 cnf(i_0_77, plain, (public(a)), inference(extension_rule, [i_0_5])). % 0.17/0.38 cnf(i_0_127, plain, (~public(a)), inference(closure_rule, [i_0_20])). % 0.17/0.38 cnf(i_0_126, plain, (public(enc(enc(inv(xor(km,data)),a),a))), inference(extension_rule, [i_0_2])). % 0.17/0.38 cnf(i_0_157, plain, (public(kp(enc(enc(inv(xor(km,data)),a),a)))), inference(etableau_closure_rule, [i_0_157, ...])). % 0.17/0.38 # End printing tableau % 0.17/0.38 # SZS output end % 0.17/0.38 # Branches closed with saturation will be marked with an "s" % 0.17/0.38 # There were 1 total branch saturation attempts. % 0.17/0.38 # There were 0 of these attempts blocked. % 0.17/0.38 # There were 0 deferred branch saturation attempts. % 0.17/0.38 # There were 0 free duplicated saturations. % 0.17/0.38 # There were 1 total successful branch saturations. % 0.17/0.38 # There were 0 successful branch saturations in interreduction. % 0.17/0.38 # There were 0 successful branch saturations on the branch. % 0.17/0.38 # There were 1 successful branch saturations after the branch. % 0.17/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.17/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.17/0.38 # Begin clausification derivation % 0.17/0.38 % 0.17/0.38 # End clausification derivation % 0.17/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.17/0.38 cnf(i_0_20, plain, (public(a))). % 0.17/0.38 cnf(i_0_14, plain, (public(data))). % 0.17/0.38 cnf(i_0_13, plain, (public(imp))). % 0.17/0.38 cnf(i_0_15, plain, (public(z))). % 0.17/0.38 cnf(i_0_16, plain, (public(pin))). % 0.17/0.38 cnf(i_0_18, plain, (public(k3))). % 0.17/0.38 cnf(i_0_11, plain, (xor(X1,X1)=z)). % 0.17/0.38 cnf(i_0_12, plain, (xor(X1,z)=X1)). % 0.17/0.38 cnf(i_0_8, plain, (enc(X1,enc(inv(X1),X2))=X2)). % 0.17/0.38 cnf(i_0_17, plain, (public(enc(xor(pin,kek),pp)))). % 0.17/0.38 cnf(i_0_10, plain, (xor(xor(X1,X2),X3)=xor(X1,xor(X2,X3)))). % 0.17/0.38 cnf(i_0_19, plain, (public(enc(xor(km,kp(imp)),xor(kek,k3))))). % 0.17/0.38 cnf(i_0_21, plain, (public(enc(xor(km,imp),xor(kek,xor(data,pin)))))). % 0.17/0.38 cnf(i_0_9, plain, (xor(X1,X2)=xor(X2,X1))). % 0.17/0.38 cnf(i_0_22, negated_conjecture, (~public(enc(pp,a)))). % 0.17/0.38 cnf(i_0_2, plain, (public(kp(X1))|~public(X1))). % 0.17/0.38 cnf(i_0_1, plain, (public(xor(X1,X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_3, plain, (public(enc(X1,X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_4, plain, (public(enc(inv(X1),X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_5, plain, (public(enc(enc(inv(xor(km,data)),X1),X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_6, plain, (public(enc(xor(km,X1),X2))|~public(enc(xor(km,imp),X3))|~public(enc(xor(X3,X1),X2))|~public(X1))). % 0.17/0.38 cnf(i_0_7, plain, (public(enc(xor(km,X1),xor(X2,X3)))|~public(enc(xor(km,kp(X1)),X2))|~public(kp(X1))|~public(X3))). % 0.17/0.38 cnf(i_0_68, plain, (X28=X28)). % 0.17/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.17/0.38 # Begin printing tableau % 0.17/0.38 # Found 5 steps % 0.17/0.38 cnf(i_0_20, plain, (public(a)), inference(start_rule)). % 0.17/0.38 cnf(i_0_77, plain, (public(a)), inference(extension_rule, [i_0_5])). % 0.17/0.38 cnf(i_0_128, plain, (~public(a)), inference(closure_rule, [i_0_20])). % 0.17/0.38 cnf(i_0_126, plain, (public(enc(enc(inv(xor(km,data)),a),a))), inference(extension_rule, [i_0_2])). % 0.17/0.38 cnf(i_0_157, plain, (public(kp(enc(enc(inv(xor(km,data)),a),a)))), inference(etableau_closure_rule, [i_0_157, ...])). % 0.17/0.38 # End printing tableau % 0.17/0.38 # SZS output end % 0.17/0.38 # Branches closed with saturation will be marked with an "s" % 0.17/0.38 # There were 1 total branch saturation attempts. % 0.17/0.38 # There were 0 of these attempts blocked. % 0.17/0.38 # There were 0 deferred branch saturation attempts. % 0.17/0.38 # There were 0 free duplicated saturations. % 0.17/0.38 # There were 1 total successful branch saturations. % 0.17/0.38 # There were 0 successful branch saturations in interreduction. % 0.17/0.38 # There were 0 successful branch saturations on the branch. % 0.17/0.38 # There were 1 successful branch saturations after the branch. % 0.17/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.17/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.17/0.38 # Begin clausification derivation % 0.17/0.38 % 0.17/0.38 # End clausification derivation % 0.17/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.17/0.38 cnf(i_0_20, plain, (public(a))). % 0.17/0.38 cnf(i_0_14, plain, (public(data))). % 0.17/0.38 cnf(i_0_13, plain, (public(imp))). % 0.17/0.38 cnf(i_0_15, plain, (public(z))). % 0.17/0.38 cnf(i_0_16, plain, (public(pin))). % 0.17/0.38 cnf(i_0_18, plain, (public(k3))). % 0.17/0.38 cnf(i_0_11, plain, (xor(X1,X1)=z)). % 0.17/0.38 cnf(i_0_12, plain, (xor(X1,z)=X1)). % 0.17/0.38 cnf(i_0_8, plain, (enc(X1,enc(inv(X1),X2))=X2)). % 0.17/0.38 cnf(i_0_17, plain, (public(enc(xor(pin,kek),pp)))). % 0.17/0.38 cnf(i_0_10, plain, (xor(xor(X1,X2),X3)=xor(X1,xor(X2,X3)))). % 0.17/0.38 cnf(i_0_19, plain, (public(enc(xor(km,kp(imp)),xor(kek,k3))))). % 0.17/0.38 cnf(i_0_21, plain, (public(enc(xor(km,imp),xor(kek,xor(data,pin)))))). % 0.17/0.38 cnf(i_0_9, plain, (xor(X1,X2)=xor(X2,X1))). % 0.17/0.38 cnf(i_0_22, negated_conjecture, (~public(enc(pp,a)))). % 0.17/0.38 cnf(i_0_2, plain, (public(kp(X1))|~public(X1))). % 0.17/0.38 cnf(i_0_1, plain, (public(xor(X1,X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_3, plain, (public(enc(X1,X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_4, plain, (public(enc(inv(X1),X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_5, plain, (public(enc(enc(inv(xor(km,data)),X1),X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_6, plain, (public(enc(xor(km,X1),X2))|~public(enc(xor(km,imp),X3))|~public(enc(xor(X3,X1),X2))|~public(X1))). % 0.17/0.38 cnf(i_0_7, plain, (public(enc(xor(km,X1),xor(X2,X3)))|~public(enc(xor(km,kp(X1)),X2))|~public(kp(X1))|~public(X3))). % 0.17/0.38 cnf(i_0_68, plain, (X28=X28)). % 0.17/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.17/0.38 # Begin printing tableau % 0.17/0.38 # Found 5 steps % 0.17/0.38 cnf(i_0_20, plain, (public(a)), inference(start_rule)). % 0.17/0.38 cnf(i_0_77, plain, (public(a)), inference(extension_rule, [i_0_4])). % 0.17/0.38 cnf(i_0_124, plain, (~public(a)), inference(closure_rule, [i_0_20])). % 0.17/0.38 cnf(i_0_123, plain, (public(enc(inv(a),a))), inference(extension_rule, [i_0_2])). % 0.17/0.38 cnf(i_0_157, plain, (public(kp(enc(inv(a),a)))), inference(etableau_closure_rule, [i_0_157, ...])). % 0.17/0.38 # End printing tableau % 0.17/0.38 # SZS output end % 0.17/0.38 # Branches closed with saturation will be marked with an "s" % 0.17/0.38 # There were 1 total branch saturation attempts. % 0.17/0.38 # There were 0 of these attempts blocked. % 0.17/0.38 # There were 0 deferred branch saturation attempts. % 0.17/0.38 # There were 0 free duplicated saturations. % 0.17/0.38 # There were 1 total successful branch saturations. % 0.17/0.38 # There were 0 successful branch saturations in interreduction. % 0.17/0.38 # There were 0 successful branch saturations on the branch. % 0.17/0.38 # There were 1 successful branch saturations after the branch. % 0.17/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.17/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.17/0.38 # Begin clausification derivation % 0.17/0.38 % 0.17/0.38 # End clausification derivation % 0.17/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.17/0.38 cnf(i_0_20, plain, (public(a))). % 0.17/0.38 cnf(i_0_14, plain, (public(data))). % 0.17/0.38 cnf(i_0_13, plain, (public(imp))). % 0.17/0.38 cnf(i_0_15, plain, (public(z))). % 0.17/0.38 cnf(i_0_16, plain, (public(pin))). % 0.17/0.38 cnf(i_0_18, plain, (public(k3))). % 0.17/0.38 cnf(i_0_11, plain, (xor(X1,X1)=z)). % 0.17/0.38 cnf(i_0_12, plain, (xor(X1,z)=X1)). % 0.17/0.38 cnf(i_0_8, plain, (enc(X1,enc(inv(X1),X2))=X2)). % 0.17/0.38 cnf(i_0_17, plain, (public(enc(xor(pin,kek),pp)))). % 0.17/0.38 cnf(i_0_10, plain, (xor(xor(X1,X2),X3)=xor(X1,xor(X2,X3)))). % 0.17/0.38 cnf(i_0_19, plain, (public(enc(xor(km,kp(imp)),xor(kek,k3))))). % 0.17/0.38 cnf(i_0_21, plain, (public(enc(xor(km,imp),xor(kek,xor(data,pin)))))). % 0.17/0.38 cnf(i_0_9, plain, (xor(X1,X2)=xor(X2,X1))). % 0.17/0.38 cnf(i_0_22, negated_conjecture, (~public(enc(pp,a)))). % 0.17/0.38 cnf(i_0_2, plain, (public(kp(X1))|~public(X1))). % 0.17/0.38 cnf(i_0_1, plain, (public(xor(X1,X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_3, plain, (public(enc(X1,X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_4, plain, (public(enc(inv(X1),X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_5, plain, (public(enc(enc(inv(xor(km,data)),X1),X2))|~public(X2)|~public(X1))). % 0.17/0.38 cnf(i_0_6, plain, (public(enc(xor(km,X1),X2))|~public(enc(xor(km,imp),X3))|~public(enc(xor(X3,X1),X2))|~public(X1))). % 0.17/0.38 cnf(i_0_7, plain, (public(enc(xor(km,X1),xor(X2,X3)))|~public(enc(xor(km,kp(X1)),X2))|~public(kp(X1))|~public(X3))). % 0.17/0.38 cnf(i_0_68, plain, (X28=X28)). % 0.17/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.17/0.38 # Begin printing tableau % 0.17/0.38 # Found 5 steps % 0.17/0.38 cnf(i_0_20, plain, (public(a)), inference(start_rule)). % 0.17/0.38 cnf(i_0_77, plain, (public(a)), inference(extension_rule, [i_0_4])). % 0.17/0.38 cnf(i_0_125, plain, (~public(a)), inference(closure_rule, [i_0_20])). % 0.17/0.38 cnf(i_0_123, plain, (public(enc(inv(a),a))), inference(extension_rule, [i_0_2])). % 0.17/0.38 cnf(i_0_157, plain, (public(kp(enc(inv(a),a)))), inference(etableau_closure_rule, [i_0_157, ...])). % 0.17/0.38 # End printing tableau % 0.17/0.38 # SZS output end % 0.17/0.38 # Branches closed with saturation will be marked with an "s" % 0.17/0.38 # Child (1256) has found a proof. % 0.17/0.38 % 0.17/0.38 # Proof search is over... % 0.17/0.38 # Freeing feature tree %------------------------------------------------------------------------------